Ahmed and Ward [2] have recently presented an elegant, rule-based rotation-invariant thinning algorithm to produce a single-pixel wide skeleton from a binary image. We show examples where this algorithm fails on two-pixel wide lines and propose a modified method which corrects this shortcoming based on graph connectivity. [1] L. Lam and C.Y. Suen, “An Evaluation of Parallel Thinning Algorithms for Character-Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 9, pp. 914-919, Sept. 1995.
Index Terms:
Index Terms- Thinning, skeletonization, graph theory.
Citation:
Peter I. Rockett, "An Improved Rotation-Invariant Thinning Algorithm," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 10, pp. 1671-1674, Oct. 2005, doi:10.1109/TPAMI.2005.191 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||