A thinning algorithm by contour generation

A new contour generating serial algorithm is faster and more efficient than conventional contour tracing and parallel algorithms

[1]  Wen Xu,et al.  CGT: A fast thinning algorithm implemented on a sequential computer , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[2]  H. Freeman,et al.  Apictorial Jigsaw Puzzles: The Computer Solution of a Problem in Pattern Recognition , 1964, IEEE Trans. Electron. Comput..

[3]  T. S. Perry,et al.  Computer displays: New choices, new tradeoffs: Advances on several fronts let users and designers juggle lightness, brightness, and price as well as much-sought-after flatness , 1985, IEEE Spectrum.

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

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

[6]  Martin D. Levine,et al.  Multiple Resolution Skeletons , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[9]  Azriel Rosenfeld,et al.  Computer representation of planar regions by their skeletons , 1967, CACM.

[10]  King-Sun Fu,et al.  A Tree System Approach for Fingerprint Pattern Recognition , 1976, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

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

[13]  R.M. McElhaney,et al.  Algorithms for graphics and image processing , 1983, Proceedings of the IEEE.

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

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

[16]  Theo Pavlidis,et al.  Algorithms for Graphics and Imag , 1983 .

[17]  Larry S. Davis,et al.  A Corner-Finding Algorithm for Chain-Coded Curves , 1977, IEEE Transactions on Computers.

[18]  Carlo Arcelli.  A condition for digital points removal , 1979 .

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

[20]  Per Brinch Hansen,et al.  Concurrent Programming Concepts , 1973, CSUR.

[21]  L. Montoto,et al.  A thinning transform for digital images , 1981 .

[22]  Carlo Arcelli,et al.  Pattern thinning by contour tracing , 1981 .

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

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

[25]  Theo Pavlidis,et al.  Filling algorithms for raster graphics , 1979 .

[26]  Irvin Sobel,et al.  Neighborhood coding of binary images for fast contour following and general binary array processing , 1978 .