Skip to Main content Skip to Navigation
Conference papers

Unified mathematical framework for a compact and fully parallel n-D skeletonization procedure

Abstract : We present in this paper a generic algorithm to compute the skeleton of an n-dimensional binary object. Considering the cartesian hypercubic grid, we provide a mathematical framework in which are given the explicit Boolean conditions under which the iterative thinning procedure removes a point. This algorithm preserves the topology in a sense which matches the properties usually used in 2D and 3D. Furthermore, it is based on an original kind of median hypersurface that gives to the skeleton good behavior with respect to both shape preservation and noise sensitivity. The algorithm is fully parallel, as no spatial subiterations are needed. The latter property, together with the symmetry of the boolean n-dimensional patterns leads to a perfectly isotropic skeleton. The logical expression of the algorithm is extremely concise, and in 2D, a large comparative study shows that the overall number of elementary Boolean operations needed to get the skeleton is smaller than for the other iterative algorithms reported in the literature.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01245457
Contributor : Antoine Manzanera Connect in order to contact the contributor
Submitted on : Thursday, December 17, 2015 - 11:43:59 AM
Last modification on : Wednesday, June 24, 2020 - 4:18:22 PM
Long-term archiving on: : Friday, March 18, 2016 - 12:31:26 PM

File

spie-denver99.pdf
Files produced by the author(s)

Identifiers

Citation

Antoine Manzanera, Thierry Bernard, Françoise Prêteux, Bernard Longuet. Unified mathematical framework for a compact and fully parallel n-D skeletonization procedure. Vision Geometry, Jul 1999, Denver, United States. ⟨10.1117/12.364113⟩. ⟨hal-01245457⟩

Share

Metrics

Record views

174

Files downloads

218