Path-Based Distance with Varying Weights and Neighborhood Sequences - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Path-Based Distance with Varying Weights and Neighborhood Sequences

Résumé

This paper presents a path-based distance where local displacement costs vary both according to the displacement vector and with the travelled distance. The corresponding distance transform algorithm is similar in its form to classical propagation-based algorithms, but the more variable distance increments are either stored in look-up-tables or computed on-the-fly. These distances and distance transform extend neighborhood-sequence distances, chamfer distances and generalized distances based on Minkowski sums. We introduce algorithms to compute, in Z2, a translated version of a neighborhood sequence distance map with a limited number of neighbors, both for periodic and aperiodic sequences. A method to recover the centered distance map from the translated one is also introduced. Overall, the distance transform can be computed with minimal delay, without the need to wait for the whole input image before beginning to provide the result image.
Fichier principal
Vignette du fichier
10.1007_978-3-642-19867-0_17.pdf (751.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00581815 , version 1 (31-03-2011)

Identifiants

Citer

Nicolas Normand, Robin Strand, Pierre Evenou, Aurore Arlicot. Path-Based Distance with Varying Weights and Neighborhood Sequences. 16th IAPR International Conference, DGCI 2011, Apr 2011, Nancy, France. pp.199-210, ⟨10.1007/978-3-642-19867-0_17⟩. ⟨hal-00581815⟩
314 Consultations
70 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More