1. 1 Outline  Introduction to JEPG2000  Why another image compression technique  Features  Discrete Wavelet Transform  Wavelet transform  Wavelet implementation  5/3 lifting-based wavelet transform  Extension algorithm

2. 2 Why New Encoder? Low bit-rate compression Lossless and lossy compression in one encoder Large image support Transmission in noisy environments Non-natural image support Computer generated image Compound documents Medical Images

3. 3 Features of JPEG2000 (1) Very low bit-rate compression Very low bit-rate compression Lossy and lossless in one algorithm Lossy and lossless in one algorithm Progressive transmission Progressive transmission Quality, Resolution, Component Quality, Resolution, Component Error resilient Error resilient Large images Large images JPEG at 0.125 bpp (192:1) JPEG2000 at 0.125 bpp (192:1)

4. 4 Features of JPEG2000 (2) ROI: Region Of Interest ROI: Region Of Interest Random code-stream access and process Random code-stream access and process

5. 5 Encoder Structure Quantization Wavelet Transform Component Transform Bit Modeling Arithmetic Coding Data Ordering Bit Allocation (Rate Control)

6. 6 Wavelet Transform over an Image Input

7. 7 Wavelet Implementation Convolution Based: Convolution Based: Area and time consuming Area and time consuming Complicated Complicated Lifting Scheme: Lifting Scheme: Reduced memory required Reduced memory required Lower computational complexity Lower computational complexity

8. 8 Wavelet Transform in JPEG2000 5/3 Transform: reversible 5/3 Transform: reversible Integer to Integer transform Integer to Integer transform Can be used both for lossless or lossy coding Can be used both for lossless or lossy coding 9/7 Transform: nonreversible 9/7 Transform: nonreversible Real to Real transform Real to Real transform Can only be used for lossy coding Can only be used for lossy coding

9. 9 Proposed Architecture Data Path

10. 10 (5,3) Lifting Diagram Details approximate 1/2 1/4

11. 11 Extension Algorithm Applying the filter to the extremes of a stream Applying the filter to the extremes of a stream Simple yet area and time consuming Simple yet area and time consuming Proposed idea Proposed idea x0x0x0x0 x1x1x1x1 x2x2x2x2 x3x3x3x3 x4x4x4x4 x5x5x5x5 x6x6x6x6 x2x2x2x2 x1x1x1x1 x0x0x0x0 x1x1x1x1 x2x2x2x2 x3x3x3x3 x4x4x4x4 x5x5x5x5 x6x6x6x6 x5x5x5x5 x4x4x4x4