A parallel thinning algorithm with two-subiteration that generates one-pixel-wide skeletons

Author

Zhang, Y.Y. ; Wang, P.S.P.

Author_Institution

Coll. of Comput. Sci., Northeastern Univ., Boston, MA, USA

Volume

4

fYear

1996

fDate

25-29 Aug 1996

Firstpage

457

Abstract

Many algorithms for vectorization by thinning have been devised and applied to a great variety of pictures and drawings for data compression, pattern recognition and raster-to-vector conversion. But parallel thinning algorithms which generate one-pixel-wide skeletons can have difficulty preserving the connectivity of an image. In this paper, we propose a 2-subiteration parallel thinning algorithm with template matching (PTA2T) which preserves image connectivity, produces thinner results, maintains very fast speed and generates one-pixel-wide skeletons

Keywords

image processing; iterative methods; parallel processing; 2-subiteration parallel thinning algorithm; PTA2T; data compression; image connectivity; one-pixel-wide skeletons; parallel thinning algorithms; pattern recognition; raster-to-vector conversion; template matching; vectorization; Algorithm design and analysis; Computer science; Data compression; Educational institutions; Image coding; Image converters; Image recognition; Pattern recognition; Pixel; Skeleton;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 1996., Proceedings of the 13th International Conference on

Conference_Location

Vienna

ISSN

1051-4651

Print_ISBN

0-8186-7282-X

Type

conf

DOI

10.1109/ICPR.1996.547608

Filename

547608