This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tree Searched Chain Coding for Subpixel Reconstruction of Planar Curves
January 1989 (vol. 11 no. 1)
pp. 95-104

Coding schemes for the quantization of line drawings that outperform basic chain codes are investigated. First, subpixel accuracy reconstruction is obtained by a simple linear filtering of the chain code points, which achieves a factor-of-three to-four reduction in average reconstruction distortion for smooth curves. Second, the basic chain encoding schemes are generalized to a multipath-tree-searched encoding scheme. A variation of the (M,L)-algorithm is used to maintain M contending chain code paths in storage and choose the best path from these. Over a wide variety of source curves, tree-searched chain coding results in nearly an order of magnitude reduction in average reconstruction distortion over smoother chain codes. The performance improvement for curves is obtained with only a slight increase in bit rate over basic chain codes.

[1] J. Koplowitz, "On the performance of chain codes for the quantization of line drawings,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-3, Mar. 1981.
[2] D.L. Neuhoff and K. G. Castor, "A rate distortion analysis of chain codes for line drawings,"IEEE Trans. Inform. Theory, vol. 31, pp. 53-68, Jan. 1985.
[3] J. B. Anderson and S. Mohan, "Sequential coding algorithms: A survey and cost analysis,"IEEE Trans. Commun., vol. COM-32, Feb. 1984.
[4] J. B. Anderson and J. B. Bodie, "Tree encoding of speech,"IEEE Trans. Inform. Theory, July 1975.
[5] D. J. Goodman, "The application of delta modulation to analog-to-PCM encoding,"Bell Syst. Tech. J., vol. 48, Feb. 1969.
[6] W. D. Little, "An algorithm for high speed digital filters,"IEEE Trans. Comput., vol. C-23, May 1974.
[7] H. Freeman, "Computer processing of line-drawing images,"Computer Surveys, vol. 6, no. 1, Mar. 1974.
[8] H. Freeman and J. M. Glass, "On the quantization of line drawing data,"IEEE Trans. Syst. Sci. Cybern., vol. SSC-5, Jan. 1969.
[9] S. Mohan and A. K. Sood, "A multiprocessor architecture for the (M, L)-algorithm suitable for VLSI implementations,"IEEE Trans. Commun., vol. COM-34, pp. 1218-1224, Dec. 1986.
[10] H. A. Spang, III, and P. M. Schultheiss, "Reduction of quantization noise by use of feedback,"IRE Trans. Commun. Syst., vol. CS-10, Dec. 1962.

Index Terms:
computerised picture processing; tree searched chain encoding; subpixel reconstruction; planar curves; quantization; line drawings; linear filtering; reconstruction distortion; chain codes; computerised picture processing; encoding; filtering and prediction theory; trees (mathematics)
Citation:
R. Sriraman, J. Koplowitz, S. Mohan, "Tree Searched Chain Coding for Subpixel Reconstruction of Planar Curves," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 1, pp. 95-104, Jan. 1989, doi:10.1109/34.23116
Usage of this product signifies your acceptance of the Terms of Use.