Advertisement

An Analysis of Context Selection in Embedded Wavelet Coders

  • Juan Miguel del Rosario
  • Czesław Jedrzejek
Conference paper
  • 574 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1424)

Abstract

In image compression using wavelet transforms the final stage of processing often involves entropy encoding, out of which arithmetic coding is most essential. A significant contributor to the effectiveness of the arithmetic encoding is the selection of coding contexts. We show for various context selection schemes, that the interbit correlations in the multi-symbol alphabet is a primary source of compression gain in the entropy coding of the image. Further, we analyze the use of more conventional context selection schemes and show that full image histograms contain information not yet available to the decoder in embedded algorithms. The use of predictors in the embedded algorithm can be quite ineffective.

Keywords

Mutual Information Image Compression Conditional Entropy Context Formation Arithmetic Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. W. Woods, S. D. O’Neil (1986) Subband coding of images, IEEE Trans. Acoust. Speech Signal Proc., ASSP-34, no. 5, pp. 1278–1288, October 1986.CrossRefGoogle Scholar
  2. 2.
    E. H. Adelson, E. P. Simoncelli, R. Hingorani (1987) Orthogonal pyramid transforms of image coding Proceedings of SPIE, vol. 845, pp. 50–58, Cambridge, MA, October 1987.Google Scholar
  3. 3.
    M. Vetterli (1984) Multidimensional subband coding: some theory and algorithms, Signal Processing, vol. 6, no. 2, pp. 97–112.CrossRefMathSciNetGoogle Scholar
  4. 4.
    J. M. Shapiro (1993) Embedded image coding using zerotrees of wavelets coefficients, IEEE Trans. Signal Proc., vol. 41, pp. 3445–3462, December 1993.zbMATHCrossRefGoogle Scholar
  5. 5.
    A. Said, W. A. Pearlman (1996) A new fast and efficient image codec based on set partitioning in hierarchical trees, IEEE Trans. Circuits and Systems for Video Technology, June 1996.Google Scholar
  6. 6.
    I. H. Whitten, R. M. Neal, J. G. Cleary (1987) Arithmetic Coding for Data Compression, Communications of the ACM, vol. 30, no. 6, pp. 520–540, June 1987.CrossRefGoogle Scholar
  7. 7.
    R. W. Buccigrossi, E. P. Simoncelli (1997) Image Compression via Joint Statistical Characterization in the Wavelet Domain, GRASP Laboratory Technical Report #414, University of Pennsylvania, May 1997.Google Scholar
  8. 8.
    D. Marpe, H. L. Cycon (1997) Efficient Pre-Coding techniques for Wavelet-Based Image Compression, Proceedings of the 1997 Picture Coding Symposium, pp. 45–50.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Juan Miguel del Rosario
    • 1
  • Czesław Jedrzejek
    • 2
    • 2
  1. 1.Institute of Telecommunications and Information TechnologiesPoznańPoland
  2. 2.Institute of TelecommunicationATR BydgoszczPoland

Personalised recommendations