Thinning Algorithm to Generate k-Connected Skeletons

  • Juan Luis Díaz de León
  • C. Yánez
  • Giovanni Guzmán
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3287)


This paper presents a novel algorithm intended to generate k-connected skeletons of a digital binary image using a new mask set. These skeletons may be 4 or 8 connected. The new algorithm performs a thinning process that finish when it is not possible to eliminate additional pixels without breaking the connectivity. The end-point criterion and a 3x3 masks set are used to decide if a pixel is eliminated. The proposed masks set for each kind of connectivity covers all the necessary cases, and guarantee to obtain a one pixel wide and k-connected skeleton without parasitic branches. The new algorithm yields some advantages to developers. It is not just oriented to written characters or some kind of object in particular; this means that the algorithm can be adapted easily to any application generating good results. Besides, the user can work with different classes of connectivity; note that several recent algorithms use 4-connectivity while 8-connectivity is used for others. Additionally, the skeletons produced by the new algorithm are immune to structured noise around the processed objects.


Active Contour Model Structure Noise Label Point Digital Geometry Fast Parallel Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Rosenfeld: Characterization of parallel thinning algorithms. Information and Control 29, 286–291 (1975)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Pavlidis, T.: Algorithms for Graphics and Image Processing. Computer Science Press, Rockville (1982)Google Scholar
  3. 3.
    Zou, J.J., Chang, H.-H., Yan, H.: Shape skeletonization by identifying discrete local symmetries. Pattern Recognition 34, 185–1905 (2001)CrossRefGoogle Scholar
  4. 4.
    Smith, R.W.: Computer processing of line images: a survey. Pattern Recognition 20, 7–15 (1987)CrossRefGoogle Scholar
  5. 5.
    Lam, L., Lee, S.-W., Suen, C.Y.: Thinning methodologies – a compressive survey. IEEE Tran. Pattern A. 14, 869–885 (1992)CrossRefGoogle Scholar
  6. 6.
    Leymarie, F., Levine, M.D.: Simulating the grassfire transform using an active contour model. IEEE Trans. Pattern A. 14, 56–75 (1992)CrossRefGoogle Scholar
  7. 7.
    Tamura, H.: A comparison of line thinning algorithms from the digital viewpoint. In: Proc. of 4th ICPR, pp. 715–719 (1987)Google Scholar
  8. 8.
    Deutsch, E.S.: Thinning algorithms on rectangular, hexagonal, and triangular arrays. Communications of the ACM 15, 827–837 (1972)CrossRefGoogle Scholar
  9. 9.
    Zhang, T.Y., Suen, C.Y.: A fast parallel algorithm for thinning digital patterns. Image Processing and Computer Vision 27, 236–239 (1984)Google Scholar
  10. 10.
    J. L. Díaz de León S, Algoritmos de esqueletización de imágenes digitales binarias, Master thesis, Mexico, 1993. Google Scholar
  11. 11.
    Lü, H.E., Wang, S.P.: A comment on a fast parallel algorithm for thinning digital patterns. Image Processing and Computer Vision 29, 239–242 (1986)Google Scholar
  12. 12.
    Abdulla, W.H., Saleh, A.O., Morad, A.H.: A preprocessing algorithm for hand written character recognition. Pattern Recognition Letters 7, 13–18 (1988)CrossRefGoogle Scholar
  13. 13.
    González, R., Woods, E.: Digital Image Processing, 2nd edn. Prentice Hall, Englewood CliffsGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Juan Luis Díaz de León
    • 1
  • C. Yánez
    • 1
  • Giovanni Guzmán
    • 1
  1. 1.Digital Image Processing LaboratoryCentre for Computing Research (CIC)Mexico CityMexico

Personalised recommendations