2017
DOI: 10.1007/s10596-016-9612-1
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting transformation-domain sparsity for fast query in multiple-point geostatistics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 30 publications
0
9
0
Order By: Relevance
“…In (Abdollahifard & Nasiri, 2017), Abdollahifard and Nasiri proposed an approach to speed up template matching for MPS methods. The key idea consists of calculating the similarity between data events and TI's patterns using a low dimension approximation of them.…”
Section: Review Of the Fast Template Matching In Transform Domain Basmentioning
confidence: 99%
See 2 more Smart Citations
“…In (Abdollahifard & Nasiri, 2017), Abdollahifard and Nasiri proposed an approach to speed up template matching for MPS methods. The key idea consists of calculating the similarity between data events and TI's patterns using a low dimension approximation of them.…”
Section: Review Of the Fast Template Matching In Transform Domain Basmentioning
confidence: 99%
“…The approaches of Abdollahifard & Nasiri (2017) and LSHSIM are quite different. The former does an exhaustive search in the set of low dimension patterns while the latter does an optimized search (RLE based) in a subset of the original patterns that are likely to be close to the data event.…”
Section: Review Of the Fast Template Matching In Transform Domain Basmentioning
confidence: 99%
See 1 more Smart Citation
“…In fact, we understand that (Abdollahifard & Nasiri, 2017) is much more related with CCSIM (Tahmasebi et al, 2012) since both rely on efficiently calculating convolutions. If a fast Fourier transformation (FFT) is employed, as proposed in MS-CCSIM , CCSIM executes log k operations per pattern/data event comparisons, where k is the number of pixels of the data event.…”
Section: Dctmentioning
confidence: 99%
“…If a fast Fourier transformation (FFT) is employed, as proposed in MS-CCSIM , CCSIM executes log k operations per pattern/data event comparisons, where k is the number of pixels of the data event. Thus, (Abdollahifard & Nasiri, 2017) is advantageous with respect to CCSIM, in terms of speed, if m < log k can be chosen. In terms of reproduction quality, CCSIM has the potential advantage of not losing information.…”
Section: Dctmentioning
confidence: 99%