DocumentCode :
1118597
Title :
On the Chain Code of a Line
Author :
Wu, Li-De
Author_Institution :
Division of Applied Mathematics, Brown University, Providence, RI 02912; Department of Computer Science, Fudan University, Shanghai, China.
Issue :
3
fYear :
1982
fDate :
5/1/1982 12:00:00 AM
Firstpage :
347
Lastpage :
353
Abstract :
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].
Keywords :
Algorithm design and analysis; Computer science; Image analysis; Mathematics; Pattern recognition; Shape; Chain code; chord property; generating algorithm; recognition algorithm; straight line;
fLanguage :
English
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher :
ieee
ISSN :
0162-8828
Type :
jour
DOI :
10.1109/TPAMI.1982.4767258
Filename :
4767258
Link To Document :
بازگشت