Delineation of geological facies from poorly differentiated data |
| |
Authors: | Brendt Wohlberg Daniel M Tartakovsky |
| |
Institution: | 1. Theoretical Division, Los Alamos National Laboratory, Los Alamos, NM 87545, USA;2. Department of Mechanical and Aerospace Engineering, University of California, San Diego, 9500 Gilman Dr., MC 0411, La Jolla, CA 92093, USA |
| |
Abstract: | The ability to delineate geologic facies and to estimate their properties from sparse data is essential for modeling physical and biochemical processes occurring in the subsurface. If such data are poorly differentiated, this challenging task is complicated further by the absence of a clear distinction between different hydrofacies at locations where data are available. We consider three alternative approaches for analysis of poorly differentiated data: a k-means clustering algorithm, an expectation–maximization algorithm, and a minimum-variance algorithm. Two distinct synthetically generated geological settings are used to analyze the ability of these algorithms to assign accurately the membership of such data in a given geologic facies. On average, the minimum-variance algorithm provides a more robust performance than its two counterparts, and when combined with a nearest neighbor algorithm, it also yields the most accurate reconstruction of the boundaries between the facies. |
| |
Keywords: | Geostatistics Nearest neighbor Undifferentiated Classification Measurement error |
本文献已被 ScienceDirect 等数据库收录! |
|