Path-Based Distance with Varying Weights andNeighborhood Sequences
2011 (English)In: Proceedings, International Conference on Discrete Geometry for Computer Imagery (DGCI 2011): / [ed] Debled-Rennesson, Isabelle and Domenjoud, Eric and Kerautret, Bertrand and Even, Philippe, Berlin Heidelberg: Springer , 2011, 199-210 p.Conference paper (Refereed)
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 , 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.
Place, publisher, year, edition, pages
Berlin Heidelberg: Springer , 2011. 199-210 p.
, Lecture Notes in Computer Science, 6607
Other Mathematics Computer Science
Research subject Computerized Image Analysis; Computerized Image Processing
IdentifiersURN: urn:nbn:se:uu:diva-162219DOI: 10.1007/978-3-642-19867-0_17ISBN: 978-3-642-19866-3OAI: oai:DiVA.org:uu-162219DiVA: diva2:459694
International Conference on Discrete Geometry for Computer Imagery (DGCI 2011), Nancy, France, 2011