A new method of fast distance transform 3D image based on “neighborhood between voxels in space” theory

Digital core technology is a new type of tool for analyzing and explaining the flow characteristics and fluid distribution of reservoir. Digital core technology has been widely used in recent years to describe features of pose space and simulate the process of fluid flow. As the basement of segmentation of pore space and reconstruction of pore network, the improvement of distance transform method has great impact on the development of digital core analysis technology. The accuracy and computation speed of distance transform method can directly affect the size of digital data and the detailedness of pore network model. Euclidean distance transform is the most precise one among all the distance transform methods, which means it is suitable for processing digital core data and calculating distance map. For traditional Euclidean distance transform method application in three-dimensional space data, there exist problems, such as too many search directions, large amount of data, and time-consuming. Large-scale data of digital core is hard to be transformed by this method. Therefore, a new theory of space based geometric topology neighbor relationship distance search algorithm was proposed in this paper. By introducing theory of neighborhood in 3D space, the relationship between 3 ´ 3 ´ 3 neighborhood with whole core data can be constructed, the computational area is greatly narrowed so that computation speed can be improved markedly. Then, instead of calculating every distance between pore voxels and skeleton voxels, the Euclidean distance of a pore voxel can be obtained by scanning the distance value of its 3 ´ 3 ´ 3 neighborhood. Exact Euclidean distance map of digital core data includes large-scale data showed after only two-scans. Noteworthily, due to the disturbing of boundary points which out the range of data size, special treatment is needed to process the pore voxels which near boundary of digital core data. Compared to existing methods, according to the interior of the rock pore structure characteristics, we simplified the comparison rules of the neighbor domain Euclidean distance value so that we can significantly improve computing capacity and computation speed of the Euclidean distance transform method. By this way, a large number of operations by the complex Euclidean distance structure can be avoided. And the complexity of the algorithm is better understood and applied. This article describes the process of the algorithm in detail and the method is extended to characterize pore space segmentation work of digital cores. Fractured-cave digital core, fractured digital core and kinds of digital core data were transformed by the new method, the results show that the method is more accurate and efficient for the segmentation and reconstruction of pore space model. On this basis, pore structure characteristics of pore space can be extracted and analyzed by digital core technology, and more parameters like permeability, formation factor, and so on, can be simulated. This paper created a new distance transform method on digital rock identification and extraction, which laid a theoretical foundation for the efficient development of microscopic description of oil and gas reservoirs, especially for fractured and vuggy reservoirs.

[1]  Azriel Rosenfeld,et al.  Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..

[2]  W. B. Lindquist,et al.  Pore and throat size distributions measured from synchrotron X-ray tomographic images of Fontaineble , 2000 .

[3]  Benoit M. Macq,et al.  Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods , 1999, Comput. Vis. Image Underst..

[4]  Alexandre X. Falcão,et al.  Fast Euclidean distance transform using a graph-search algorithm , 2000, Proceedings 13th Brazilian Symposium on Computer Graphics and Image Processing (Cat. No.PR00878).

[5]  Stina Svensson,et al.  Digital Distance Transforms in 3D Images Using Information from Neighbourhoods up to 5×5×5 , 2002, Comput. Vis. Image Underst..

[6]  Calvin R. Maurer,et al.  A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Francisco de A. T. de Carvalho,et al.  Clustering of interval data based on city-block distances , 2004, Pattern Recognit. Lett..

[8]  Frank Y. Shih,et al.  Fast Euclidean distance transformation in two scans using a 3 × 3 neighborhood , 2004, Comput. Vis. Image Underst..

[9]  J. Coenen,et al.  MEASUREMENT PARAMETERS AND RESOLUTION ASPECTS OF MICRO X-RAY TOMOGRAPHY FOR ADVANCED CORE ANALYSIS , 2004 .

[10]  Zhang Jianhua 3D Spatial Data Models of GIS Based on Grid , 2004 .

[11]  Xuan Yi A RECONSTRUCTION TECHNIQUE FOR THREE DIMENSIONAL POROUS MEDIA USING IMAGE ANALYSIS AND FOURIER TRANSFORM , 2008 .

[12]  Kingo Itaya,et al.  Supramolecular pattern of fullerene on 2D bimolecular "chessboard" consisting of bottom-up assembly of porphyrin and phthalocyanine molecules. , 2008, Journal of the American Chemical Society.

[13]  Fang Ke-rong A new reasonable segmentation method for microstructure image of reservoir rock , 2009 .

[14]  Richard C. H. Connor,et al.  A bounded distance metric for comparing tree structure , 2011, Inf. Syst..

[15]  Nigel P. Brandon,et al.  Using Synchrotron X-Ray Nano-CT to Characterize SOFC Electrode Microstructures in Three-Dimensions at Operating Temperature , 2011 .

[16]  Ya-Pu Zhao,et al.  Microcrack connectivity in rocks: a real-space renormalization group approach for 3D anisotropic bond percolation , 2016 .