Pattern thinning by contour tracing

Abstract The possibility of applying thinning algorithms to digital figures not already nearly thin is discussed in the framework of using contour tracing to inspect the pixels currently candidates for removal. The proposed algorithm takes advantage of this approach both to reduce the computation time needed to obtain the skeleton and to perform contour analysis in order to find the contour regions to be represented by the skeleton branches. Since different contour descriptions can be found, various skeleton structures can alternatively be generated depending on the requirements of the problem domain. The skeleton found may also be regarded as a discrete version of that obtained by using the medial axis transformation.

[1]  Theodosios Pavlidis,et al.  Structural pattern recognition , 1977 .

[2]  Azriel Rosenfeld,et al.  Connectivity in Digital Pictures , 1970, JACM.

[3]  B. Rosenberg.  The analysis of convex blobs , 1972, Comput. Graph. Image Process..

[4]  Azriel Rosenfeld,et al.  A note on polygonal and elliptical approximation of mechanical parts , 1979, Pattern Recognit..

[5]  Theodosios Pavlidis,et al.  A review of algorithms for shape analysis , 1978 .

[6]  T. Morrin.  Chain-link compression of arbitrary black-white images , 1976 .

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

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

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

[10]  A. ROSENFELD,et al.  Distance functions on digital pictures , 1968, Pattern Recognit..

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

[12]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.

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

[14]  S. H. Unger,et al.  Pattern Detection and Recognition , 1959, Proceedings of the IRE.

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

[16]  David L. Milgram,et al.  Region extraction using convergent evidence , 1979 .

[17]  Azriel Rosenfeld,et al.  Adjacency in Digital Pictures , 1974, Inf. Control..

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

[19]  Azriel Rosenfeld,et al.  Arcs and Curves in Digital Pictures , 1973, JACM.

[20]  John F. O'Callaghan,et al.  Quantitative measurement of soil cracking patterns , 1973, Pattern Recognit..

[21]  Bruce H. McCormick,et al.  The Illinois Pattern Recognition Computer-ILLIAC III , 1963, IEEE Trans. Electron. Comput..

[22]  Theodosios Pavlidis,et al.  STRUCTURAL PATTERN RECOGNITION: PRIMITIVES AND JUXTAPOSITION RELATIONS* , 1972 .

[23]  Stefano Levialdi,et al.  On shrinking binary picture patterns , 1972, CACM.

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

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

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

[27]  G Gallus,et al.  Improved computer chromosome analysis incorporating preprocessing and boundary analysis , 1970, Physics in medicine and biology.

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

[29]  Larry S. Davis,et al.  Understanding Shape: Angles and Sides , 1977, IEEE Transactions on Computers.

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