Fast parallel algorithm for distance transform

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 33, Issue 4, 2003, Pages 429-434

  Datta, Amitava ^a   Soundaralakshmi, Subbiah ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Binary image; CRCW PRAM; Deterministic sampling; Distance transform; Parallel algorithm; Pattern recognition; Scalable algorithm

Indexed keywords

COMPUTATIONAL COMPLEXITY; IMAGE ANALYSIS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; PARALLEL PROCESSING SYSTEMS; PATTERN RECOGNITION; RANDOM ACCESS STORAGE;

BINARY IMAGE; DISTANCE TRANSFORM; PARALLEL RANDOM ACCESS MACHINE; SCALABLE ALGORITHM;

PARALLEL ALGORITHMS;

EID: 0242355151     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2003.809173     Document Type: Article

References (13)

1. C. Arcelli and G. Sanniti di Baja, "A width-independent fast thinning algorithm," IEEE Trans. Pattern Anal. Mach. Intell., C-7, pp. 463-474, Apr 1985.
2. O. Berkman, B. Schieber, and U. Vishkin, "Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values," J. Algorithms, vol. 14, pp. 344-370, 1993.
3. L. Chen and H. Y. H. Chuang, "An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD," Parallel Comput., vol. 21, pp. 841-852, 1995.
4. A. Datta and S. Soundaralakshmi, "Constant-time algorithm for the Euclidean distance transform on reconfigurable meshes," J. Parallel Distributed Comput., vol. 61, pp. 1439-1455, 2001.
5. A. Fujiwara, T. Masuzawa, and H. Fujiwara, "An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images," Inform. Process. Lett., vol. 54, pp. 295-300, 1995.
6. T. Hirata, "A unified linear-time algorithm for computing distance maps," Inform. Process. Lett., vol. 58, pp. 129-133, 1996.
7. T. Hayashi, K. Nakano, and S. Olariu, "Optimal parallel algorithms for finding proximate points, with applications," IEEE Trans. Parallel Dist. Syst., pp. 1153-1166, Dec. 1998.
8. J. Jaja, Introduction to Parallel Algorithms, Cambridge, MA: Addision-Wesley, 1992.
9. M. N. Kolountzakis and K. N. Kutulakos, "Fast computation of the Euclidean distance maps for binary images," Inform. Process. Lett., vol. 43, pp. 181-184, 1992.
10. Y. H. Lee, S. J. Horng, T. W. Kao, and Y. J. Chen, "Parallel computation of the Euclidean distance transform on the mesh of trees and the hypercube computer," Comput. Vis. Image Understand., vol. 68, no. 1 pp. 109-119, 1997.
11. D. W. Paglieroni, "Distance transforms: properties and machine vision applications," CVGIP: Graph, Models Image Process., vol. 54, pp. 56-74, 1992.
12. A. Rosenfeld and J. L. Pfalz, "Distance function on digital pictures," Pattern Recognit., vol. 1, pp. 33-61, 1968.
13. O. Schwarzkopf, "Parallel computation of distance transforms," Algorithmica, vol. 6, pp. 685-697, 1991.