Skip to main content
Log in

Abstract

The optimal design of quadtree-based codecs is addressed. Until now, work in this area has focused on the optimization of the quadtree structure for a given set of leaf quantizers while neglecting the design of the quantizers themselves. In cases where the leaf quantizers have been considered, codebooks have been optimized without regard to the ultimate quadtree segmentation. However, it is not sufficient to consider each problem independently, as separate optimization leads to an overall suboptimal solution. Rather, joint design of the quadtree structure and the leaf codebooks must be considered for overall optimality. The method we suggest is a “quadtree” constrained version of the entropy-constrained vector quantization design method. To this end, a centroid condition for the leaf codebooks is derived that represents a necessary optimality condition for variable-rate quadtree coding. This condition, when iterated with the optimal quadtree segmentation strategy of Sullivan and Baker results in a monotonically descending rate-distortion cost function, and consequently, an (at least locally) optimal quadtree solution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. H. Samet, “The quadtree and related hierarchical data structures,” ACM Computing Surveys, Vol. 16, pp. 188–260, June 1984.

    Article  MathSciNet  Google Scholar 

  2. P. Strobach, “Quadtree-structured recursive plane decomposition coding of images,” IEEE Trans. on Signal Processing, Vol. 39, pp. 1380–1397, June 1991.

    Article  Google Scholar 

  3. J. Vaisey and A. Gersho, “Image compression with variable block size segmentation,” IEEE Trans. on Signal Processing, Vol. 40, pp. 2040–2060, Aug. 1992.

    Article  Google Scholar 

  4. L. Berger, J.P. Mariot, and C. Launay, “A new formulation for fast image coding using quadtree representation,” Pattern Recognition Letters, Vol. 13, pp. 425–432, June 1992.

    Article  Google Scholar 

  5. E. Shusterman and M. Feder, “Image compression via improved quadtree decomposition algorithms,” IEEE Trans. on Image Processing, Vol. 3, pp. 207–215, March 1994.

    Article  Google Scholar 

  6. G.J. Sullivan and R.L. Baker, “Efficient quadtree coding of images and video,” IEEE Trans. on Image Processing, Vol. 3, pp. 327–331, May 1994.

    Article  Google Scholar 

  7. P.A. Chou, T. Lookabaugh, and R.M. Gray, “Optimal pruning with application to tree-structured source coding and modeling,” IEEE Trans. on Information Theory, pp. 299–315, March 1989.

  8. M. Lightstone, D. Miller, and S.K. Mitra, “Entropy-constrained product code vector quantization with application to image coding,” in Proc. of the First IEEE Int. Conf. on Image Processing, Austin, Texas, Nov. 1994, Vol. I, pp. 623–627.

    Article  Google Scholar 

  9. M. Lightstone, K. Rose, and S.K. Mitra, “Locally optimal codebook design for quadtree-based vector quantization,” in Proc. of the Int. Conf. on Acoust. Speech and Sig. Proc., Detroit, Michigan, 1995, pp. 2479–2482.

  10. P.A. Chou, T. Lookabaugh, and R.M. Gray, “Entropy-constrained vector quantization,” IEEE Trans. Acoust., Speech, and Signal Processing, Vol. 37, pp. 31–42, Jan. 1989.

    Article  MathSciNet  Google Scholar 

  11. H. Everett III, “Generalized Lagrange multiplier method for solving problems of optimum allocation of resources,” Operations Research, Vol. 11, pp. 399–417, 1963.

    Article  MathSciNet  MATH  Google Scholar 

  12. Y. Shoham and A. Gersho, “Efficient bit allocation for an arbitrary set of quantizers,” IEEE Trans. Acoust., Speech, and Signal Processing, Vol. 36, pp. 1445–1453, Sept. 1988.

    Article  MATH  Google Scholar 

  13. A. Gersho and R.M. Gray, Vector Quantization and Signal Compression, Kluwer Academic Publishers, Boston, 1992.

    Book  MATH  Google Scholar 

  14. Y. Linde, A. Buzo, and R.M. Gray, “An algorithm for vector quantizer design,” IEEE Trans. on Communications, Vol. 28, pp. 84–95, Jan. 1980.

    Article  Google Scholar 

  15. M. Lightstone and S.K. Mitra, “Entropy-constrained, mean-gain-shape vector quantization for image compression,” in Proc. of the SPIE Symposium on Visual Comm. and Image Proc., Chicago, Illinois, Sept. 1994, Vol. 2308, pp. 389–400.

    Article  Google Scholar 

  16. M. Lightstone and S.K. Mitra, “Optimal variable-rate mean-gain-shape vector quantization for image coding,” IEEE Trans. on Circuits and Systems for Video Technology, Vol. 6, pp. 660– 668, Dec. 1996.

    Article  Google Scholar 

  17. S.N. Efstratiadis and A.K. Katsaggelos, “Motion compensated recursive filtering of noisy displacement fields,” in Proc. of the European Conf. on Signal Processing (EUSIPCO), Brussels, Belgium, Aug. 1992, Vol. 3, pp. 1315–18.

    Google Scholar 

  18. R.E.H. Franich, R.L. Legendijk, and J. Biemond, “A genetic algorithm for smooth vector field estimation,” in Proc. of the Fourteenth Symposium on Information Theory, Benelux, Netherlands, May 1993, pp. 192–197.

    Google Scholar 

  19. G.J. Sullivan and R.L. Baker, “Rate-distortion optimized motion compensation for video compression using fixed or variable size blocks,” in IEEE Global Telecomm. Conf. (GLOBECOM), Vol. 3, pp. 85–90, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lightstone, M., Mitra, S.K. Quadtree Optimization for Image and Video Coding. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 17, 215–224 (1997). https://doi.org/10.1023/A:1007959007434

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1007959007434

Keywords

Navigation