An effective algorithm of skeletonization for digital binary pictures based on input-time-tracing principle and sequential decomposition of input picture into simple parts is described. The proposed algorithm is fast and requires no image memory. Its computing complexity does not depend on the thick
โฆ LIBER โฆ
Skeletonization Algorithm for Binary Images
โ Scribed by Abu-Ain, Waleed; Abdullah, Siti Norul Huda Sheikh; Bataineh, Bilal; Abu-Ain, Tarik; Omar, Khairuddin
- Book ID
- 122291650
- Publisher
- Elsevier
- Year
- 2013
- Weight
- 492 KB
- Volume
- 11
- Category
- Article
- ISSN
- 2212-0173
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Width-independent fast skeletonization a
โ
V. M. Kiyko; M. I. Schlesinger
๐
Article
๐
1991
๐
John Wiley and Sons
๐
English
โ 450 KB
Parametrisable skeletonization of binary
โ
S. Riazanoff; B. Cervelle; J. Chorowicz
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 551 KB
A parallel algorithm for decomposition o
โ
S.K. Parui; A. Datta
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 325 KB
Distance-Ordered Homotopic Thinning: A S
โ
Chris Pudney
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 583 KB
Skeletonization for fuzzy degraded chara
โ
Shy-Shyan Chen, ; Shih, F.Y.
๐
Article
๐
1996
๐
IEEE
๐
English
โ 578 KB
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