DocumentCode :
1114785
Title :
Thinning Algorithms for Gray-Scale Pictures
Author :
Dyer, Charles R. ; Rosenfeld, Azriel
Author_Institution :
Computer Science Center, University of Maryland, College Park, MD 20742.
Issue :
1
fYear :
1979
Firstpage :
88
Lastpage :
89
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.
Keywords :
Biological cells; Computer science; Gray-scale; Handwriting recognition; Image segmentation; Night vision; Particle tracking; Pattern recognition; Rivers; Image processing; pattern recognition; skeletonization; thinning;
fLanguage :
English
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher :
ieee
ISSN :
0162-8828
Type :
jour
DOI :
10.1109/TPAMI.1979.4766880
Filename :
4766880
Link To Document :
بازگشت