GPU-based real-time discrete euclidean distance transforms with precise error bounds

Jens Schneider, Martin Kraus, Rüdiger Westermann

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

35 Scopus citations

Abstract

We present a discrete distance transform in style of the vector propagation algorithm by Danielsson. Like other vector propagation algorithms, the proposed method is close to exact, i.e., the error can be strictly bounded from above and is significantly smaller than one pixel. Our contribution is that the algorithm runs entirely on consumer class graphics hardware, thereby achieving a throughput of up to 96 Mpixels/s. This allows the proposed method to be used in a wide range of applications that rely both on high speed and high quality.

Original languageEnglish
Title of host publicationVISAPP 2009 - Proceedings of the 4th International Conference on Computer Vision Theory and Applications
Pages435-442
Number of pages8
StatePublished - 2009
Event4th International Conference on Computer Vision Theory and Applications, VISAPP 2009 - Lisboa, Portugal
Duration: 5 Feb 20098 Feb 2009

Publication series

NameVISAPP 2009 - Proceedings of the 4th International Conference on Computer Vision Theory and Applications
Volume1

Conference

Conference4th International Conference on Computer Vision Theory and Applications, VISAPP 2009
Country/TerritoryPortugal
CityLisboa
Period5/02/098/02/09

Keywords

  • Discrete euclidean distance transform
  • Graphics processing unit
  • SIMD-parallelism

Fingerprint

Dive into the research topics of 'GPU-based real-time discrete euclidean distance transforms with precise error bounds'. Together they form a unique fingerprint.

Cite this