Distance transformations in digital images
Computer Vision, Graphics, and Image Processing
Computing distance transformations in convex and non-convex domains
Pattern Recognition
An Efficient Uniform Cost Algorithm Applied to Distance Transforms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Neighborhoods for distance transformations using ordered propagation
CVGIP: Image Understanding
Generalized geodesy via geodesic time
Pattern Recognition Letters
New geodesic distance transforms for gray-scale images
Pattern Recognition Letters
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Digital Picture Processing
Morphological Image Analysis: Principles and Applications
Morphological Image Analysis: Principles and Applications
Shortest routes on varying height surfaces using gray-level distance transforms
Image and Vision Computing
Distance and nearest neighbor transforms of gray-level surfaces using priority pixel queue algorithm
ACIVS'05 Proceedings of the 7th international conference on Advanced Concepts for Intelligent Vision Systems
Pixel queue algorithm for geodesic distance transforms
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Morphological iterative closest point algorithm
IEEE Transactions on Image Processing
Revisiting priority queues for image analysis
Pattern Recognition
Morphological Amoebas Are Self-snakes
Journal of Mathematical Imaging and Vision
SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
On the Geometry of Multivariate Generalized Gaussian Models
Journal of Mathematical Imaging and Vision
Hi-index | 0.00 |
The sequential mask operations for calculating distance transforms may have to be iterated several times in the case of geodesic distances. This article presents an efficient propagation algorithm for the Distance Transform on Curved Space (DTOCS). It is based on a best-first pixel queue, and is applicable also for other gray-level distance transforms. It eliminates repetition of local distance calculations, and performs in near-linear time. A nearest neighbor transform based on distances along the surface, and a propagation direction image for tracing the shortest paths, can be produced simultaneously with the distance map.