Parallel Computation of the Euclidean Distance Transform on the Mesh of Trees and the Hypercube Computer

Computer Vision and Image Understanding

Volumn 68, Issue 1, 1997, Pages 109-119

  Lee, Yu Hua ^a   Horng, Shi Jinn ^a   Kao, Tzong Wann ^b   Chen, Yuung Jih ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER VISION; DATA STRUCTURES; MATHEMATICAL TRANSFORMATIONS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; THREE DIMENSIONAL;

BINARY IMAGE; EUCLIDEAN DISTANCE TRANSFORM; HYPERCUBE COMPUTER; IMAGE CONVERSION;

IMAGE UNDERSTANDING;

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

References (28)

1. C. Arcelli and G. Sanniti di Baja, A width-independent fast thinning algorithm, IEEE Trans. Pattern Anal. Mach. Intell. C-7, No. 4, 1985, 463-474.
2. C. Arcelli and G. Sanniti di Baja, Computing Voronoi diagrams in digital pictures, Pattern Recognit. Lett. 4, 1986, 383-389.
3. H. Blum, A transformation for extracting new descriptors of shape, in Models for the Perception of Speech and Visual Form (W. Wathen-Dunn, Ed.), pp. 362-380, MIT Press, Cambridge, MA 1967.
4. G. Borgefors, Distance transformations in arbitrary dimensions, Comput. Vision Graphics Image Process. 27, 1984, 321-345.
5. G. Borgefors, Distance transformations in digital images, Comput. Vision Graphics Image Process. 34, 1986, 344-371.
6. G. Borgefors, Hierarchical chamfer matching: A parametric edge matching algorithm, IEEE Trans. Pattern Anal. Mach. Intell. C-10, No. 6, 1988, 849-865.
7. L. Chen and H. Y. H. Chuang, A fast algorithm for Euclidean distance maps of a 2-D binary image, Inform. Process. Lett. 51, 1994, 25-29.
8. L. Chen and H. Y. H. Chuang, An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD, Parallel Comput. 21, 1995, 841-852.
9. P. E. Danielsson, A new shape factor, Comput. Graphics Image Process. 7, 1978, 292-299.
10. P. E. Danielsson, Euclidean distance mapping, Comput. Graphics Image Process. 14, 1980, 227-248.
11. P. P. Das and B. N. Chatterji, A note on distance transformations in arbitrary dimensions, Comput. Vision Graphics Image Process. 43, 1988, 368-385.
12. M. A. Fishier and P. Barrett, An iconic transform for sketch completion and shape abstraction, Comput. Vision Graphics Image Process. 13, 1980, 334-360.
13. A. Fujiwara, T. Masuzawa, and H. Fujiwara, An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images, 54, 1995, pp. 295-300.
14. T. Hirata and T. Kato, An algorithm for Euclidean distance transformation, Tech. Rept. AL41-4, IPSJ, 1994. [Japanese].
15. M. N. Kolountzakis and K. N. Kutulakos, Fast computation of the Euclidean distance maps for binary images, Inform. Process. Lett. 43, 1992, 181-184.
16. F. Thomson Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
17. T. Matsuyama and T. Y. Phillips, Digital realization of the labeled Voronoi diagram and its application to closed boundary detection, in Proc. 7th International Conference on Pattern Recognition, 1984, pp. 478-480.
18. U. Montanari, A method for obtaining skeletons using a quasi-Euclidean distance, J. Assoc. Comput. Mach. 15, 1968, 600-624.
19. D. Nath, S. N. Maheshwari, and P. C. P. Bhatt, Efficient VLSI networks for parallel processing based on orthogonal trees, IEEE Trans. Comput. C-32, No. 6, 1983, 569-581.
20. D. Nassimi and S. Sahni, Data broadcasting in SIMD computers IEEE Trans. Comput. C-30, No. 2, 1981, 101-107.
21. D. W. Paglieroni, Distance transforms: Properties and machine vision applications, Graph. Models Image Process. 54, No. 1, 1992, 56-74.
22. D. W. Paglieroni, A unified distance transform algorithm and architecture, Mach. Vision Appl. 5, 1992, 47-55.
23. A. Rosenfeld and J. L. Pfalz, Sequential operations in digital picture processing, J. Assoc. Comput. Mach. 13(4), 1966, 471-494.
24. A. Rosenfeld and J. L. Pfalz. Distance function on digital pictures, Pattern Recognit. 1, 1968, 33-61.
25. Q. Schwarzkopf, Parallel computation of discrete Voronoi diagrams, in Proc. Sixth Annual Symposium on Theoretical Aspects of Computer Science, 1989.
26. Q. Schwarzkopf, Parallel computation of disease trannsforms, Algorithmica 6, 1991, 685-697.
27. H. Yamada, Complete Euclidean distance transformation by parallel operation, in Proc. 7th International Conference on Pattern Recognition, 1984, Vol. 1, pp. 69-71.
28. O. Z. Ye. The signed Euclidean distance transform and its applications, in Proc., 9th International Conference on Pattern Recognition, 1988, pp. 495-499.