Cluster Analysis of Seismic Data Based on Region Scalable Fitting Model

Article Preview

Abstract:

In order to analysis seismic data, we propose a cluster analysis method based on region scalable fitting model which aims to adapt the image segmentation algorithm to cluster analysis. The method can be divided into 4 parts: dimension reduction, data segmentation, feature extraction, and feature cluster. Finally, we do cluster validity evaluation. The validity evaluation results show that the computational complexity of the new algorithm is relatively lower than the ordinary ones and the inhomogeneous data of high dimension can be analyzed effectively by our model. In this paper, the RSF model was applied in the high-dimensional space. Since the original sample quantity is dramatically reduced by the new algorithm, our model can be incorporated into the algorithms which have strict requirements for the size of sample.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 1049-1050)

Pages:

1631-1636

Citation:

Online since:

October 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Sabeti H, Javaherian A. Seismic Facies Analysis Based on K-means Clustering Algorithm Using 3D Seismic Attributes[C]. 1st International Petroleum Conference and Exhibition. (2009).

DOI: 10.3997/2214-4609.20145876

Google Scholar

[2] Roy A, Romero-Peláez A S, Kwiatkowski T J, et al. Generative topographic mapping for seismic facies estimation of a carbonate wash, Veracruz Basin, southern Mexico[J]. Interpretation, 2014, 2(1).

DOI: 10.1190/int-2013-0077.1

Google Scholar

[3] Kass M, Witkin A, Terzopoulos D. Snakes: Active contour models[J]. International journal of computer vision, 1988, 1(4): 321-331.

DOI: 10.1007/bf00133570

Google Scholar

[4] Li C, Xu C, Gui C, et al. Level set evolution without re-initialization: a new variational formulation[C]. Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on. IEEE, 2005, 1: 430-436.

DOI: 10.1109/cvpr.2005.213

Google Scholar

[5] Li C, Kao C Y, Gore J C, et al. Minimization of region-scalable fitting energy for image segmentation[J]. Image Processing, IEEE Transactions on, 2008, 17(10): 1940-(1949).

DOI: 10.1109/tip.2008.2002304

Google Scholar

[6] Fodor I K. A survey of dimension reduction techniques[J]. (2002).

Google Scholar

[7] He X, Niyogi P. Locality preserving projections[C]. NIPS. 2003, 16: 234-241.

Google Scholar

[8] Stanley Osher Ronald Fedkiw, Level Set Methods and Dynamic Implicit Surfaces [M]. (2003).

Google Scholar

[9] Guyon I, Gunn S, Nikravesh M, et al. Feature extraction[J]. Foundations and applications, (2006).

Google Scholar

[10] Stricker M A, Orengo M. Similarity of color images[C]. SPIE's Symposium on Electronic Imaging: Science & Technology. International Society for Optics and Photonics, 1995: 381-392.

Google Scholar

[11] Han J, Kamber M, Pei J. Data mining: concepts and techniques[M]. Morgan kaufmann, (2006).

Google Scholar

[12] Seize T K. Student's t-test[J]. Southern Medical Journal, 1977, 70(11): 1299.

Google Scholar

[13] Van Dam A, Feiner S K. Computer graphics: principles and practice[M]. Pearson Education, (2014).

Google Scholar

[14] Žalik K R, Žalik B. Validity index for clusters of different sizes and densities[J]. Pattern Recognition Letters, 2011, 32(2): 221-234.

DOI: 10.1016/j.patrec.2010.08.007

Google Scholar

[15] Maulik U, Bandyopadhyay S. Performance evaluation of some clustering algorithms and validity indices[J]. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 2002, 24(12): 1650-1654.

DOI: 10.1109/tpami.2002.1114856

Google Scholar