Paper Info
Title
Thinning Algorithm to Generate k-Connected Skeletons
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 30 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.
Year
DOI
Venue
2004
10.1007/978-3-540-30463-0_76
Lecture Notes in Computer Science
Keywords
Field
DocType
binary image
Active contour model,Computer vision,Mask set,Computer science,Binary image,Algorithm,Digital image,Artificial intelligence,Pixel,Digital geometry,Thinning algorithm,Branching (version control)
Conference
Volume
ISSN
Citations 
3287
0302-9743
0
PageRank 
References 
Authors
0.34
9
3
Name
Order
Citations
PageRank
Juan Luis Díaz-de-León S.173.38
Cornelio Yanez Marquez2172.99
Giovanni Guzmán35113.61