Springer, 1992. — 355 p.
Data compression is the process of encoding a body of data to reduce storage requirements. With Lossless compression, data can be decompressed to be identical to the original, whereas with lossy compression, decompressed data may be an acceptable approximation (according to some fidelity criterion) to the original. For example, with digitized video, it may only be necessary that the decompressed video look as good as the original to the human eye.
Although complete compression systems often employ both loss less and lossy methods, the techniques used are typically quite different. The first part of this book addresses lossy image compression and the second part lossless text compression. The third part addresses techniques from coding theory, which are applicable to both lossless and lossy compression.
The chapters of this book were contributed by members of the program committee of the First Annual IEEE Data Compression Conference, which was held in Snowbird Utah, April, 1991.
Part 1 Image CompressionImage Compression and Tree-Structured Vector Quantization
Fractal Image Compression Using Iterated Transforms
Optical Techniques for Image Compression
Part 2 Text CompressionPractical Implementations of Arithmetic Coding
Context Modeling for Text Compression
Ziv-Lempel Compressors with Deferred-Innovation
Massively Parallel Systolic Algorithms for Real-Time Dictionary-Based Text Compression
Part 3 Coding TheoryVariations on a Theme by Gallager
On the Coding Delay of a General Coder
Finite State Two-Dimensional Compressibility