×

Enhanced multiple-point statistical simulation with backtracking, forward checking and conflict-directed backjumping. (English) Zbl 1411.86012

Math. Geosci. 51, No. 2, 155-186 (2019); correction ibid. 51, No. 2, 265 (2019).
Summary: During a conventional multiple-point statistics simulation, the algorithm may not find a matched neighborhood in the training image for some unsimulated pixels. These pixels are referred to as the dead-end pixels; the existence of the dead-end pixels means that multiple-point statistics simulation is not a simple sequential simulation. In this paper, the multiple-point statistics simulation is cast as a combinatorial optimization problem, and the efficient backtracking algorithm is developed to solve this optimization problem. The efficient backtracking consists of backtracking, forward checking, and conflict-directed backjumping algorithms that are introduced and discussed in this paper. This algorithm is applied to simulate multiple-point statistics properties of some synthetic training images; the results show that no anomalies occurred in any of the produced realizations as opposed to previously published methods for solving the dead-end pixels. In particular, in simulating a channel system, all the channels generated by this method are continuous, which is of paramount importance in fluid flow simulation applications. The results also show that the presence of hard data does not degrade the quality of the generated realizations. The presented method provides a robust algorithmic framework for performing MPS simulation.

MSC:

86A32 Geostatistics

Software:

AIspace
Full Text: DOI

References:

[1] Arpat GB, Caers J (2007) Conditional simulation with patterns. Math Geol 39:177-203 · doi:10.1007/s11004-006-9075-3
[2] Beldiceanu N, Carlsson M, Rampon JX (2010) Working version of SICS. https://sofdem.github.io/gccat/gccat/titlepage.html. Accessed 27 July 2018
[3] Brélaz D (1979) New methods to color the vertices of a graph. Commun ACM 22:251-256. https://doi.org/10.1145/359094.359101 · Zbl 0394.05022 · doi:10.1145/359094.359101
[4] Caers J, Hoffman T (2006) The probability perturbation method: a new look at Bayesian inverse modeling. Math Geol 38:81-100. https://doi.org/10.1007/s11004-005-9005-9 · Zbl 1119.86312 · doi:10.1007/s11004-005-9005-9
[5] Comunian A, Renard P, Straubhaar J (2012) 3D multiple-point statistics simulation using 2D training images. Comput Geosci 40:49-65 · doi:10.1016/j.cageo.2011.07.009
[6] Hu LY, Chugunova T (2008) Multiple-point geostatistics for modeling subsurface heterogeneity: a comprehensive review. Water Resour Res. https://doi.org/10.1029/2008WR006993 · doi:10.1029/2008WR006993
[7] Jeavons P, Krokhin A, Živný S (2014) The complexity of valued constraint satisfaction. Bull EATCS 113:21-55 · Zbl 1409.68141
[8] Krząkała F, Zdeborová L (2008) Phase transitions and computational difficulty in random constraint satisfaction problems. J Phys Conf Ser 95:012012 · doi:10.1088/1742-6596/95/1/012012
[9] Lhomme O (1993) Consistency techniques for numeric CSPs. IJCAI 93:232-238
[10] Mackworth AK (1977) Consistency in networks of relations. Artif Intell 8:99-118. https://doi.org/10.1016/0004-3702(77)90007-8 · Zbl 0341.68061 · doi:10.1016/0004-3702(77)90007-8
[11] Mariethoz G, Renard P, Caers J (2010a) Bayesian inverse problem and optimization with iterative spatial resampling. Water Resour Res. https://doi.org/10.1029/2010WR009274 · doi:10.1029/2010WR009274
[12] Mariethoz G, Renard P, Straubhaar J (2010b) The direct sampling method to perform multiple-point geostatistical simulations. Water Resour Res. https://doi.org/10.1029/2008WR007621 · doi:10.1029/2008WR007621
[13] Minton S, Johnston MD, Philips AB, Laird P (1992) Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artif Intell 58:161-205. https://doi.org/10.1016/0004-3702(92)90007-K · Zbl 0782.90054 · doi:10.1016/0004-3702(92)90007-K
[14] Poole DL, Mackworth AK (2010) Artificial intelligence: foundations of computational agents. Cambridge University Press, New York, p 122 · Zbl 1204.68151 · doi:10.1017/CBO9780511794797
[15] Prosser P (1993) Hybrid algorithms for the constraint satisfaction problem. Comput Intell 9:268-299. https://doi.org/10.1111/j.1467-8640.1993.tb00310.x · doi:10.1111/j.1467-8640.1993.tb00310.x
[16] Russell SJ, Norvig P (2010) Artificial intelligence: a modern approach. Pearson Education Limited, Kuala Lumpur, pp 202-233
[17] Strebelle S (2002) Conditional simulation of complex geological structures using multiple-point statistics. Math Geol 34:1-21. https://doi.org/10.1023/A:1014009426274 · Zbl 1036.86013 · doi:10.1023/A:1014009426274
[18] Strebelle S (2003) New multiple-point statistics simulation implementation to reduce memory and cpu-time demand. In: Proceedings to the IAMG 2003
[19] Suzuki S, Strebelle S (2007) Real-time post-processing method to enhance multiple-point statistics simulation. In: EAGE. Petroleum Geostatistics 2007, Cascais, Portugal. https://doi.org/10.3997/2214-4609.201403072
[20] Wu J, Zhang T, Journel A (2010) Fast filtersim simulation with score-based distance. Math Geosci 40:773-788 · Zbl 1174.86311 · doi:10.1007/s11004-008-9157-5
[21] Yokoo M, Hirayama K (2000) Algorithms for distributed constraint satisfaction: a review. Auton Agent Multi-Agent Syst 3:185-207. https://doi.org/10.1023/A:1010078712316 · doi:10.1023/A:1010078712316
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.