Look-Up Tables for Medial Axis on Squared Euclidean Distance Transform

Abstract : Medial Axis (MA), also known as Centres of Maximal Disks, is a useful representation of a shape for image description and analysis. MA can be computed on a distance transform, where each point is labelled to its distance to the background. Recent algorithms allow to compute Squared Euclidean Distance Transform (SEDT) in linear time in any dimension. While these algorithms provide exact measures, the only known method to characterize MA on SEDT, using local tests and Look-Up Tables, is limited to 2D and small distance values [5]. We have proposed in [14] an algorithm which computes the look-up table and the neighbourhood to be tested in the case of chamfer distances. In this paper, we adapt our algorithm for SEDT in arbitrary dimension and show that results have completely different properties.
Type de document :
Communication dans un congrès
Discrete Geometry for Computer Imagery, Nov 2003, Naples, Italy. Springer, Lecture Notes in Computer Science, 2886, pp.224-235, 2003, Discrete Geometry for Computer Imagery (DGCI) 2003. 〈10.1007/978-3-540-39966-7_21〉
Liste complète des métadonnées

https://hal-amu.archives-ouvertes.fr/hal-01502840
Contributeur : Eric Remy <>
Soumis le : jeudi 6 avril 2017 - 11:41:03
Dernière modification le : lundi 4 mars 2019 - 14:04:14

Lien texte intégral

Identifiants

Citation

Eric Remy, Edouard Thiel. Look-Up Tables for Medial Axis on Squared Euclidean Distance Transform. Discrete Geometry for Computer Imagery, Nov 2003, Naples, Italy. Springer, Lecture Notes in Computer Science, 2886, pp.224-235, 2003, Discrete Geometry for Computer Imagery (DGCI) 2003. 〈10.1007/978-3-540-39966-7_21〉. 〈hal-01502840〉

Partager

Métriques

Consultations de la notice

201