Abstract
Geological sampling data often need to be regionally segmented to mark blocks with different geological properties in mathematical geosciences. This paper uses the directed graph model of graph theory to model sampling data and calculate the segmentation of the directed graph by the improved maximum flow minimum cut (max-flow min-cut) algorithm. The proposed energy expressions reflect the continuity of geological properties and the smoothness of segmentation boundaries. A major advantage of this method is that it allows geological experts to share prior knowledge regarding the partitioning of a mineralization area as the seeds of the directed graph. Incorporating this knowledge in the segmentation result via a very intuitive and simple outline operation greatly improves the interactivity and editability of the algorithm. For the integrity of the process framework, this paper also proposes incorporating the characteristic scale of the Hilbert–Huang transformation (HHT) framework as the characteristic parameter to calculate the initial seed, which can achieve automatic regional segmentation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andrew M (2018) A quantified study of segmentation techniques on synthetic geological XRM and FIB-SEM images. Comput Geosci 22(6):1503–1512
Asmussen P, Conrad O, Günther A et al (2015) Semi-automatic segmentation of petrographic thin section images using a “seeded-region growing algorithm” with an application to characterize wheathered subarkose sandstone. Comput Geosci 83:89–99
Bansal AR, Dimri VP (2005a) Self-affine gravity covariance model for the Bay of Bengal. Geophys J Int 161(1):21–30
Bansal AR, Dimri VP (2005b) Depth determination from a non-stationary magnetic profile for scaling geology. Geophys Prospect 53(3):399–410
Bansal AR, Dimri VP (2014) Modelling of magnetic data for scaling geology. Geophys Prospect 62(2):385–396
Boykov Y, Kolmogorov V (2004) An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans Pattern Anal Mach Intell (PAMI) 26:1124–1137
Boykov Y, Veksler O, Zabih R (2001) Faster approximate energy minimization via graph cuts. IEEE Trans Pattern Anal Mach Intell (PAMI) 23(11):1–18
Blum A, Lafferty J, Rwebangira M, Reddy R (2004) Semi-supervised learning using randomized mincuts. In: Proceedings of the 21st international conference on machine learning (ICML). Banff, Canada
Cheng QM (2003) Non-linear mineralization model and information processing methods for prediction of unconventional mineral resources. Earth Sci-J China Univ Geosci 28(4):1–10 (in Chinese with English abstract)
Ford LR, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton
Goldberg AV, Tarjan RE (1988) A new approach to the maximum-flow problem. J Assoc Comput Mach 35(4):921–940
Hou CQ, Wu XB, Li ZQ et al (2013) Extraction of geochemical anomalies of lead zinc deposits in Lhasa Zedang area by geochemical mineralization energy field method. Geol Explor 49(6):1123–1129
Huang GC, Cheng QH (2019) Remote sensing monitoring and analysis of the area change of nearly 30a Qilu Lake. Adv Geosci 11:1064–1070
Hruška M, Corea W, Seeburger D et al (2009) Automated segmentation of resistivity image logs using wavelet transform. Math Geosci 41(6):703–716
Izadi H, Sadri J, Mehran NA (2015) A new intelligent method for minerals segmentation in thin sections based on a novel incremental color clustering. Comput Geosci 81:38–52
Izadi H, Sadri J, Hormozzade F, Fattahpour V (2020) Altered mineral segmentation in thin sections using an incremental-dynamic clustering algorithm. Eng Appl Artif Intell 90:0952–1976
Kohli P, Torr PHS (2007) Dynamic graph cuts for efficient inference in Markov random fields. IEEE Trans Pattern Anal Mach Intell (PAMI) 29(12):2079–2088
Kolmogorov V, Zabih R (2002) Multi-camera scene reconstruction via graph cuts. In: European Conference on Computer Vision (ECCV)
Kolmogorov V, Zabih R (2004) What energy functions can be minimized via graph cuts? IEEE Trans Pattern Anal Mach Intell (PAMI) 26(2):147–159
Kwatra V, Schodl A, Essa I et al (2003) Graphcut textures: image and video synthesis using graph cuts. ACM Trans Gr 22(3):277–286
Li SZ (1995) Markov random field modeling in computer vision. Springer-Verlag, Tokyo
Rosen KH (2019) Discrete mathematics and its applications. McGraw-Hill Education, New York
Roy S, Cox I (1998) A maximum-flow formulation of the n-camera stereo correspondence problem. In: International conference on computer vision (ICCV)
Turcotte DL (1997) Fractals and chaos in geology and geophysics, 2nd edn. Cambridge University Press, Cambridge
Vineet V, Narayanan PJ (2008) CUDA cuts: fast graph cuts on the GPU. In: CVPR workshop on visual computer vision on GPUs
Zhao J, Zhao PD, Chen YQ (2016) Using an improved BEMD method to analyse the characteristic scale of aeromagnetic data in the Gejiu region of Yunnan, China. Comput Geosci 88:132–141
Acknowledgements
This research is supported by the project of Yunnan Gejiu large-super large Sn–Cu-polymetallic deposit metallogenic geodynamics background, process and quantitative evaluation, the National Natural Science Fund (41272365, 40972232 and 40772197) and the National High-Tech Research & Development (No: 2006AA06Z113), as well as the China Geological Survey Project (No: 1212011220922). We thank the Yanna Geological Survey for providing the original geochemical data for this study. I am also grateful to my tutor Professor Xuanxue Mo, Professor Pengda Zhao, Professor Yongqing Chen and my friends Duoyu Zhang and Zeyuan Ren.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhao, J., Mo, X., Zhao, P. et al. Using the Graph-Cut Method to Segment the Mineralization Area in the Gejiu Region of Yunnan Province, China. Math Geosci 53, 1617–1642 (2021). https://doi.org/10.1007/s11004-021-09933-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11004-021-09933-1