A New Parallel Thinning Methodology

A perfectly parallel thinning algorithm (PPTA) is proposed. It can generate perfect skeletons, which consist of end points, break points, and hole points only. Experimental results show that the proposed PPTA can also preserve image connectivity, produce thinner skeletons, and is faster than many existing thinning algorithms. For example, it is twice as fast as one of the fastest parallel thinning algorithm by Holt, Stewart, Clint and Perrorte.

[1]  Ching Y. Suen.  Thinning Methodologies for Pattern Recognition , 1994 .

[2]  Ching Y. Suen,et al.  Thinning Methodologies - A Comprehensive Survey , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Patrick Shen-Pei Wang,et al.  A Fast and Flexible Thinning Algorithm , 1989, IEEE Trans. Computers.

[4]  Yung-Sheng Chen,et al.  Systematic approach for designing 2-subcycle and pseudo 1-subcycle parallel thinning algorithms , 1989, Pattern Recognit..

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

[6]  Azriel Rosenfeld,et al.  A Note on Thinning , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Azriel Rosenfeld,et al.  A Characterization of Parallel Thinning Algorithms , 1975, Inf. Control..