Hidden Deletable Pixel Detection Using Vector Analysis in Parallel Thinning to Obtain Bias-Reduced Skeletons

The improvement of producing skeletons that preserve the significant geometric features of patterns is of great importance. One of feasible approaches is to develop a method embedded in a known parallel algorithm to produce bias-reduced skeletons since a bias skeleton usually degrades the preservation of significant geometric features of patterns. From our observations, bias skeletons always appear in the junction of lines which form an angle less than or near equal to 90°. In this paper, thehidden deletable pixel(HDP) which influences the speed of deleting the boundary pixels on a concave side is newly defined. Based on the comparable performance of our pseudo 1-subcycle parallel thinning algorithm (CH), a reduced form of larger support (twoL-pixel vectors, which is not the form ofk×ksupport) operated by an intermediate vector analysis about the deleted pixels in each thinning iteration is developed for HDP detection to obtain bias-reduced skeletons, which can be purchased by a reasonable computation cost. HDP restoration and parallel implementation are further considered to formulate an improved algorithm (CYS), where the connectivity preservation is guaranteed by the use ofCH's operators and HDP restoration. A set of synthetic images are used to quantify the skeleton from the geometry viewpoint and investigate the skeleton variations of using different (L)s. Based on the analyzing results, 3 ?L? 9 are suggested for the current algorithm ofCYS.CYSis evaluated in comparison with two small support algorithms (AFP3andCH) and one larger support algorithm (VRCT) using the same patterns. Performances are reported by the number of iterations (NI), CPU time (TC), and number of unmatched pixels (Nunmatchfor bias-reduced measure). Results show that on the measure ofTC,CYSis approximately 2 to 3 times slower than the others, while on the measure ofNI, the four algorithms have approximately identical performance. On the measure ofNunmatch,CYSis approximately 2 to 3 times less than the others. One-pixel boundary noise is also considered for exploring the noise immunity. The results suggest that the noise immunity ofCYSandCHis identical and is better than that ofAFP3. As a result, the better bias-reduced skeletons produced byCYSmay be purchased by a reasonable computation cost.

[1]  Roland T. Chin,et al.  A one-pass thinning algorithm and its parallel implementation , 1987, Comput. Vis. Graph. Image Process..

[2]  Keiichi Abe,et al.  Binary picture thinning by an iterative parallel two-subcycle operation , 1987, Pattern Recognit..

[3]  V. K. Govindan,et al.  Character recognition - A review , 1990, Pattern Recognit..

[4]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[5]  Yung-Sheng Chen,et al.  Thinning approach for noisy digital patterns , 1996, Pattern Recognit..

[6]  V. K. Govindan,et al.  A pattern adaptive thinning algorithm , 1987, Pattern Recognit..

[7]  Richard W. Hall,et al.  Fast parallel thinning algorithms: parallel speed and connectivity preservation , 1989, CACM.

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

[9]  Azriel Rosenfeld,et al.  Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..

[10]  Richard W. Hall Optimally Small Operator Supports for Fully Parallel Thinning Algorithms , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

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

[12]  Zicheng Guo,et al.  Fast fully parallel thinning algorithms , 1991, CVGIP Image Underst..

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

[14]  Yung-Sheng Chen,et al.  A multi-function parallel processor for binary image processing , 1988 .

[15]  Xiaobo Li,et al.  Variable-resolution character thinning , 1991, Pattern Recognit. Lett..

[16]  Mark B. Sandler,et al.  Comparative evaluation of fast thinning algorithms on a multiprocessor architecture , 1992, Image Vis. Comput..

[17]  Yung-Sheng Chen,et al.  Further considerations of a 1-subcycle parallel thinning algorithm , 1992 .

[18]  Wen-Hsiang Tsai,et al.  A new one-pass parallel thinning algorithm for binary images , 1992, Pattern Recognit. Lett..

[19]  Stéphane Ubéda,et al.  A Parallel Thinning Algorithm Using K x K Masks , 1993, Int. J. Pattern Recognit. Artif. Intell..

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

[21]  C. J. Hilditch Comparison of thinning algorithms on a parallel processor , 1983, Image Vis. Comput..

[22]  Ching Y. Suen,et al.  Automatic Comparison of Skeletons by Shape Matching Methods , 1993, Int. J. Pattern Recognit. Artif. Intell..

[23]  AZRIEL ROSENFELD,et al.  Digital Straight Line Segments , 1974, IEEE Transactions on Computers.

[24]  Yung-Sheng Chen,et al.  A comparison of some one-pass parallel thinnings , 1990, Pattern Recognit. Lett..

[25]  Ching Y. Suen,et al.  An alternate smoothing and stripping algorithm for thinning digital binary patterns , 1986 .

[26]  Bin Chen,et al.  Recognition of handwritten Chinese characters via short line segments , 1992, Pattern Recognit..

[27]  Wen-Hsiang Tsai,et al.  A new fast one-pass thinning algorithm and its parallel hardware implementation , 1990, Pattern Recognit. Lett..

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

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

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

[31]  Yung-Sheng Chen,et al.  COMMENTS ON A SYSTEMATIC APPROACH FOR DESIGNING 2-SUBCYCLE PARALLEL THINNING ALGORITHMS , 1992 .

[32]  S. Impedovo,et al.  Optical Character Recognition - a Survey , 1991, Int. J. Pattern Recognit. Artif. Intell..

[33]  Lawrence O'Gorman,et al.  K × K Thinning , 1990, Comput. Vis. Graph. Image Process..

[34]  Tony Kasvand,et al.  Critical points on a perfectly 8- or 6-connected thin binary line , 1983, Pattern Recognit..

[35]  Ching Y. Suen,et al.  An Evaluation of Parallel Thinning Algorithms for Character Recognition , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[36]  Karl Sims,et al.  Handwritten Character Classification Using Nearest Neighbor in Large Databases , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[37]  Yung-Sheng Chen,et al.  A 1-subcycle parallel thinning algorithm for producing perfect 8-curves and obtaining isotropic skeleton of an L-shape pattern , 1989, Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition.