Fast fully parallel thinning algorithms

Abstract Three new fast fully parallel 2-D thinning algorithms using reduction operators with 11-pixel supports are presented and evaluated. These are compared to earlier fully parallel thinning algorithms in tests on artificial and natural images; the new algorithms produce either superior parallel computation time (number of parallel iterations) or thinner medial curve results with comparable parallel computation time. Further, estimates of the best possible parallel computation time are developed which are applied to the specific test sets used. The parallel computation times of the new algorithms and one earlier algorithm are shown to approach closely or surpass these estimates and are in this sense near optimally fast.

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

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

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

[4]  Stefano Levialdi,et al.  Parallel thinning of binary pictures , 1975 .

[5]  T. Fukumura,et al.  An Analysis of Topological Properties of Digitized Binary Pictures Using Local Features , 1975 .

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

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

[8]  T. Pavlidis.  Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[9]  Marcel J. E. Golay,et al.  Hexagonal Parallel Pattern Transformations , 1969, IEEE Transactions on Computers.

[10]  Christian Ronse,et al.  Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images , 1988, Discret. Appl. Math..

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

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

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

[14]  Zicheng Guo,et al.  Parallel thinning with two-subiteration algorithms , 1989, Commun. ACM.

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

[16]  Azriel Rosenfeld,et al.  Digital Picture Processing, Volume 1 , 1982 .

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

[18]  Gabriella Sanniti di Baja,et al.  A Width-Independent Fast Thinning Algorithm , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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