This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis of the Precision of Generalized Chain Codes for the Representation of Planar Curves
May 1981 (vol. 3 no. 5)
pp. 533-539
John A. Saghri, Rensselaer Polytechnic Institute, Troy, NY 12181; Aerospace Corporation, P.O. Box 92957, Los Angeles, CA 90009.
Herbert Freeman, FELLOW, IEEE, Rensselaer Polytechnic Institute, Troy, NY 12181.
This paper examines a set of line-segment approximation codes for the representation of planar curves (the so-called generalized chain codes) and shows that the average quantization error (measure of code's precision) is directly proportional to the grid size and is independent of the form of the code. Thus, to achieve a desired level of precision for the representation of a line drawing, only the size of the grid need be determined; the form of the code can be chosen on the basis of other criteria, such as compactness, smoothness, or relative ease of encoding and processing.
Citation:
John A. Saghri, Herbert Freeman, "Analysis of the Precision of Generalized Chain Codes for the Representation of Planar Curves," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 5, pp. 533-539, May 1981, doi:10.1109/TPAMI.1981.4767146
Usage of this product signifies your acceptance of the Terms of Use.