By Topic

On the Chain Code of a Line

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

1 Author(s)
Li-De Wu ; Division of Applied Mathematics, Brown University, Providence, RI 02912; Department of Computer Science, Fudan University, Shanghai, China.

In 1970 Freeman suggested the following criteria which the chain code of a line must meet [1], [2]: 1) at most two basic directions are present and these can differ only by unity, modulo eight, 2) one of these values always occurs singly, 3) successive occurrences of the principal direction occurring singly are as uniformly spaced as possible. In this correspondence we give the following: 1) an algorithm presentation of Freeman's three properties about the chain code of a line and the proof that it is also the algorithm recognizing whether a chain code is the chain code of a line, 2) the proof of the equivalence of the above presentation and Rosenfeld's chord property [3].

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:PAMI-4 ,  Issue: 3 )