JPEG2000 Standard for Image Compression -- Contents -- Preface -- 1 Introduction to Data Compression -- 1.1 Introduction -- 1.2 Why Compression? -- 1.2.1 Advantages of Data Compression -- 1.2.2 Disadvantages of Data Compression -- 1.3 Information Theory Concepts -- 1.3.1 Discrete Memoryless Model and Entropy -- 1.3.2 Noiseless Source Coding Theorem -- 1.3.3 Unique Decipherability -- 1.4 Classification of Compression algorithms -- 1.5 A Data Compression Model -- 1.6 Compression Performance -- 1.6.1 Compression Ratio and Bits per Sample -- 1.6.2 Quality Metrics -- 1.6.3 Coding Delay -- 1.6.4 Coding Complexity -- 1.7 Overview of Image Compression -- 1.8 Multimedia Data Compression Standards -- 1.8.1 Still Image Coding Standard -- 1.8.2 Video Coding Standards -- 1.8.3 Audio Coding Standard -- 1.8.4 Text Compression -- 1.9 Summary -- References -- 2 Source Coding Algorithms -- 2.1 Run-length Coding -- 2.2 Huffman Coding -- 2.2.1 Limitations of Huffman Coding -- 2.2.2 Modified Huffman Coding -- 2.3 Arithmetic Coding -- 2.3.1 Encoding Algorithm -- 2.3.2 Decoding Algorithm -- 2.4 Binary Arithmetic Coding -- 2.4.1 Implementation with Integer Mathematics -- 2.4.2 The QM-Coder -- 2.5 Ziv-Lempel Coding -- 2.5.1 The LZ77 Algorithm -- 2.5.2 The LZ78 Algorithm -- 2.5.3 The LZW Algorithm -- 2.6 Summary -- References -- 3 JPEG: Still Image Compression Standard -- 3.1 Introduction -- 3.2 The JPEG Lossless Coding Algorithm -- 3.3 Baseline JPEG Compression -- 3.3.1 Color Space Conversion -- 3.3.2 Source Image Data Arrangement -- 3.3.3 The Baseline Compression Algorithm -- 3.3.4 Discrete Cosine Transform -- 3.3.5 Coding the DCT Coefficients -- 3.3.6 Decompression Process in Baseline JPEG -- 3.4 Progressive DCT-based Mode -- 3.5 Hierarchical Mode -- 3.6 Summary -- References -- 4 Introduction to Discrete Wavelet Transform -- 4.1 Introduction -- 4.2 Wavelet Transforms.

4.2.1 Discrete Wavelet Transforms -- 4.2.2 Concept of Multiresolution Analysis -- 4.2.3 Implementation by Filters and the Pyramid Algorithm -- 4.3 Extension to Two-Dimensional Signals -- 4.4 Lifting Implementation of the Discrete Wavelet Transform -- 4.4.1 Finite Impulse Response Filter and Z-transform -- 4.4.2 Euclidean Algorithm for Laurent Polynomials -- 4.4.3 Perfect Reconstruction and Polyphase Representation of Filters -- 4.4.4 Lifting -- 4.4.5 Data Dependency Diagram for Lifting Computation -- 4.5 Why Do We Care About Lifting? -- 4.6 Summary -- References -- 5 VLSI Architectures for Discrete Wavelet Transforms -- 5.1 Introduction -- 5.2 A VLSI Architecture for the Convolution Approach -- 5.2.1 Mapping the DWT in a Semi-Systolic Architecture -- 5.2.2 Mapping the Inverse DWT in a Semi-Systolic Architecture -- 5.2.3 Unified Architecture for DWT and Inverse DWT -- 5.3 VLSI Architectures for Lifting-based DWT -- 5.3.1 Mapping the Data Dependency Diagram in Pipeline Architectures -- 5.3.2 Enhanced Pipeline Architecture by Folding -- 5.3.3 Flipping Architecture -- 5.3.4 A Register Allocation Scheme for Lifting -- 5.3.5 A Recursive Architecture for Lifting -- 5.3.6 A DSP-Type Architecture for Lifting -- 5.3.7 A Generalized and Highly Programmable Architecture for Lifting -- 5.3.8 A Generalized Two-Dimensional Architecture -- 5.4 Summary -- References -- 6 JPEG2000 Standard -- 6.1 Introduction -- 6.2 Why JPEG2000? -- 6.3 Parts of the JPEG2000 Standard -- 6.4 Overview of the JPEG2000 Part 1 Encoding System -- 6.5 Image Preprocessing -- 6.5.1 Tiling -- 6.5.2 DC Level Shifting -- 6.5.3 Multicomponent Transformations -- 6.6 Compression -- 6.6.1 Discrete Wavelet Transformation -- 6.6.2 Quantization -- 6.6.3 Region of Interest Coding -- 6.6.4 Rate Control -- 6.6.5 Entropy Encoding -- 6.7 Tier-2 Coding and Bitstream Formation -- 6.8 Summary -- References.

7 Coding Algorithms in JPEG2000 -- 7.1 Introduction -- 7.2 Partitioning Data for Coding -- 7.3 Tier-1 Coding in JPEG2000 -- 7.3.1 Fractional Bit-Plane Coding -- 7.3.2 Examples of BPC Encoder -- 7.3.3 Binary Arithmetic Coding-MQ-Coder -- 7.4 Tier-2 Coding in JPEG2000 -- 7.4.1 Basic Tag Tree Coding -- 7.4.2 Bitstream Formation -- 7.4.3 Packet Header Information Coding -- 7.5 Summary -- References -- 8 Code-Stream Organization and File Format -- 8.1 Introduction -- 8.2 Syntax and Code-Stream Rules -- 8.2.1 Basic Rules -- 8.2.2 Markers and Marker Segments Definitions -- 8.2.3 Headers Definition -- 8.3 File Format for JPEG2000 Part 1: JP2 format -- 8.3.1 File Format Organization -- 8.3.2 JP2 Required Boxes -- 8.4 Example -- 8.5 Summary -- References -- 9 VLSI Architectures for JPEG2000 -- 9.1 Introduction -- 9.2 A JPEG2000 Architecture for VLSI Implementation -- 9.3 VLSI Architectures for EBCOT -- 9.3.1 Combinational Logic Blocks -- 9.3.2 Functionality of the Registers -- 9.3.3 Control Mechanism for the EBCOT Architecture -- 9.4 VLSI Architecture for Binary Arithmetic Coding: MQ-Coder -- 9.5 Decoder Architecture for JPEG2000 -- 9.6 Summary of Other Architectures for JPEG2000 -- 9.6.1 Pass-Parallel Architecture for EBCOT -- 9.6.2 Memory-Saving Architecture for EBCOT -- 9.6.3 Computationally Efficient EBCOT Architecture by Skipping -- 9.7 Summary -- References -- 10 Beyond Part 1 of JPEG2000 Standard -- 10.1 Introduction -- 10.2 Part 2: Extensions -- 10.2.1 Variable DC Offset -- 10.2.2 Variable Scalar Quantization Offsets -- 10.2.3 Trellis-Coded Quantization -- 10.2.4 Visual Masking -- 10.2.5 Arbitrary Wavelet Decomposition -- 10.2.6 Arbitrary Wavelet Transformation -- 10.2.7 Single Sample Overlap Discrete Wavelet Transformation 257 -- 10.2.8 Multiple Component Transforms -- 10.2.9 Nonlinear Transformations -- 10.2.10 Region of Interest Extension.

10.2.11 File Format Extension and Metadata Definitions -- 10.3 Part 3: Motion JPEG2000 -- 10.4 Part 4: Conformance Testing -- 10.5 Part 5: Reference Software -- 10.6 Part 6: Compound Image File Format -- 10.7 Other Parts (7-12) -- 10.8 Summary -- References -- Index -- About the Authors.