Lossless compression handbook
The 21 chapters in this handbook are written by the leading experts in the world on the theory, techniques, applications, and standards surrounding lossless compression. As with most applied technologies, the standards section is of particular importance to practicing design engineers. In order to...
| Otros Autores: | |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; Boston :
Academic Press
c2003.
|
| Edición: | 1st edition |
| Colección: | Academic Press series in communications, networking and multimedia.
|
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009627159206719 |
Tabla de Contenidos:
- Front Cover; Lossless Compression Handbook; Copyright Page; Contents; List of Contributors; Preface; Part I: Theory; Chapter 1. Information Theory behind Source Coding; 1.1 Introduction; 1.2 Sequences and Information Sources; 1.3 Variable-Length Codes for Memoryless Sources; 1.4 Variable-Length Codes for Sources with Memory; 1.5 Fixed-Length Codes for Memoryless Sources, the AEP; 1.6 References; Chapter 2. Complexity Measures; 2.1 Introduction; 2.2 Concerns with Shannon Information Theory; 2.3 Kolmogorov Complexity; 2.4 Computational Issues of Kolmogorov Complexity
- 2.5 Relation to Shannon Information Theory2.6 Historical Notes; 2.7 Further Reading; 2.8 References; Part II: Compression Techniques; Chapter 3. Universal Codes; 3.1 Compact Integer Representations; 3.2 Characteristics of Universal Codes; 3.3 Polynomial Representations; 3.4 Unary Codes; 3.5 Levenstein and Elias Gamma Codes; 3.6 Elias Omega and Even-Rodeh Codes; 3.7 Rice Codes; 3.8 Golomb Codes; 3.9 Start-Step-Stop Codes; 3.10 Fibonacci Codes; 3.11 Ternary Comma Codes; 3.12 Summation Codes; 3.13 Wheeler 1/2 Code and Run-Lengths; 3.14 Comparison of Representations; 3.15 Final Remarks
- 3.16 ReferencesChapter 4. Huffman Coding; 4.1 Introduction; 4.2 Huffman Codes; 4.3 Variations on a Theme; 4.4 Adaptive Huffman Coding; 4.5 Efficient Implementations; 4.6 Conclusion and Further Reading; 4.7 References; Chapter 5. Arithmetic Coding; 5.1 Introduction; 5.2 Basic Principles; 5.3 Implementation; 5.4 References; Chapter 6. Dictionary-Based Data Compression: An Algorithmic Perspective; 6.1 Introduction; 6.2 Dictionary Construction: Static versus Dynamic; 6.3 Extensions of Dictionary Methods for Compressing Biomolecular Sequences; 6.4 Data Structures in Dictionary Compression
- 6.5 Benchmark Programs and Standards6.6 References; Chapter 7. Burrows-Wheeler Compression; 7.1 Introduction; 7.2 The Burrows-Wheeler Algorithm; 7.3 The Burrows-Wheeler Transform; 7.4 Basic Implementations; 7.5 Relation to Other Compression Algorithms; 7.6 Improvements to Burrows-Wheeler Compression; 7.7 Preprocessing; 7.8 The Permutation; 7.9 Move-To-Front; 7.10 Statistical Compressor; 7.11 Eliminating Move-To-Front; 7.12 Using the Burrows-Wheeler Transform in File Synchronization; 7.13 Final Comments; 7.14 Recent Developments; 7.15 References; Chapter 8. Symbol-Ranking and ACB Compression
- 8.1 Introduction8.2 Symbol-Ranking Compression; 8.3 Buynovsky's ACB Compressor; 8.4 References; Part III: Applications; Chapter 9. Lossless Image Compression; 9.1 Introduction; 9.2 Preliminaries; 9.3 Prediction for Lossless Image Compression; 9.4 Hierarchical Lossless Image Coding; 9.5 Conclusions; 9.6 References; Chapter 10. Text Compression; 10.1 Introduction; 10.2 Information Theory Background; 10.3 Classification of Lossless Compression Algorithms; 10.4 Transform-Based Methods: Star (*) Transform and Length-Index Preserving Transform; 10.5 Three New Transforms-ILPT, NIT, and LIT
- 10.6 Conclusions
