A parallel graytone thinning algorithm (PGTA)

A parallel graytone thinning algorithm (PGTA) is proposed in this paper. This algorithm is a generalization of a well-known two-tone thinning algorithm of ^Z^h^a^n^g^ ^a^n^d^ ^S^u^e^n^ ^(^1^9^8^4^) and is equally applicable for both graytone and two-tone images. The performance of PGTA is demonstrated on a variety of images, where it is seen that PGTA not only thins the object but also enhances the object-background contrast.

[1]  Azriel Rosenfeld,et al.  A Medial Axis Transformation for Grayscale Pictures , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Josef Kittler,et al.  Greylevel edge thinning: A new method , 1983, Pattern Recognit. Lett..

[3]  Sankar K. Pal.  Fuzzy skeletonization of an image , 1989, Pattern Recognit. Lett..

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

[5]  Azriel Rosenfeld,et al.  A Min-Max Medial Axis Transformation , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Giorgio Levi,et al.  A Grey-Weighted Skeleton , 1970, Inf. Control..

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

[8]  Raymond W. Smith,et al.  Computer processing of line images: A survey , 1987, Pattern Recognit..