A thinning algorithm by contour generation
Communications of the ACM
A flexible thinning algorithm allowing parallel, sequential, and distributed application
ACM Transactions on Mathematical Software (TOMS)
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Algorithms for Graphics and Imag
Algorithms for Graphics and Imag
Fingerprint image: pre- and post-processing
International Journal of Biometrics
An intelligent system for Chinese calligraphy
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
The divider set: a new concept in morphology
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
| Hi-index | 0.00 |
Thinning algorithms are applied in image processing to compute a skeleton of an image. In this paper a new thinning method is presented which differs in its approach from other thinning algorithms. In the presented algorithm the minimal distance of a pixel to the edge of the containing object is used to extract the skeleton. Given an n x n matrix of pixels, the algorithm runs in time O(n2). Our measurements show that it is faster than other known sequential algorithms. The mathematical background of the algorithm and the proof of essential features of the obtained skeleton are based on the consideration of the pattern as a directed graph.