2016
DOI: 10.1016/j.cageo.2015.10.010
|View full text |Cite
|
Sign up to set email alerts
|

Fast multiple-point simulation using a data-driven path and an efficient gradient-based search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(8 citation statements)
references
References 27 publications
0
8
0
Order By: Relevance
“…The Fig. 10 a, b Two realizations produced using FPSIM [14], c, d two realizations obtained from IQ [12]. Template size is 35 × 35 for both methods, number replicas N rep is 3 for FPSIM, and 10 for IQ.…”
Section: Application Of the Methodologymentioning
confidence: 99%
See 1 more Smart Citation
“…The Fig. 10 a, b Two realizations produced using FPSIM [14], c, d two realizations obtained from IQ [12]. Template size is 35 × 35 for both methods, number replicas N rep is 3 for FPSIM, and 10 for IQ.…”
Section: Application Of the Methodologymentioning
confidence: 99%
“…While pixel-based methods transfer only one pixel (voxel) from each found match [5][6][7][8][9][10], patch-based methods achieve higher speed and better pattern reproduction performance by transferring a large number of pixels (voxels) at once [11][12][13][14][15][16][17][18]. However, patch-based methods suffer from some important limitations including difficulty of handling conditioning data, low variability, and verbatim copy of the large patches of the TI into the SG (i.e., large portions copied identically from the TI).…”
Section: Introductionmentioning
confidence: 99%
“…Besides, the reduction on the search space can be controlled by a parameter α. As an example, for the experiments with 2D categorical TIs, to be presented in Chapter 5, we use α = 0.5%, which reduces the original LSHSIM: A Locality Sensitive Hashing Based Method for Multiple-Point Geostatistics 24 space of patterns by a factor of at least 200 and, hence, is comparable to the reduction of hundreds of times reported in (Abdollahifard, 2016). It is also worth mentioning that the evolution of methods belonging to MPS has followed the same path as in the computer vision area, where it is named as texture synthesis, such as described by the review of Mariethoz & Lefebvre (2014).…”
Section: Multiple-point Geostatisticsmentioning
confidence: 99%
“…Recently, Abdollahifard (2016) proposed the FPSIM method which explores two points: (i) a new path strategy that prioritizes data-events placed in the contour between the filled and empty regions of a realization; (ii) a search scheme that is based on the gradient vector of the central pixel of data-events. This search first compares this gradient vector with the gradient of each TI's pixel, in order to obtain a set of candidate patterns, and then performs a search in this set using the Euclidean distance.…”
Section: Multiple-point Geostatisticsmentioning
confidence: 99%
“…As for complex geological backgrounds or elements' spatial distribution patterns, more than two statistical points should be described. The multiple-point geostatistical simulation is a target-based simulation method, which focuses on multiple-point patterns in space and absorbs the advantages of traditional two-point geostatistics to better characterize the spatial variability and delineate the uncertainty of variables [20][21][22][23][24]. Relevant simulation algorithms include pixel-based simulations, such as the extended normal equations simulation (ENESIM) algorithm [20], the single normal equation simulation (SNESIM) algorithm [25], and direct sampling (DS) algorithm [26,27]; pattern-based simulations, such as the simulation of patterns (SIMPAT) algorithm [28]; the filter-based pattern simulation (FILTERSIM) algorithm [29], and the cross-correlation-based simulation (CCSIM) algorithm [30].…”
Section: Introductionmentioning
confidence: 99%