One-step compact skeletonization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

One-step compact skeletonization

Résumé

Computing a skeleton for a discretized boundary typically produces a noisy output, with a skeletal branch produced for each boundary pixel. A simplification step often follows to reduce these noisy branches. As a result, generating a clean skeleton is usually a 2-step process. In this article, we propose a skeletonization process that produces a clean skeleton in the first step, avoiding the creation of branches due to noise. The resulting skeleton compares favorably with the most common pruning methods on a large database of shapes. Our process also reduces execution time and requires only one parameter, ε, that designates the desired boundary precision in the Hausdorff distance.
Fichier principal
Vignette du fichier
EGShort_final.pdf (270.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02130468 , version 1 (23-05-2020)

Identifiants

Citer

Bastien Durix, Géraldine Morin, Sylvie Chambon, Jean-Luc Mari, Kathryn Leonard. One-step compact skeletonization. 40th Annual Conference of the European Association for Computer Graphics - Eurographics 2019, May 2019, Genoa, Italy. pp.1-5, ⟨10.2312/egs.20191005⟩. ⟨hal-02130468⟩
151 Consultations
133 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More