A rate and distortion analysis of chain codes for line drawings

The performance of chain codes for line drawings in the framework of source coding with a fidelity criterion is investigated. A formal characterization is given for a broad class of chain codes that includes the generalized chain codes of Freeman and the convex quantizers of Koplowitz. Measures of distortion (fidelity) and rate (efficiency) are introduced. The distortion and rate are calculated for several types of chain codes applied to straight and slowly curving lines. Several statistical models for straight lines are introduced and the average performance of chain codes for these models is investigated.

[1]  Herbert Freeman,et al.  Application of the Generalized Chain Coding Scheme to Map Data Processing. , 1978 .

[2]  Herbert Freeman,et al.  On the Quantization of Line-Drawing Data , 1969, IEEE Trans. Syst. Sci. Cybern..

[3]  H. Freeman,et al.  Comparative analysis of line-drawing modeling schemes , 1980 .

[4]  DANIEL K. SCHOLTEN,et al.  Chain Coding with a Hexagonal Lattice , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Jack Koplowitz,et al.  On the Performance of Chain Codes for Quantization of Line Drawings , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  I. Good,et al.  Ergodic theory and information , 1966 .

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  Herbert Freeman.  Computer Processing of Line Drawings. , 1973 .

[9]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[10]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.