Skip to main content

Compression of Pictures by Finite State Encoders

  • Conference paper
Sequences

Abstract

Distortion-free compressibility of individual pictures by finite-state encoders is investigated. In a recent paper [2], the compressibility of a given picture I was defined and shown to be the asymptotically attainable lower bound on the compression ratio that can be achieved for I by any finite-state encoder. In this paper, a different and more direct approach is taken to prove similar results, which are summarized in a converse-to-coding-theorem and a constructive-coding-theorem that leads to a universal and asymptotically optimal compression algorithm.

While preparing this paper, the first author was at the Technion, Dept. of Computer Science.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Ziv and A. Lempel, “Compression of Individual Sequences via Variable-Rate-Coding”, IEEE Trans. Inform. Theory, Vol. IT-24, pp. 530–536, Sept. 1978.

    Google Scholar 

  2. A. Lempel and J. Ziv, “Compression of Two Dimensional Data”, IEEE Trans. Inform. Theory, Vol. IT-32, pp. 1–8, January 1986.

    Google Scholar 

  3. A. Lempel and J. Ziv, “On the Complexity of Finite Sequences”, IEEE Trans. Inform. Theory, Vol. IT-22, pp. 75–81, January 1976.

    Article  MathSciNet  MATH  Google Scholar 

  4. D.E. Knuth, The Art of Computer programming, Addison-Wesley, 1973.

    Google Scholar 

  5. P.Elias, “Universal Codeword Sets and Representations of the Integers”, IEEE Trans. Inform. Theory, Vol. IT-21, pp. 194–203, March 1975.

    Article  MathSciNet  MATH  Google Scholar 

  6. J. Rissanen, “A Universal Data Compression System”, IEEE Trans. Inform. Theory, Vol IT-29, pp. 656–664, Sept. 1983.

    Article  MathSciNet  MATH  Google Scholar 

  7. C. E. Shannon, “A Mathematical Theory of Communication”, Bell syst. J., Vol. 27, pp. 379–423, July 1948.

    MathSciNet  MATH  Google Scholar 

  8. R.G. Gallager, Information Theory and Reliable Communication, Wiley, 1968.

    Google Scholar 

  9. E. Antebi, Error Free Compression of Markov Pictures, Master’s Thesis, Feb. 87, Technion, Israel Institute of Technology.

    Google Scholar 

  10. D. Sheinwald, A. Lempel, and J. Ziv, “Compression of Pictures by Finite State Encoders”, Technical Report TR#497, Dept. of Computer Science, Technion, Haifa, Israel.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag New York Inc.

About this paper

Cite this paper

Sheinwald, D., Lempel, A., Ziv, J. (1990). Compression of Pictures by Finite State Encoders. In: Capocelli, R.M. (eds) Sequences. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3352-7_26

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-3352-7_26

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7977-8

  • Online ISBN: 978-1-4612-3352-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics