DocumentCode
1533474
Title
CGT: A fast thinning algorithm implemented on a sequential computer
Author
Wen Xu ; Chengxun Wang
Author_Institution
Dept. of Electron. Eng., Dalian Inst. of Technol, China
Volume
17
Issue
5
fYear
1987
Firstpage
847
Lastpage
851
Abstract
An approach called contour generating is proposed to reduce drastically the running time for parallel thinning algorithms on a sequential computer by providing extra storage space. The time complexity of a parallel thinning algorithm using this technique is proportional only to the object area of the image instead of the product of the whole image area and the maximum half-width of the object. Experimental results show that the proposed algorithm, called the contour generating thinning (CGT) algorithm, is the fastest of all reported thinning algorithms, and the skeletons produced are of good quality.
Keywords
computational complexity; computerised pattern recognition; computerised picture processing; parallel processing; computerised pattern recognition; computerised picture processing; contour generating thinning algorithm; parallel thinning; sequential computer; time complexity;
fLanguage
English
Journal_Title
Systems, Man and Cybernetics, IEEE Transactions on
Publisher
ieee
ISSN
0018-9472
Type
jour
DOI
10.1109/TSMC.1987.6499292
Filename
6499292
Link To Document