Pixel queue algorithm for geodesic distance transforms

  • Authors:
  • Leena Ikonen

  • Affiliations:
  • Department of Information Technology, Lappeenranta University of Technology, Lappeenranta, Finland

  • Venue:
  • DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Geodesic distance transforms are usually computed with sequential mask operations, which may have to be iterated several times to get a globally optimal distance map. This article presents an efficient propagation algorithm based on a best-first pixel queue for computing the Distance Transform on Curved Space (DTOCS), applicable also for other geodesic distance transforms. It eliminates repetitions of local distance calculations, and performs in near-linear time.