MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Lossless Compression for Text and Images (1995) [3 citations — 0 self]

by Alistair Moffat ,  Timothy C. Bell ,  Ian H. Witten
International Journal of High Speed Electronics and Systems
Add To MetaCart

Abstract:

Most data that is inherently discrete needs to be compressed in such a way that it can be recovered exactly, without any loss. Examples include text of all kinds, experimental results, and statistical databases. Other forms of data may need to be stored exactly, such as images---particularly bilevel ones, or ones arising in medical and remotesensing applications, or ones that may be required to be certified true for legal reasons. Moreover, during the process of lossy compression, many occasions for lossless compression of coefficients or other information arise. This paper surveys techniques for lossless compression. The process of compression can be broken down into modeling and coding. We provide an extensive discussion of coding techniques, and then introduce methods of modeling that are appropriate for text and images. Standard methods used in popular utilities (in the case of text) and international standards (in the case of images) are described. Keywords Text compression, ima...

Citations

3170 The mathematical theory of communication – Shannon - 1962
799 A universal algorithm for sequential data compression – Ziv, Lempel - 1977
613 A method for the construction of minimum-redundancy codes – Huffman - 1952
593 TC: Managing Gigabytes: compressing and indexing documents and images – IA, Moffat, et al. - 1999
517 Arithmetic coding for data compression – Witten, Neal, et al. - 1987
515 Compression of individual sequences via variable-rate coding – Ziv, Lempel - 1978
340 A block sorting lossless data compression algorithm – Burrows, Wheeler - 1994
332 A technique for high performance data compression – Welch - 1984
252 Data compression using adaptive coding and partial string matching – Cleary, Witten - 1984
229 Universal codeword sets and representation of the integers – Elias - 1975
221 Prediction and entropy of printed english – Shannon - 1951
166 Run-length encodings – Golomb - 1966
151 Arithmetic coding – Langdon - 1979
107 Arithmetic Coding Revisited – Moffat, Neal, et al. - 1995
93 Universal modeling and coding – Rissanen, Langdon - 1981
92 Implementing the PPM Data Compression Scheme – Moffat - 1990
83 Unbounded Length Contexts for PPM – Cleary, Teahan, et al. - 1995
83 Variations on a theme by Huffman – Gallager - 1978
81 Dynamic Huffman coding – Knuth - 1985
79 Data compression via textual substitution – Storer, Szymanski - 1982
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
68 Adding compression to a full-text retrieval system – Zobel, Moffat - 1995
63 Optimal source codes for geometrically distributed alphabets – Gallager, Voorhis - 1975
61 R.N.Horspool, `Data Compression Using Dynamic Markov Modeling – Cormack - 1987
55 Data compression with finite windows – Fiala, Greene - 1989
49 Some practical universal noiseless coding techniques – Rice - 1979
41 A convergent gambling estimate of the entropy of english – Cover, King - 1978
40 The design and analysis of efficient lossless data compression systems – Howard - 1993
32 A fast algorithm for optimal length-limited Huffman codes – Larmore, Hirschberg - 1990
31 Fast and efficient lossless image compression – Howard, Vitter - 1993
30 On the implementation of minimum redundancy prefix codes – Moffat, Turpin - 1997
30 On the construction of huffman trees – Leeuwen - 1976
29 An Extremely Fast Ziv-Lempel Data Compression Algorithm,” Data Compression Conference – Williams - 1991
28 Generating a canonical prefix encoding – Schwartz, Kallick - 1964
27 Efficient Decoding of Prefix Codes – Hirschberg, Lelewer - 1990
26 International digital facsimile coding standard – Hunter, Robinson - 1980
26 Application of Splay Trees to Data Compression – Jones - 1988
25 A note on the Ziv-Lempel model for compressing individual sequences – Langdon - 1983
25 Probability estimation for the Q-coder – Pennebaker, Mitchell - 1988
24 Bounds on the redundancy of Huffman codes – Capocelli, Giancarlo, et al. - 1986
23 Parameterised compression for sparse bitmaps – Moffat, Zobel - 1992
23 The zero frequency problem: Estimating the probabilities of novel events in adaptive text compression – Witten, Bell - 1991
22 Optimal computer search trees and variable length alphabetic codes – Hu, Tucker - 1971
22 In-place calculation of minimum-redundancy codes – Moffat, Katajainen - 1995
20 A Multiplication-Free Multialphabet Arithmetic Code – Rissanen, Mohiuddin - 1989
19 Practical implementations of arithmetic coding – Howard, Vitter - 1992
19 Computing a minimum weight klink path in graphs with the concave Monge property – Schieber - 1998
17 A comparison of enumerative and adaptive codes – Cleary, Witten - 1984
17 The effect of non-greedy parsing in Ziv-Lempel compression methods – Horspool - 1995