Loading…
A robust parallel thinning algorithm for binary images
The class of multi-pass iterative thinning algorithms is considered. A new algorithm in the same class is proposed and is shown, on the basis of experimental results, to be superior to the existing ones with respect to medial axis representation and robustness. Some basic properties of thinning like...
Saved in:
Published in: | Pattern recognition 1994, Vol.27 (9), p.1181-1192 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The class of multi-pass iterative thinning algorithms is considered. A new algorithm in the same class is proposed and is shown, on the basis of experimental results, to be superior to the existing ones with respect to medial axis representation and robustness. Some basic properties of thinning like 1 pixel thickness, preservation of connectivity for the present algorithm are ensured for which theoretical proofs are also given. |
---|---|
ISSN: | 0031-3203 1873-5142 |
DOI: | 10.1016/0031-3203(94)90004-3 |