2004
DOI: 10.1007/978-3-540-30463-0_76
|View full text |Cite
|
Sign up to set email alerts
|

Thinning Algorithm to Generate k-Connected Skeletons

Abstract: Abstract. This paper presents a novel algorithm intended to generate kconnected 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Such a small change, again, does not introduce too much overhead. In our prototype, we adapt a mask-based thinning algorithm (Diaz de Leon et al, 2004) for biased thinning. The gain in running time is insignificant.…”
Section: Biased Thinningmentioning
confidence: 99%
“…Such a small change, again, does not introduce too much overhead. In our prototype, we adapt a mask-based thinning algorithm (Diaz de Leon et al, 2004) for biased thinning. The gain in running time is insignificant.…”
Section: Biased Thinningmentioning
confidence: 99%