A fast parallel algorithm for thinning digital patterns

A fast parallel thinning algorithm is proposed in this paper. It consists of two subiterations: one aimed at deleting the south-east boundary points and the north-west corner points while the other one is aimed at deleting the north-west boundary points and the south-east corner points. End points and pixel connectivity are preserved. Each pattern is thinned down to a skeleton of unitary thickness. Experimental results show that this method is very effective. 12 references.

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

[2]  Carlo Arcelli.  A condition for digital points removal , 1979 .

[3]  Hideo Ogawa,et al.  Thinning and stroke segmentation for handwritten Chinese character recognition , 1982, Pattern Recognit..

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

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

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

[7]  Edward S. Deutsch,et al.  Thinning algorithms on rectangular, hexagonal, and triangular arrays , 1972, Commun. ACM.

[8]  Azriel Rosenfeld,et al.  Connectivity in Digital Pictures , 1970, JACM.

[9]  Luigi P. Cordella,et al.  From Local Maxima to Connected Skeletons , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  B. Ripley,et al.  Pattern Recognition , 1968, Nature.