uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Path-Based Distance with Varying Weights andNeighborhood Sequences
IRCCyN UMR CNRS 6597, University of Nantes, France and School of Physics, Monash University, Melbourne, Australia .
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Centre for Image Analysis. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computerized Image Analysis and Human-Computer Interaction.
IRCCyN UMR CNRS 6597, University of Nantes, France .
IRCCyN UMR CNRS 6597, University of Nantes, France .
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, Published paper (Refereed)
Abstract [en]

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.
Series
Lecture Notes in Computer Science, 6607
National Category
Other Mathematics Computer Science
Research subject
Computerized Image Analysis; Computerized Image Processing
Identifiers
URN: urn:nbn:se:uu:diva-162219DOI: 10.1007/978-3-642-19867-0_17ISBN: 978-3-642-19866-3 (print)OAI: oai:DiVA.org:uu-162219DiVA: diva2:459694
Conference
International Conference on Discrete Geometry for Computer Imagery (DGCI 2011), Nancy, France, 2011
Available from: 2011-11-28 Created: 2011-11-28

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://dx.doi.org/10.1007/978-3-642-19867-0_17

Authority records BETA

Strand, Robin

Search in DiVA

By author/editor
Strand, Robin
By organisation
Centre for Image AnalysisComputerized Image Analysis and Human-Computer Interaction
Other MathematicsComputer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 397 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf