Pixel Queue Algorithm for Geodesic Distance Transforms
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.
KeywordsQueue Length Local Distance Geodesic Distance Priority Queue Sequential Algorithm
- 5.Ikonen, L., Toivanen, P.: Shortest routes between sets on gray-level surfaces. In: Patter recognition and Image Analysis (PRIA), St. Petersburg, Russia, October 2004, pp. 244–247 (2004)Google Scholar
- 14.Vincent, L.: New trends in morphological algorithms. In: Proc. SPIE/SPSE, vol. 1451, pp. 158–170 (1991)Google Scholar