Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Rosenfeld: Characterization of parallel thinning algorithms. Information and Control 29, 286–291 (1975)
Pavlidis, T.: Algorithms for Graphics and Image Processing. Computer Science Press, Rockville (1982)
Zou, J.J., Chang, H.-H., Yan, H.: Shape skeletonization by identifying discrete local symmetries. Pattern Recognition 34, 185–1905 (2001)
Smith, R.W.: Computer processing of line images: a survey. Pattern Recognition 20, 7–15 (1987)
Lam, L., Lee, S.-W., Suen, C.Y.: Thinning methodologies – a compressive survey. IEEE Tran. Pattern A. 14, 869–885 (1992)
Leymarie, F., Levine, M.D.: Simulating the grassfire transform using an active contour model. IEEE Trans. Pattern A. 14, 56–75 (1992)
Tamura, H.: A comparison of line thinning algorithms from the digital viewpoint. In: Proc. of 4th ICPR, pp. 715–719 (1987)
Deutsch, E.S.: Thinning algorithms on rectangular, hexagonal, and triangular arrays. Communications of the ACM 15, 827–837 (1972)
Zhang, T.Y., Suen, C.Y.: A fast parallel algorithm for thinning digital patterns. Image Processing and Computer Vision 27, 236–239 (1984)
J. L. Díaz de León S, Algoritmos de esqueletización de imágenes digitales binarias, Master thesis, Mexico, 1993.
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)
Abdulla, W.H., Saleh, A.O., Morad, A.H.: A preprocessing algorithm for hand written character recognition. Pattern Recognition Letters 7, 13–18 (1988)
González, R., Woods, E.: Digital Image Processing, 2nd edn. Prentice Hall, Englewood Cliffs
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Díaz de León, J.L., Yánez, C., Guzmán, G. (2004). Thinning Algorithm to Generate k-Connected Skeletons. In: Sanfeliu, A., Martínez Trinidad, J.F., Carrasco Ochoa, J.A. (eds) Progress in Pattern Recognition, Image Analysis and Applications. CIARP 2004. Lecture Notes in Computer Science, vol 3287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30463-0_76
Download citation
DOI: https://doi.org/10.1007/978-3-540-30463-0_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23527-9
Online ISBN: 978-3-540-30463-0
eBook Packages: Springer Book Archive