Compression of Pictures by Finite State Encoders

Dafna Sheinwald, Abraham Lempel and Jacob Ziv
Additional contact information
Dafna Sheinwald: IBM Scientific Center
Abraham Lempel: Dept. of Computer Science
Jacob Ziv: Dept. of Electrical Engineering

A chapter in Sequences, 1990, pp 326-347 from Springer

Abstract: 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.

Keywords: Compression Ratio; Ising Model; Binary Sequence; Compression Algorithm; Code Theorem (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_26

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_26

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().