Abstract:
Adaptive context modeling has emerged as one of the most promising new approaches to compressing text. A finite-context model is a probabilistic model that uses the context in which input symbols occur (generally a few preceding characters) to determine the number of bits used to code these symbols. We provide an introduction to context modeling and recent research results that incorporate the concept of context modeling into practical data compression algorithms. 1. Introduction One of the more important developments in the study of data compression is the modern paradigm first presented by Rissanen and Langdon [RL81]. This paradigm divides the process of compression into two separate components: modeling and coding. A model is a representation of the source that generates the data being compressed. Modeling is the process of constructing this representation. Coding entails mapping the modeler's representation of the source into a compressed representation. The coding component tak...
Citations
|
613
|
A method for the construction of minimum-redundancy codes
– Huffman
- 1952
|
|
517
|
Arithmetic coding for data compression
– Witten, Neal, et al.
- 1987
|
|
136
|
Data Compression: Methods and Theory
– Storer
- 1988
|
|
111
|
A locally adaptive data compression scheme
– Bentley, Sleator, et al.
- 1986
|
|
93
|
Universal modeling and coding
– Rissanen, Langdon
- 1981
|
|
61
|
R.N.Horspool, `Data Compression Using Dynamic Markov Modeling
– Cormack
- 1987
|
|
55
|
Data compression with finite windows
– Fiala, Greene
- 1989
|
|
36
|
Adaptive Data Compression
– Williams
- 1991
|
|
29
|
An Extremely Fast Ziv-Lempel Data Compression Algorithm,” Data Compression Conference
– Williams
- 1991
|
|
17
|
Rissanen: “A simple general binary source code
– Langdon, J
- 1982
|
|
17
|
Word-based text compression
– Moffat
- 1989
|
|
15
|
A note on the DMC data compression scheme
– Bell, Moffat
- 1989
|
|
10
|
A Double-adaptive File Compression Algorithm
– Langdon, Rissanen
- 1983
|
|
7
|
An adaptive dependency source model for data compression
– Abrahamson
- 1989
|
|
7
|
Streamlining Context Models for Data Compression
– Lelewer, Hirschberg
- 1991
|
|
5
|
A locally adaptive data compression scheme
– Horspool, Cormack
- 1987
|
|
5
|
Local Order Estimating Markovian Analysis for Noiseless Source Coding and Authorship Identification
– Roberts
- 1982
|
|
4
|
Dynamic Markov modelling -- a prediction technique
– Horspool, Cormack
- 1986
|
|
3
|
Dynamic-history predictive compression
– Williams
- 1988
|
|
1
|
Data Compression on Machines with Limited Memory
– Lelewer
- 1991
|