Fast computation of all pairs of geodesic distances - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Image Analysis & Stereology Année : 2011

Fast computation of all pairs of geodesic distances

(1) , (1) , (1)
1
Guillaume Noyel
Jesus Angulo
Dominique Jeulin

Résumé

Computing an array of all pairs of geodesic distances between the pixels of an image is time consuming. In the sequel, we introduce new methods exploiting the redundancy of geodesic propagations and compare them to an existing one. We show that our method in which the source point of geodesic propagations is chosen according to its minimum number of distances to the other points, improves the previous method up to 32 % and the naive method up to 50 % in terms of reduction of the number of operations.
Fichier principal
Vignette du fichier
NoyelAnguloJeulin_IAS_2011_HAL.pdf (1.62 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00658907 , version 1 (29-01-2016)
hal-00658907 , version 2 (30-07-2020)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Guillaume Noyel, Jesus Angulo, Dominique Jeulin. Fast computation of all pairs of geodesic distances. Image Analysis & Stereology, 2011, 30 (2), pp.101-109. ⟨10.5566/ias.v30.p101-109⟩. ⟨hal-00658907v2⟩
325 Consultations
388 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More