Skip to Main content Skip to Navigation
Journal articles

Fast computation of all pairs of geodesic distances

Abstract : 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.
Complete list of metadata

https://hal-mines-paristech.archives-ouvertes.fr/hal-00658907
Contributor : Guillaume Noyel <>
Submitted on : Thursday, July 30, 2020 - 6:44:57 PM
Last modification on : Thursday, September 24, 2020 - 4:38:04 PM

Files

NoyelAnguloJeulin_IAS_2011_HAL...
Files produced by the author(s)

Licence


Copyright

Identifiers

Citation

Guillaume Noyel, Jesus Angulo, Dominique Jeulin. Fast computation of all pairs of geodesic distances. Image Analysis and Stereology, International Society for Stereology, 2011, 30 (2), pp.101-109. ⟨10.5566/ias.v30.p101-109⟩. ⟨hal-00658907v2⟩

Share

Metrics

Record views

191

Files downloads

128