Distance transformations in digital images
Computer Vision, Graphics, and Image Processing
Neighborhoods for distance transformations using ordered propagation
CVGIP: Image Understanding
A unified linear-time algorithm for computing distance maps
Information Processing Letters
A List-Processing Approach to Compute Voronoi Diagrams and the Euclidean Distance Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Linear Time Euclidean Distance Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast parallel chessboard distance transform algorithms
ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
In-place linear-time algorithms for Euclidean distance transform
Transactions on computational science VIII
In-place linear-time algorithms for Euclidean distance transform
Transactions on computational science VIII
| Hi-index | 0.00 |
Given an n×n binary image of white and black pixels, we present an optimal parallel algorithm for computing the distance transform and the nearest feature transform using the Euclidean metric. The algorithm employs the systolic computation to achieve O(n) running time on a linear array of n processors.