On the Performance of Chain Codes for Quantization of Line Drawings

Authors:
Jack Koplowitz
Affiliations:
SENIOR MEMBER, IEEE, Department of Electrical and Computer Engineering, Clarkson College of Technology, Potsdam, NY 13676.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1981

Citing 0
Cited 6

A new adaptive vertex-based binary shape coding technique

Image and Vision Computing
A novel approach to polygonal approximation of digital curves

Journal of Visual Communication and Image Representation
Capturing outlines of 2D objects with Bézier cubic approximation

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
Geometric distortion measurement for shape coding: A contemporary review

ACM Computing Surveys (CSUR)
On bit reduction of chain coded line drawings

Pattern Recognition Letters

Quantified Score

Hi-index	0.14

Visualization

Abstract

A class of quantization schemes is presented which generalizes various existing chain coding methods. For the general case, simple expressions are derived for the probabilities of the directional elements from which we can determine the number of curve points and the length of the quantized curve. These results allow for the comparison of performance of the various encoding schemes.