Fast and scalable algorithms for the Euclidean distance transform on a linear array with a reconfigurable pipelined bus system

Journal of Parallel and Distributed Computing

Volumn 64, Issue 3, 2004, Pages 360-369

  Datta, Amitava ^a   Soundaralakshmi, Subbiah ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Deterministic sampling; Euclidean distance transform; Image processing; Optoelectronic computing; Pipelined bus; Reconfigurable bus

Indexed keywords

ALGORITHMS; COMPUTER VISION; IMAGE PROCESSING; MATHEMATICAL MODELS; MICROPROCESSOR CHIPS; PROBLEM SOLVING; RANDOM ACCESS STORAGE; REAL TIME SYSTEMS; SAMPLING;

EUCLIDEAN DISTANCE TRANSFORMS; OPTOELECTRONIC COMPUTING; RECONFIGURABLE BUS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 2942611422     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.01.002     Document Type: Article

References (17)

1. Arcelli C., Sanniti di Baja G. A width-independent fast thinning algorithm. IEEE Trans. Pattern Anal. Mach. Intell. C-7(4):1985;463-474.
2. Chen L., Chuang H.Y.H. An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD. Parallel Comput. 21:1995;841-852.
3. Chiarulli D., Melhem R., Levitan S. Using coincident optical pulses for parallel memory addressing. IEEE Trans. Comput. 20(12):1987;48-58.
4. Datta A., Soundaralakshmi S., Owens R. Fast sorting algorithms on a linear array with a reconfigurable pipelined bus system. IEEE Trans. Parallel Distributed Syst. 13(3):2002;212-222.
5. Datta A., Soundaralakshmi S. Constant-time algorithm for the Euclidean distance transform on reconfigurable meshes. J. Parallel Distrib. Comput. 61:2001;1439-1455.
6. Fujiwara A., Masuzawa T., Fujiwara H. An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images. Inform. Process. Lett. 54:1995;295-300.
7. Hayashi T., Nakano K., Olariu S. Optimal parallel algorithms for finding proximate points, with applications. IEEE Trans. Parallel and Distrib. Syst. 9(12):1998;1153-1166.
8. Hirata T. A unified linear-time algorithm for computing distance maps. Inform. Process. Lett. 58:1996;129-133.
9. Kolountzakis M.N., Kutulakos K.N. Fast computation of the Euclidean distance maps for binary images. Inform. Process. Lett. 43:1992;181-184.
10. K. Li, V.Y. Pan, Parallel matrix multiplication on a linear array with a reconfigurable pipelined bus system, Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, IEEE Computer Society, Silverspring, MD, pp. 31-35.
11. Li K., Pan Y., Hamdi M. Solving graph theory problems using reconfigurable pipelined optical buses. Parallel Comput. 26:2000;723-735.
12. Li K., Pan Y., Zheng S.Q. Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system. IEEE Trans. Parallel Distrib. Syst. 9(8):1998;705-720.
13. Li K., Pan Y., Zheng S.Q. Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems. J. Supercomput. 15:2000;163-181.
14. Pan Y., Li K. Constant-time algorithm for computing the Euclidean distance maps of binary images on 2D meshes with reconfigurable buses. Inform. Sci. 120:1999;209-221.
15. Y. Pan, Y. Li, J. Li, K. Li, S.-Q. Zheng, Computing distance maps efficiently using an optical bus, Proceedings of IPDPS 2000 Workshop on Parallel and Distributed Computing in Image Processing, Video Processing and Multimedia (PDIVM 2000), Lecture Notes in Computer Science, Vol. 1800, Springer, Berlin, pp. 178-185.
16. Rosenfeld A., Pfalz J.L. Distance function on digital pictures. Pattern Recognition. 1:1968;33-61.
17. H. Yamada, Complete Euclidean distance transformation by parallel operation, Proceedings of Seventh International Conference on Pattern Recognition, IEEE Computer Society Press, Los Alamitos, CA, 1984, pp. 69-71.