Analysis of the Precision of Generalized Chain Codes for the Representation of Planar Curves

Authors:
John A. Saghri;Herbert Freeman
Affiliations:
Rensselaer Polytechnic Institute, Troy, NY 12181/ Aerospace Corporation, P.O. Box 92957, Los Angeles, CA 90009.;FELLOW, IEEE, Rensselaer Polytechnic Institute, Troy, NY 12181.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1981

Citing 0
Cited 9

Shape recognition using spectral features

Pattern Recognition Letters
A novel approach to polygonal approximation of digital curves

Journal of Visual Communication and Image Representation
Image registration using robust M-estimators

Pattern Recognition Letters
Technical Section: An efficient technique for capturing 2D objects

Computers and Graphics
Contour simplification using a multi-scale local phase analysis

Image and Vision Computing
Capturing outlines of 2D objects with Bézier cubic approximation

Image and Vision Computing
Dominant point detection: A new proposal

Image and Vision Computing
A new single-pass algorithm for extracting the mid-crack codes of multiple regions

Journal of Visual Communication and Image Representation
An intelligent driver location system for smart parking

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.15

Visualization

Abstract

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.