An MPS Algorithm Based on Pattern Scale-Down Cluster

  • Siyu Y
  • Shaohua L
  • Youbin H
  • et al.
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A key evaluation indicator of multiple-point geostatistics modeling algorithm is ensuring model quality as well as harmonizing the modeling calculation of time-consuming and space-consuming RAM. Due to the inherent flaws of SIMPAT, poor efficiency of similarity match computation between the data event and the whole pattern of train image led to the impracticability of SIMPAT many years after it was proposed. Some improvement following methods based on SIMPAT, such as Filtersim and DisPat, still did not resolve the problem. After studying key points of SIMPAT, this paper proposes PSCSIM algorithm based on a pattern scale-down clustering strategy which uses an interval sampling technique. Unlike SIMPAT, PSCSIM replaces the one-step similarity computation with the two-step similarity computation: firstly, comparing the representative patterns of the pattern cluster to the data event to find the most related pattern cluster and, secondly, matching the similarity of whole patterns in a pattern cluster with the data event to search the target pattern. With the same condition, this paper made a comparison of modeling in two dimensions and three dimensions among with PSCSIM, SIMPAT, Snesim, Filtersim, and DisPat in the end. As a result, PSCSIM greatly improves modeling efficiency on the premise of quality assurance.

Cite

CITATION STYLE

APA

Siyu, Y., Shaohua, L., Youbin, H., Jinyu, T., & Weiyan, D. (2017). An MPS Algorithm Based on Pattern Scale-Down Cluster (pp. 709–720). https://doi.org/10.1007/978-3-319-46819-8_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free