Binary picture thinning by an iterative parallel two-subcycle operation

Abstract A thinning algorithm for digital binary pictures is presented. The algorithm repeats the removal of the deletable border points in parallel and the extraction of the final points. It is implemented as an iterative parallel two-subcycle operation. Consequently, the number of iterations required is about equal to the maximum width of the input figures. The algorithm erases the end points while the iteration number is smaller than a given threshold. Utilization of the final point condition makes the algorithm faster and the flexible deletion of end points produces a line pattern of good quality even for noisy figures.

[1]  Keiichi Abe,et al.  Max-Type Distance Transformation for Digitized Binary Pictures and Its Applications , 1983 .

[2]  Theodosios Pavlidis.  An asynchronous thinning algorithm , 1982, Comput. Graph. Image Process..

[3]  S. Levialdi,et al.  Basics of cellular logic with some applications in medical image processing , 1979, Proceedings of the IEEE.

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

[5]  Martin A. Fischler,et al.  An iconic transform for sketch completion and shape abstraction , 1980 .

[6]  Gerd Woetzel.  A fast and economic scan-to-line-conversion algorithm , 1978, SIGGRAPH '78.

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

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

[9]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

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

[11]  Keiichi Abe,et al.  New Fusion Operations for Digitized Binary Images and Their Applications , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  A. Favre,et al.  Parallel syntactic thinning by recoding of binary pictures , 1983, Comput. Vis. Graph. Image Process..

[13]  T. Fukumura,et al.  An efficient thinning algorithm for large-scale images based on pipeline structure , 1984 .

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

[15]  Gabriella Sanniti di Baja,et al.  A thinning algorithm based on prominence detection , 1981, Pattern Recognit..

[16]  Theodosios Pavlidis,et al.  An asynchronous thinning algorithm , 1982, Comput. Graph. Image Process..

[17]  Edward S. Deutsch,et al.  Thinning algorithms on rectangular, hexagonal, and triangular arrays , 1972, Commun. ACM.

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

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

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

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