A thinning algorithm for discrete binary
✍
Theo Pavlidis
📂
Article
📅
1980
🏛
Elsevier Science
⚖ 891 KB
The paper discusses thirming algorithms and introduces a characterization of skeletal pixels in terms of how many arcs of the boundary pass through a pixel. A new algorithm is proposed which proceeds by peeling off successive contours of the set to be thinned while identifying pixels where disjoint