论文信息 - Optimization and performance analysis of thinning algorithms on parallel computers

Optimization and performance analysis of thinning algorithms on parallel computers

This paper presents a concept for an implementation of different parallel thinning algorithms on parallel processors. The emphasis is put on a good parallelization using fine granularity and the simultaneous usage of vectorization. Results and experiences are discussed which have been obtained on the supercomputers CRAY X-MP/416 and CRAY Y-MP8/832 by realizing this concept, applied to one particular algorithm.

S. Heydorn | Peter Weidner

[1] Richard W. Hall,et al. Fast parallel thinning algorithms: parallel speed and connectivity preservation , 1989, CACM.

[2] Ronald H. Perrott,et al. An improved parallel thinning algorithm , 1987, CACM.

[3] Roland T. Chin,et al. A one-pass thinning algorithm and its parallel implementation , 1987, Comput. Vis. Graph. Image Process..

[4] T. Pavlidis. Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[5] Patrick Shen-Pei Wang,et al. A comment on “a fast parallel algorithm for thinning digital patterns” , 1986, CACM.

[6] Friedel Hossfeld,et al. Multitasking: experience with applications on a CRAY X-MP , 1989, Parallel Comput..

[7] Azriel Rosenfeld,et al. Some Parallel Thinning Algorithms for Digital Pictures , 1971, JACM.

[8] R.M. McElhaney,et al. Algorithms for graphics and image processing , 1983, Proceedings of the IEEE.

[9] Alan Stewart,et al. A parallel thinning algorithm with fine grain subtasking , 1989, Parallel Comput..

[10] Paul C. K. Kwok,et al. A thinning algorithm by contour generation , 1988, CACM.

[11] Zicheng Guo,et al. Parallel thinning with two-subiteration algorithms , 1989, Commun. ACM.