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
The Boolean Map Distance: Theory and Efficient Computation
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.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computerized Image Analysis and Human-Computer Interaction.
Adobe Research, San Jose, USA.
Department of Computer Science, Boston University, Boston, USA.
2017 (English)In: International Conference on Discrete Geometry for Computer Imagery / [ed] Walter G. Kropatsch, Nicole M. Artner, Ines Janusch, Springer, 2017, p. 335-346Conference paper, Published paper (Refereed)
Abstract [en]

We propose a novel distance function, the boolean map distance (BMD), that defines the distance between two elements in an image based on the probability that they belong to different components after thresholding the image by a randomly selected threshold value. This concept has been explored in a number of recent publications, and has been proposed as an approximation of another distance function, the minimum barrier distance (MBD). The purpose of this paper is to introduce the BMD as a useful distance function in its own right. As such it shares many of the favorable properties of the MBD, while offering some additional advantages such as more efficient distance transform computation and straightforward extension to multi-channel images.

Place, publisher, year, edition, pages
Springer, 2017. p. 335-346
Series
Lecture notes in computer science, ISSN 0302-9743, E-ISSN 1611-3349 ; 10502
National Category
Computer Vision and Robotics (Autonomous Systems) Computer Sciences
Research subject
Computerized Image Processing
Identifiers
URN: urn:nbn:se:uu:diva-333809DOI: 10.1007/978-3-319-66272-5_27ISI: 000449843100027ISBN: 978-3-319-66271-8 (print)ISBN: 978-3-319-66272-5 (electronic)OAI: oai:DiVA.org:uu-333809DiVA, id: diva2:1157967
Conference
20th IAPR International Conference on Discrete Geometry for Computer Imagery (DGCI), Vienna, Austria, September 19-21, 2017
Available from: 2017-11-17 Created: 2017-11-17 Last updated: 2022-01-29Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Malmberg, FilipStrand, Robin
By organisation
Computerized Image Analysis and Human-Computer InteractionDivision of Visual Information and Interaction
Computer Vision and Robotics (Autonomous Systems)Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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