Efficient computation of the Euclidean distance transform

Computer Vision and Image Understanding

Volumn 80, Issue 3, 2000, Pages 379-383

  Boxer, Laurence ^a,b   Miller, Russ ^b  

^a NIAGARA UNIVERSITY   (United States)

^b UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE PROCESSING; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL ALGORITHMS; RANDOM ACCESS STORAGE;

BINARY IMAGE; EUCLIDEAN DISTANCE TRANSFORM;

MATHEMATICAL TRANSFORMATIONS;

EID: 0034475486     PISSN: 10773142     EISSN: None     Source Type: Journal    
DOI: 10.1006/cviu.2000.0880     Document Type: Article

References (7)

1. Cuisenaire O., Macq B. Fast Euclidean distance transformation by propagation using multiple neighborhoods. Comput. Vision Image Understanding. 76:1999;163-172.
2. Lee Y.-H., Horng S.-J., Kao T.-W., Chen Y.-J. Parallel computation of the Euclidean distance transform on the mesh of trees and the hypercube computer. Comput. Vision Image Understanding. 68:1997;109-119.
3. Miller R., Boxer L. Algorithms Sequential and Parallel. 2000.
4. Miller R., Stout Q. F. Parallel Algorithms for Regular Architectures: Meshes and Pyramids. 1996.
5. Nadler S. B. Jr. Hyperspaces of Sets. 1978.
6. Rosenfeld A., Pfalz J. L. Distance function on digital pictures. Pattern Recog. 1:1968;33-61.
7. Shonkwiler R. An image algorithm for computing the Hausdorff distance efficiently in linear time. Inform. Process. Lett. 30:1989;87-89.