By Topic

CGT: A fast thinning algorithm implemented on a sequential computer

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wen Xu ; Dept. of Electron. Eng., Dalian Inst. of Technol, China ; Chengxun Wang

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.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:17 ,  Issue: 5 )