论文信息 - A flexible thinning algorithm allowing parallel, sequential, and distributed application

A flexible thinning algorithm allowing parallel, sequential, and distributed application

A parallel thinning algorithm for digital patterns is presented. This algorithm can also be used for sequential thinning without the simulation of parallel computation. The mathematical background of the algorithm bases on the notion of the Euler characteristic. The proposed algorithm is simple and particularly faster than other parallel algorithms.

Jan Olszewski | J. Olszewski

[1] Ching Y. Suen,et al. A fast parallel algorithm for thinning digital patterns , 1984, CACM.

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

[3] S. Goldberg,et al. Curvature and Homology , 1962 .

[4] NABIL JEAN NACCACHE,et al. An investigation into the skeletonization approach of hilditch , 1984, Pattern Recognit..

[5] Jan Olszewski,et al. An efficient distributed thinning algorithm , 1992, Parallel Comput..

[6] C. J. Hilditch,et al. Linear Skeletons From Square Cupboards , 1969 .

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

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

[9] Krzystof T. Malowaniec,et al. The Distributed System POOL , 1987, Experiences with Distributed Systems.

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

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