Skip to main content

Lossy Compression Algorithms

  • Chapter
  • First Online:
  • 102k Accesses

Part of the book series: Texts in Computer Science ((TCS))

Abstract

In this chapter we examine compression algorithms such that recovered input data cannot be exactly reconstructed from compressed version. This termed “loss”. What we have, then, is a tradeoff between efficient compression versus a less accurate version of the input data. This tradeoff is captured in the Rate-Distortion Theory. Most of the loss occurs in quantization, and we introduce both Uniform and Nonuniform Scalar Quantization, and then Vector Quantization. Transform Coding, especially the Discrete Cosine Transform (DCT), is the main step in JPEG compression. We study DCT in great length and provide several examples. A newer version, JPEG2000, is supported by Wavelet-Based Coding so we introduce this method here and go on to study Wavelet Packets, the Embedded Zerotree of Wavelet Coefficients, and SPIHT.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. K. Sayood, Introduction to Data Compression, 4th edn. (Morgan Kaufmann, San Francisco, 2012)

    Google Scholar 

  2. H. Stark, J.W. Woods, Probability and Random Processes with Application to Signal Processing, 3rd edn. (Prentice Hall, Upper Saddle River, 2002)

    Google Scholar 

  3. A. György. On the theoretical limits of lossy source coding, 1998. Tudományos Diákkör (TDK) Conf. (Hungarian Scientific Student’s Conf.) at Technical University of Budapest

    Google Scholar 

  4. S. Arimoto, An algorithm for calculating the capacity of an arbitrary discrete memoryless channel. IEEE Trans. Inform. Theory 18, 14–20 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Blahut, Computation of channel capacity and rate-distortion functions. IEEE Trans. Inform. Theory 18, 460–473 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  6. A. Gersho, R.M. Gray, Vector Quantization and Signal Compression. (Springer, Boston, 1991)

    Google Scholar 

  7. A.K. Jain, Fundamentals of Digital Image Processing (Prentice-Hall, Englewood Cliffs, 1988)

    Google Scholar 

  8. K.R. Rao, P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications (Academic Press, Boston, 1990)

    MATH  Google Scholar 

  9. J.F. Blinn, What’s the deal with the DCT? IEEE Comput. Graphics Appl. 13(4), 78–83 (1993)

    Article  Google Scholar 

  10. S. Mallat, A Wavelet Tour of Signal Processing, 3rd edn. (Academic Press, San Diego, 2008)

    Google Scholar 

  11. S. Mallat, A theory for multiresolution signal decomposition: the wavelet representation. IEEE Trans. Pattern Anal. Mach. Intell. 11, 674–693 (1989)

    Article  MATH  Google Scholar 

  12. R.C. Gonzalez, R.E. Woods, Digital Image Processing, 3rd edn. (Prentice-Hall, Upper Saddle River, 2007)

    Google Scholar 

  13. B.E. Usevitch, A tutorial on modern lossy wavelet image compression: foundations of JPEG 2000. IEEE Signal Process. Mag. 18(5), 22–35 (2001)

    Article  Google Scholar 

  14. R. Coifman, Y. Meyer, S. Quake, V. Wickerhauser, Signal Processing and Compression with Wavelet packets. (Yale University, Numerical Algorithms Research Group, 1990)

    Google Scholar 

  15. K. Ramachandran, M. Vetterli, Best wavelet packet basis in a rate-distortion sense. IEEE Trans. Image Processing 2, 160–173 (1993)

    Article  Google Scholar 

  16. J. Shapiro, Embedded image coding using zerotrees of wavelet coefficients. IEEE Trans. Signal Processing, 41(12), 3445–3462 (1993)

    Google Scholar 

  17. A. Said, W.A. Pearlman, A new, fast, and efficient image codec based on set partitioning in hierarchical trees. IEEE Trans. CSVT 6(3), 243–249 (1996)

    Google Scholar 

  18. D. Taubman, High performance scalable image compression with EBCOT. IEEE Trans. Image Processing 9(7), 1158–1170 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ze-Nian Li .

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Li, ZN., Drew, M.S., Liu, J. (2014). Lossy Compression Algorithms. In: Fundamentals of Multimedia. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-05290-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-05290-8_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-05289-2

  • Online ISBN: 978-3-319-05290-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics