Fast and scalable algorithms for the euclidean distance transform on the LARPBS

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages 1393-1400

  Datta, A ^a   Soundaralakshmi, S ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY IMAGES; BINS; COMPUTER VISION; OPTICAL DATA PROCESSING; PARALLEL PROCESSING SYSTEMS; PIPELINE PROCESSING SYSTEMS; PIXELS; RECONFIGURABLE ARCHITECTURES;

BLACK AND WHITE PIXELS; COMPUTING DISTANCES; DETERMINISTIC ALGORITHMS; DETERMINISTIC SAMPLING; EUCLIDEAN DISTANCE TRANSFORMS; LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEMS; PROPOSED ARCHITECTURES; SCALABLE ALGORITHMS;

IMAGE PROCESSING;

EID: 0242706409     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.925121     Document Type: Conference Paper

References (16)

1. C. Arcelli and G. Sanniti di Baja, A width-independent fast thinning algorithm. IEEE Trans. Pattern Anal. Mach. Intell. C-7, 4, (1985), 463-474.
2. 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.
3. 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), pp. 25-29.
4. A. Datta and S. Soundaralakshmi, Constant-time algorithm for the Euclidean distance transform on reconfigurable meshes, Journal of Parallel and Distributed Computing, to appear.
5. A. Datta, R. Owens and S. Soundaralakshmi, Fast sorting on a linear array with a reconfigurable pipelined bus system, Proc. IPDPS Workshop on Optics and Computer Science, Cancun, Mexico, Lecture Notes in Computer Science, Springer-Verlag,Vol. 1800, (2000), 1110-1117.
6. A. Fujiwara, T. Masuzawa and H. Fujiwara, An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images. Inform. Process. Lett. 54, (1995), 295-300.
7. T. Hirata, A unified linear-time algorithm for computing distance maps, Information Processing Letters, 58, (1996), 129-133.
8. T. Hayashi, K. Nakano and S. Olariu, Optimal parallel algorithms for finding proximate points, with applications, IEEE Trans. Parallel and Distributed Systems, Vol. 9, 12, (1998), 1153-1166.
9. M. N. Kolountzakis and K. N. Kutulakos, Fast computation of the Euclidean distance maps for binary images. Inform. Process. Lett. 43, (1992), 181-184.
10. K. Li and V. Y. Pan, Parallel matrix multiplication on a linear array with a reconfigurable pipelined bus system, Proc. 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, IEEE Computer Society, pp. 31-35.
11. K. Li, Y. Pan and M. Hamdi, Solving graph theory problems using reconfigurable pipelined optical buses, Parallel Computing, 26 (2000), pp. 723-735.
12. K. Li, Y. Pan and S. Q. Zheng, Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system, IEEE Trans. Parallel and Distributed Systems, 9, (8), (1998), pp. 705-720.
13. K. Li, Y. Pan and S. Q. Zheng, Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems, Journal of Supercomputing, 15, (2000), pp. 163-181.
14. Y. Pan, Y. Li, J. Li, K. Li and S.-Q. Zheng, Computing distance maps efficiently using an optical bus, Proc. IPDPS 2000 Workshop on Parallel and Distributed Computing in Image Processing, Video Processing and Multimedia (PDIVM 2000), LNCS1800, pp. 178-185.
15. A. Rosenfeld and J. L. Pfalz, Distance function on digital pictures. Pattern Recognition. 1, (1968), 33-61.
16. Yamada, H. Complete Euclidean distance transformation by parallel operation. Proc. 7th International Conference on Pattern Recognition, 1984, pp. 69-71.