Skeletonization of binary images with nonuniform width via block decomposition and contour vector matching

Thinning is a very important preprocessing step for many image analysis operations, such as optical character recognition and fingerprint recognition. The main drawbacks of traditional thinning algorithms are low speed and serious deformation. To remedy these problems, a novel approach which generates the skeletons of binary patterns via block decomposition and contour vector matching is proposed in this paper. The proposed skeletonization mechanism not only skeletonizes binary patterns but also vectorizes the generated skeletons simultaneously. In our approach, the considered binary image is first decomposed into several smaller blocks. Then, the block skeleton is generated for each decomposed block. The generated block skeletons are gathered to form the skeleton of the considered image. Last, the gaps inside or between block skeletons are filled based on the block connectivity information to form the final intact skeleton. The performance of the proposed algorithm is compared with existing algorithms. Experimental results confirm the superiority of our proposed approach.

[1]  Ching Y. Suen,et al.  Structural classification and relaxation matching of totally unconstrained handwritten zip-code numbers , 1988, Pattern Recognit..

[2]  Theo Pavlidis,et al.  A vectorizer and feature extractor for document recognition , 1986 .

[3]  Erdal Panayirci,et al.  Extension of the Cox-Lewis method for testing multi-dimensional data , 1988 .

[4]  E. R. Davies,et al.  Thinning algorithms: A critique and a new methodology , 1981, Pattern Recognit..

[5]  Chin-Chuan Han,et al.  Skeleton generation of engineering drawings via contour matching , 1994, Pattern Recognit..

[6]  Kenneth Steiglitz,et al.  The Automatic Counting of Asbestos Fibers in Air Samples , 1978, IEEE Transactions on Computers.

[7]  T ChinRoland,et al.  One-Pass Parallel Thinning , 1992 .

[8]  King-Sun Fu,et al.  A syntactic approach to fingerprint pattern recognition , 1975, Pattern Recognit..

[9]  Frank Y. Shih,et al.  Fully parallel thinning with tolerance to boundary noise , 1994, Pattern Recognit..

[10]  Patrick Shen-Pei Wang,et al.  A New Parallel Thinning Methodology , 1994, Int. J. Pattern Recognit. Artif. Intell..

[11]  Roland T. Chin,et al.  One-Pass Parallel Thinning: Analysis, Properties, and Quantitative Evaluation , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Amitava Datta,et al.  A robust parallel thinning algorithm for binary images , 1994, Pattern Recognit..

[13]  Yung-Sheng Chen,et al.  A modified fast parallel algorithm for thinning digital patterns , 1988, Pattern Recognit. Lett..

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

[15]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[16]  T. Pavlidis A thinning algorithm for discrete binary images , 1980 .

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

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

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

[20]  Gabriella Sanniti di Baja,et al.  A One-Pass Two-Operation Process to Detect the Skeletal Pixels on the 4-Distance Transform , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Richard L. Grimsdale,et al.  A system for the automatic recognition of patterns , 1959 .

[22]  Bei Li,et al.  A knowledge-based thinning algorithm , 1991, Pattern Recognit..

[23]  Louisa Lam,et al.  Structural classification and relaxation matching of totally unconstrained handwritten numerals , 1986 .

[24]  Nabil Jean Naccache,et al.  SPTA: A proposed algorithm for thinning binary patterns , 1984, IEEE Transactions on Systems, Man, and Cybernetics.