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

Authors:
Marcin Janaszewski;Michał Postolski;Laurent Babout
Affiliations:
Computer Engineering Department, Technical University of Łód, Stefanowskiego 18/22, 90-924 Łód, Poland;Computer Engineering Department, Technical University of Łód, Stefanowskiego 18/22, 90-924 Łód, Poland and Université Paris-Est, LIGM, Equipe A3SI, ESIEE, Cité DESCAR ...;Computer Engineering Department, Technical University of Łód, Stefanowskiego 18/22, 90-924 Łód, Poland
Venue:
Pattern Recognition Letters
Year:
2011

Citing 20
Cited 0

Marching cubes: A high resolution 3D surface construction algorithm

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Digital topology: introduction and survey

Computer Vision, Graphics, and Image Processing
Simple points, topological numbers and geodesic neighborhoods in cubic grids

Pattern Recognition Letters
A volumetric method for building complex models from range images

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
A three-dimensional holes closing algorithm

Pattern Recognition Letters
Fast Surface Reconstruction Using the Level Set Method

VLSM '01 Proceedings of the IEEE Workshop on Variational and Level Set Methods (VLSM'01)
Context-based surface completion

ACM SIGGRAPH 2004 Papers
SCAPE: shape completion and animation of people

ACM SIGGRAPH 2005 Papers
ReMESH: An Interactive Environment to Edit and Repair Triangle Meshes

SMI '06 Proceedings of the IEEE International Conference on Shape Modeling and Applications 2006
Filling holes in meshes using a mechanical model to simulate the curvature variation minimization

Computers and Graphics
A unified method for appearance and geometry completion of point set surfaces

The Visual Computer: International Journal of Computer Graphics
Discrete bisector function and Euclidean skeleton in 2D and 3D

Image and Vision Computing
Example-based 3D scan completion

SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Hole Filling of a 3D Model by Flipping Signs of a Signed Distance Field in Adaptive Resolution

IEEE Transactions on Pattern Analysis and Machine Intelligence
On Parallel Thinning Algorithms: Minimal Non-simple Sets, P-simple Points and Critical Kernels

Journal of Mathematical Imaging and Vision
Fixing geometric errors on polygonal models: a survey

Journal of Computer Science and Technology
Amodal volume completion: 3D visual completion

Computer Vision and Image Understanding
Geometric Approach to Hole Segmentation and Hole Closing in 3D Volumetric Objects

CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Improved space carving method for merging and interpolating multiple range images using information of light sources of active stereo

ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Hole filling in 3D volumetric objects

Pattern Recognition

Quantified Score

Hi-index	0.10

Visualization

Abstract

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.