Abstract:
Our thesis is that high compression efficiency for text and images can be obtained by using sophisticated statistical compression techniques, and that greatly increased speed can be achieved at only a small cost in compression efficiency. Our emphasis is on elegant design and mathematical as well as empirical analysis. We analyze arithmetic coding as it is commonly implemented and show rigorously that almost no compression is lost in the implementation. We show that high-efficiency lossless compression of both text and grayscale images can be obtained by using appropriate models in conjunction with arithmetic coding. We introduce a four-component paradigm for lossless image compression and present two methods that give state of the art compression efficiency. In the text compression area, we give a small improvement on the preferred method in the literature. We show that we can often obtain significantly improved throughput at the cost of slightly reduced compression. The extra speed c...
Citations
|
3170
|
The mathematical theory of communication
– Shannon
- 1962
|
|
799
|
A universal algorithm for sequential data compression
– Ziv, Lempel
- 1977
|
|
515
|
Compression of individual sequences via variable-rate coding
– Ziv, Lempel
- 1978
|
|
288
|
A universal prior for integers and estimation by minimum description length. Annals of Statistics
– Rissanen
- 1983
|
|
202
|
Universal coding, information, prediction, and estimation
– Rissanen
- 1984
|
|
151
|
Arithmetic coding
– Langdon
- 1979
|
|
93
|
Universal modeling and coding
– Rissanen, Langdon
- 1981
|
|
78
|
An Overview of the Basic Principles of the Q-Coder Adaptive Binary Arithmetic
– Pennebaker, Mitchell
- 1988
|
|
72
|
Generalized Kraft Inequality and Arithmetic Coding
– Rissanen
- 1976
|
|
65
|
The design and analysis of dynamic huffman codes
– Vitter
- 1987
|
|
49
|
Some practical universal noiseless coding techniques
– Rice
- 1979
|
|
47
|
and J.O.Limb, \Picture coding: A review
– Netravali
- 1980
|
|
41
|
Source Coding Algorithm for Fast Data Compression
– Pasco
- 1976
|
|
33
|
Progressive image transmission: a review and comparison of techniques
– Tzou
- 1987
|
|
25
|
Probability estimation for the Q-coder
– Pennebaker, Mitchell
- 1988
|
|
24
|
Arithmetic stream coding using fixed precision registers
– Rubin
- 1979
|
|
23
|
The zero frequency problem: Estimating the probabilities of novel events in adaptive text compression
– Witten, Bell
- 1991
|
|
20
|
Reversible Intraframe Compression of Medical Images
– Roos, Viergever, et al.
- 1988
|
|
16
|
Software Implementations of the Q-coder
– Mitchell, Pennebaker
- 1988
|
|
13
|
Predictive quantizing differential pulse code modulation for the transmission of television signals
– O'Neal
- 1966
|
|
12
|
Modeling by Shortest Data Description," Automatica 14
– Rissanen
- 1978
|
|
11
|
Dynamic Huffman coding
– Vitter
- 1989
|
|
10
|
Arithmetic Coding For Data
– Witten, Neal, et al.
- 1987
|
|
7
|
Data Compression by Means of a Book Stack
– Ryabko
- 1980
|
|
4
|
A Very High Speed Lossless Compression/Decompression Chip Set
– Venbrux, Liu
|
|
4
|
On the Optimality of Code Options for a Universal Noiseless Coder
– Yeh, Rice, et al.
- 1991
|
|
2
|
System for Lossless Digital Image Compression
– Torbey, Meadows
|
|
1
|
Mohiuddin, "A Multiplication-Free Multialphabet Arithmetic Code
– Rissanen, M
- 1989
|
|
1
|
Two-Dimensional Encoding by Finite State Encoders
– Sheinwald, Lempel, et al.
- 1990
|
|
1
|
On Encoding of Commas Between Strings
– Stone
- 1979
|
|
1
|
Almost Asymptotically Optimal Flag Encoding of the Integers
– Wang
- 1988
|