Logo: to the web site of Uppsala University

uu.sePublications from Uppsala University
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
Exact linear time Euclidean distance transforms of grid line sampled shapes
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computerized Image Analysis and Human-Computer Interaction. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Visual Information and Interaction.ORCID iD: 0000-0001-7312-8222
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Visual Information and Interaction. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computerized Image Analysis and Human-Computer Interaction.ORCID iD: 0000-0002-6041-6310
2015 (English)In: Mathematical Morphology and its Applications to Signal and Image Processing, Springer, 2015, p. 645-656Conference paper, Published paper (Refereed)
Abstract [en]

We propose a method for computing, in linear time, the exact Euclidean distance transform of sets of points s. t. one coordinate of a point can be assigned any real value, whereas other coordinates are restricted to discrete sets of values. The proposed distance transform is applicable to objects represented by grid line sampling, and readily provides sub-pixel precise distance values. The algorithm is easy to implement; we present complete pseudo code. The method is easy to parallelize and extend to higher dimensional data. We present two ways of obtaining approximate grid line sampled representations, and evaluate the proposed EDT on synthetic examples. The method is competitive w. r. t. state-of-the-art methods for sub-pixel precise distance evaluation.

Place, publisher, year, edition, pages
Springer, 2015. p. 645-656
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 9082
National Category
Discrete Mathematics
Research subject
Computerized Image Processing
Identifiers
URN: urn:nbn:se:uu:diva-266291DOI: 10.1007/978-3-319-18720-4_54ISI: 000362366800054ISBN: 978-3-319-18719-8 (print)OAI: oai:DiVA.org:uu-266291DiVA, id: diva2:867694
Conference
ISMM 2015, May 27–29, Reykjavik, Iceland
Available from: 2015-11-06 Created: 2015-11-06 Last updated: 2018-12-02

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Lindblad, JoakimSladoje, Natasa

Search in DiVA

By author/editor
Lindblad, JoakimSladoje, Natasa
By organisation
Computerized Image Analysis and Human-Computer InteractionDivision of Visual Information and Interaction
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 692 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