TY - CHAP
T1 - Thinning algorithm to generate k-connected skeletons
AU - Díaz De León, Juan Luis
AU - Yánez, C.
AU - Guzmán, Giovanni
PY - 2004
Y1 - 2004
N2 - 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 3×3 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.
AB - 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 3×3 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.
UR - http://www.scopus.com/inward/record.url?scp=35048814494&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-30463-0_76
DO - 10.1007/978-3-540-30463-0_76
M3 - Capítulo
AN - SCOPUS:35048814494
SN - 3540235272
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 605
EP - 612
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A2 - Sanfeliu, Alberto
A2 - Martinez-Trinidad, Jose Francisco
A2 - Carrasco-Ochoa, Jesus Ariel
PB - Springer Verlag
ER -