A 3D 6-subiteration curve thinning algorithm based on P-simple points

Authors:
Christophe Lohou;Gilles Bertrand
Affiliations:
Laboratoire de Logique, Algorithmique, Informatique de Clermont I(LLAIC), Département d'Informatique, Institut Universitaire de Technologie, Ensemble Universitaire des Cézeaux, B.P. 86, ...;Laboratoire d'Algorithmique et Architecture des Systèmes Informatiques (A2SI), ícole Supérieure d'Ingénieurs en ílectrotechnique et ílectronique (ESIEE), 2, bd Blaise ...
Venue:
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Year:
2005

Citing 23
Cited 7

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
A topological characterization of thinning

Theoretical Computer Science
Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images

Discrete Applied Mathematics
Digital topology: introduction and survey

Computer Vision, Graphics, and Image Processing
Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
3D medial surfaces and 3D skeletons

IAPR Proceedings of the international workshop on Visual form: analysis and recognition
A new characterization of three-dimensional simple points

Pattern Recognition Letters
On topology preservation in 3D thinning

CVGIP: Image Understanding
Detection of 3-D Simple Points for Topology Preserving Transformations with Application to Thinning

IEEE Transactions on Pattern Analysis and Machine Intelligence
Simple points, topological numbers and geodesic neighborhoods in cubic grids

Pattern Recognition Letters
A 3D fully parallel thinning algorithm for generating medial faces

Pattern Recognition Letters
A fully parallel 3D thinning algorithm and its applications

Computer Vision and Image Understanding
A 3D 6-subiteration thinning algorithm for extracting medial lines

Pattern Recognition Letters
Fast binary image processing using binary decision diagrams

Computer Vision and Image Understanding
A parallel 3D 12-subiteration thinning algorithm

Graphical Models and Image Processing
Some Topological Properties of Surfaces in Z3

Journal of Mathematical Imaging and Vision
Digital Picture Processing

Digital Picture Processing
Three-Dimensional Topology Preserving Reduction on the 4-Subfields

IEEE Transactions on Pattern Analysis and Machine Intelligence
Topology-Preserving Deletion of 1's from 2-, 3- and 4-Dimensional Binary Images

DGCI '97 Proceedings of the 7th International Workshop on Discrete Geometry for Computer Imagery
A New 3D 6-Subiteration Thinning Algorithm Based on P-Simple Points

DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Strong thinning and polyhedric approximation of the surface of a voxel object

Discrete Applied Mathematics
A 3D 12-subiteration thinning algorithm based on P-simple points

Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Image Analysis and Mathematical Morphology

Image Analysis and Mathematical Morphology

Generation of Unit-Width Curve Skeletons Based on Valence Driven Spatial Median (VDSM)

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Detection of the non-topology preservation of Ma and Sonka's algorithm, by the use of P-simple points

Computer Vision and Image Understanding
A subiteration-based surface-thinning algorithm with a period of three

Proceedings of the 29th DAGM conference on Pattern recognition
New characterizations of simple points, minimal non-simple sets and P-simple points in 2D, 3D and 4D discrete spaces

DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Isthmus-based 6-directional parallel thinning algorithms

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
A new 3d parallel thinning scheme based on critical kernels

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
A new relative chain code in 3D

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a recent study C. Lohou, G. Bertrand [A new 3D 12-subiteration thinning algorithm based on P-simple points, in: International Workshop on Combinatorial Image Analysis, IWCIA 2001, Philadelphia, PA, USA, ENTCS, vol. 46, 2001, pp. 39-58; A new 3D 6-subiteration thinning algorithm based on P-simple points, in: International Conference on Discrete Geometry for Computer Imagery, DGCI'2002, Bordeaux, France, ENTCS, vol. 2301, Springer, Berlin, 2002, pp. 102-113; A 3D 12-subiteration thinning algorithm based on P-simple points, Discrete Appl. Math. 139(1-3) (2004) 171-195.], we proposed a new methodology to build thinning algorithms based on the deletion of P-simple points. This methodology may permit to conceive a thinning algorithm A^' from an existent thinning algorithm A, such that A^' deletes at least all the points removed by A, while preserving the same end points (in particular, we have already proposed a 12-subiteration thinning algorithm C. Lohou, G. Bertrand [International Workshop on Combinatorial Image Analysis, IWCIA 2001, Philadelphia, PA, USA, ENTCS, vol. 46, 2001, pp. 39-58; A 3D 12-subiteration thinning algorithm based on P-simple points, Discrete Appl. Math. 139(1-3) (2004) 171-195.]). In this paper, by applying this methodology, we propose a 6-subiteration curve thinning algorithm which deletes at least all the points removed by two 6-subiteration curve thinning algorithms: either the one proposed by Palagyi and Kuba [A 3D 6-subiteration thinning algorithm for extracting medial lines, Pattern Recogn. Lett. 19(7) (1998) 613-627.], or the one proposed by Gong and Bertrand [A simple parallel 3D thinning algorithm, in: International Conference on Pattern Recognition, Atlantic City, NJ, USA, 1990, pp. 188-190.]. .