Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Non-recursive thinning algorithms using chain codes

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
$31 $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

1 Author(s)
Kwok, P.C.K. ; Dept. of Comput. Sci., Calgary Univ., Alta., Canada

Describes the development of contour generation thinning algorithms that are non-recursive. Two algorithms are presented, both of them involves the use of 4 sub-cycles. Additional data structures are incorporated in the chain code to ensure consistency in the propagation of contour pixels. In both algorithm, the 4-distance metric is used. The first algorithm erodes a 4-connected contour in an iteration. The second algorithm remembers the state of the bitmap at the beginning of an iteration, with the result that an 8-contour is eroded

Published in:

Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings., 11th IAPR International Conference on

Date of Conference:

30 Aug-3 Sep 1992