Robust algorithm for tunnel closing in 3D volumetric objects based on topological characteristics of points

Highlights? We propose a robust, linear in time modification of Aktouf et al. algorithm for tunnel closing in 3D volumetric objects. ? The studied algorithm is also a modification of tunnel closing algorithm (ITC) presented in the authors previous work. ? Proposed robust tunnel closing algorithm RTC outperforms ITC and the original Aktouf et al. proposition. ? RTC generates a tunnel closing patch which is insensitive to all kind of branches situated in the vicinity of the tunnel. In this letter, we propose a robust, linear in time modification of Aktouf, Bertrand and Perroton's algorithm for tunnel (3D hole) closing in 3D volumetric objects. Our algorithm is insensitive to small distortions and branches. The algorithm has been tested on various 3D images including very complicated 3D crack propagation images. The results of the tests, discussion of the algorithm properties and future research plans are also included in the paper.

[1]  Milan Sonka,et al.  Segmentation of intrathoracic airway trees: a fuzzy logic approach , 1998, IEEE Transactions on Medical Imaging.

[2]  Tao Ju,et al.  Fixing Geometric Errors on Polygonal Models: A Survey , 2009, Journal of Computer Science and Technology.

[3]  S. Osher,et al.  Fast surface reconstruction using the level set method , 2001, Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision.

[4]  Michel Couprie,et al.  Geometric Approach to Hole Segmentation and Hole Closing in 3D Volumetric Objects , 2009, CIARP.

[5]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[6]  Chunxia Xiao,et al.  A unified method for appearance and geometry completion of point set surfaces , 2007, The Visual Computer.

[7]  Steve Marschner,et al.  Filling holes in complex surfaces using volumetric diffusion , 2002, Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission.

[8]  Robert B. Fisher,et al.  Amodal volume completion: 3D visual completion , 2005, Comput. Vis. Image Underst..

[9]  Katsushi Ikeuchi,et al.  Hole Filling of a 3D Model by Flipping Signs of a Signed Distance Field in Adaptive Resolution , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Michel Couprie,et al.  Discrete bisector function and Euclidean skeleton in 2D and 3D , 2007, Image Vis. Comput..

[11]  D. Cohen-Or,et al.  Context-based surface completion , 2004, SIGGRAPH 2004.

[12]  Günther Greiner,et al.  Repairing Non-Manifold Triangle Meshes using Simulated Annealing , 2003, Int. J. Shape Model..

[13]  Marco Attene,et al.  ReMESH: An Interactive Environment to Edit and Repair Triangle Meshes , 2006, IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06).

[14]  Philip J. Withers,et al.  In situ three-dimensional X-ray microtomography of an auxetic foam under tension , 2009 .

[15]  Gilles Bertrand,et al.  A three-dimensional holes closing algorithm , 1996, Pattern Recognit. Lett..

[16]  Andrew King,et al.  X-ray diffraction contrast tomography: a novel technique for three-dimensional grain mapping of polycrystals. II. The combined case , 2008 .

[17]  W. Ludwig,et al.  Observations of Intergranular Stress Corrosion Cracking in a Grain-Mapped Polycrystal , 2008, Science.

[18]  Marc Levoy,et al.  A volumetric method for building complex models from range images , 1996, SIGGRAPH.

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

[20]  Sebastian Thrun,et al.  SCAPE: shape completion and animation of people , 2005, SIGGRAPH 2005.

[21]  Michel Couprie,et al.  Hole filling in 3D volumetric objects , 2010, Pattern Recognit..

[22]  Yue-Ting Zhuang,et al.  Filling Holes in Complex Surfaces using Oriented Voxel Diffusion , 2006, 2006 International Conference on Machine Learning and Cybernetics.

[23]  Ryo Furukawa,et al.  Improved Space Carving Method for Merging and Interpolating Multiple Range Images Using Information of Light Sources of Active Stereo , 2007, ACCV.

[24]  Jean-Philippe Pernot,et al.  Filling holes in meshes using a mechanical model to simulate the curvature variation minimization , 2006, Comput. Graph..

[25]  Gilles Bertrand,et al.  Simple points, topological numbers and geodesic neighborhoods in cubic grids , 1994, Pattern Recognit. Lett..

[26]  Jean-Marc Chassery,et al.  Géométrie discrète et images numériques , 2007 .

[27]  T. Yung Kong,et al.  A digital fundamental group , 1989, Comput. Graph..

[28]  Gilles Bertrand,et al.  On Parallel Thinning Algorithms: Minimal Non-simple Sets, P-simple Points and Critical Kernels , 2009, Journal of Mathematical Imaging and Vision.

[29]  Philip J. Withers,et al.  X-ray microtomographic observation of intergranular stress corrosion cracking in sensitised austenitic stainless steel , 2006 .

[30]  Philip J. Withers,et al.  Three dimensional observations and modelling of intergranular stress corrosion cracking in austenitic stainless steel , 2005 .

[31]  Leonidas J. Guibas,et al.  Example-Based 3D Scan Completion , 2005 .

[32]  P. M. Scott.  2000 F.N. Speller Award Lecture: Stress Corrosion Cracking in Pressurized Water Reactors Interpretation, Modeling, and Remedies , 2000 .

[33]  Yongtae Jun,et al.  A piecewise hole filling algorithm in reverse engineering , 2005, Comput. Aided Des..