Thinning Algorithms for Gray-Scale Pictures

Authors:
Charles R. Dyer;Azriel Rosenfeld
Affiliations:
Computer Science Center, University of Maryland, College Park, MD 20742.;Computer Science Center, University of Maryland, College Park, MD 20742.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1979

Citing 0
Cited 4

K3M: A universal algorithm for image skeletonization and a review of thinning techniques

International Journal of Applied Mathematics and Computer Science
The fuzzy geometry of image subsets

Pattern Recognition Letters
Core-line tracing for fuzzy image subsets

Pattern Recognition Letters
A parallel thinning algorithm for grayscale images

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.14

Visualization

Abstract

Elongated black objects in black-and-white pictures can be ``thinned'' to arcs and curves, without changing their connectedness, by (repeatedly) deleting black border points whose deletion does not locally disconnect the black points in their neighborhoods. This technique generalizes to gray-scale pictures if we use a weighted definition of connectedness: two points are ``connected'' if there is a path joining them on which no point is lighter than either of them. We can then ``thin'' dark objects by changing each point's gray level to the minimum of its neighbors' gray levels, provided this does not disconnect any pair of points in its neighborhood. Examples illustrating the performance of this technique are given.