A comprehensive benchmark between two filter-based multiple-point simulation algorithms

نویسندگان

  • A.R. Arab-Amiri Faculty of Mining, Petroleum & Geophysics Engineering, Shahrood University of Technology, Shahrood, Iran
  • B. Tokhmechi Faculty of Mining, Petroleum & Geophysics Engineering, Shahrood University of Technology, Shahrood, Iran
  • E. Gloaguen Centre Eau Terre Environnement, Institut National de la Recherche Scientifique, Québec, Canada
  • M. Bavand Savadkoohi Faculty of Mining, Petroleum & Geophysics Engineering, Shahrood University of Technology, Shahrood, Iran
چکیده مقاله:

Computer graphics offer various gadgets to enhance the reconstruction of high-order statistics that are not correctly addressed by the two-point statistics approaches. Almost all the newly developed multiple-point geostatistics (MPS) algorithms, to some extent, adapt these techniques to increase the simulation accuracy and efficiency. In this work, a scrutiny comparison between our recently developed MPS algorithm, the cross-correlation-wavelet simulation (CCWSIM), and a well-known MPS algorithm, FILTERSIM, is performed. The main motivation to benchmark these two algorithms is that both exploit some digital image processing filters for feature extraction. Indeed, both algorithms compute the similarity (or dissimilarity) between data events in simulation grid and training image in the feature space. In order to compare the accuracy of the algorithms, some statistics such as facies proportion, variogram, and connectivity function are computed. The results obtained reveal an excellent agreement of the CCWSIM realizations with the training image rather than FILTERSIM. Furthermore, on average, the required simulation runtime for CCWSIM is at least 10 times less than that for FILTERSIM.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image Restoration with Two-Dimensional Adaptive Filter Algorithms

Two-dimensional (TD) adaptive filtering is a technique that can be applied to many image, and signal processing applications. This paper extends the one-dimensional adaptive filter algorithms to TD structures and the novel TD adaptive filters are established. Based on this extension, the TD variable step-size normalized least mean squares (TD-VSS-NLMS), the TD-VSS affine projection algorithms (...

متن کامل

A Ranking Method Based on Common Weights and Benchmark Point

The highest efficiency score 1 (100% efficiency) is regarded as a common benchmark for Decision Making Units (DMUs). This brings about the existence of more than one DMU with the highest score. Such a case normally occurs in all Data Envelopment Analysis (DEA) models and also in all the Common Set of Weights (CSWs) methods and it may lead to the lack of thorough ranking of DMUs. And ideal DMU b...

متن کامل

Design and Simulation of a Metal-Insulator-Metal Filter Based on Plasmonic Split Ring

In this paper, a plasmonic filter made of a split ring, two U-shaped structures and two straight waveguides is designed and investigated. In the proposed structure, the split ring and U-shaped structures are situated between straight waveguides. Simulations are done based on FDTD method. Split ring, U-shaped structures and straight waveguides are made of air in the silver background. In the pro...

متن کامل

MRBS: A Comprehensive MapReduce Benchmark Suite

MapReduce is a promising programming model for distributed data processing. Extensive research has been conducted on the scalability of MapReduce, and several systems have been proposed in the literature, ranging from job scheduling to data placement and replication. However, realistic benchmarks are still missing to analyze and compare the effectiveness of these proposals. To date, most MapRed...

متن کامل

A performance comparison between two consensus-based distributed optimization algorithms

In this paper we address the problem of multi-agent optimization for convex functions expressible as sums of convex functions. Each agent has access to only one function in the sum and can use only local information to update its current estimate of the optimal solution. We consider two consensus-based iterative algorithms, based on a combination between a consensus step and a subgradient decen...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 10  شماره 1

صفحات  139- 149

تاریخ انتشار 2019-01-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023