Hole filling in 3D volumetric objects

摘要

The construction of hole filling (or hole segmentation) method for 3D volumetric images is a new challenging issue in computer science. It needs a geometrical approach since from a topological point of view 3D holes (tunnels) are not well-delimited subsets of three dimensional space. In this paper, the authors propose an original, efficient, flexible algorithm of hole filling for volumetric objects. The algorithm has been tested on artificial objects and very complicated crack propagation tomography images. The qualitative results, quantitative results and features of proposed approach are presented in the paper. According to our knowledge it is the first algorithm of hole filling for volumetric objects.