Unified mathematical framework for a compact and fully parallel n-D skeletonization procedure - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

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

Résumé

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.
Fichier principal
Vignette du fichier
spie-denver99.pdf (842.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01245457 , version 1 (17-12-2015)

Identifiants

Citer

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⟩
78 Consultations
76 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More