Wavelet-based Coding

And its application in JPEG2000

Monia Ghobadi
CSC561 final project
monia@cs.uvic.ca
Introduction
 Signal decomposition
 Fourier Transform
 Frequency domain 
 Temporal domain  Time information?
What is wavelet transform?
 Wavelet transform decomposes a signal into a
set of basis functions (wavelets)
 Wavelets are obtained from a single
prototype wavelet Ψ(t) called mother wavelet
by dilations and shifting:
1 t b
 a ,b (t )  ( )
a a
 where a is the scaling parameter and b is the shifting
parameter
What are wavelets
 Wavelets are functions defined over a
finite interval and having an average
value of zero.

Haar wavelet
Haar Wavelet Transform
 Example: Haar Wavelet

0 1
0 1

Scaling
Function Wavelet

1 1 1 1
h ( n)  [ , ] g ( n)  [ , ]
2 2 2 2
Haar Wavelet Transform
1. Find the average of each pair of samples.
2. Find the difference between the average and the samples.
3. Fill the first half of the array with averages.
4. Normalize
5. Fill the second half of the array with differences.
6. Repeat the process on the first half of the array.

1. 1+3 / 2 = 2
Signal 1 3 5 7
2. 1 - 2 = -1
1. Iteration 3. Insert
2 6 -1 -1
4. Normalize
2. Iteration 4 -2 -1 -1 5. Insert
6. Repeat
 Haar Wavelet Transform
Signal 1
3
5
Signal
7
[1 3 5 7 ]

Signal recreated from 2 coefficients

2. Iteration 4
[2 2 6 6 ]
-2

-1

-1
Haar Basis

Lenna Haar Basis

2D Mexican Hat wavelet

Time domain Frequency domain

1 1
 ( x2  y2 )  ( w12  w 2 2 )
 ( x , y )  ( x  y  2) e
2 2 2
 ( w1, w2)  2 ( w1  w2 )e
2 2 2
 2D Mexican Hat wavelet (Movie)
low frequency  high frequency

<Time Domain Wavelet> <Fourier Domain Wavelet>

Scale = 38
Scale =2
Scale =1
Wavelet Transform

 Continuous Wavelet Transform (CWT)

 Discrete Wavelet Transform (DWT)
Continuous Wavelet
Transform
 continuous wavelet transform (CWT) of
1D signal is defined as
 Wa f  (b)   f ( x )  a ,b ( x ) dx
 the a,b is computed from the mother
wavelet by translation and dilation
1  x  b
 a ,b ( x )   
a  a 
 Discrete Wavelet Transform
 CWT cannot be directly applied to analyze
discrete signals
 Wa f  (b)   f ( x )  a ,b ( x ) dx
 CWT equation can be discretised by
restraining a and b to a discrete lattice
 transform should be non-redundant, complete
and constitute multiresolution representation
of the discrete signal
Discrete Wavelet Transform
 Discrete wavelets
j
 j ,k  a0 2 (a0j t  k ), j, k  Z .

 In reality, we often choose a0  2.

Discrete Wavelet Transform
In the discrete signal case we compute the
Discrete Wavelet Transform by successive low
pass and high pass filtering of the discrete
time-domain signal. This is called the Mallat
algorithm or Mallat-tree decomposition.
Pyramidal Wavelet
Decomposition

D11 D13
D11 D13
D11 D13
D12
D12
D12
 Wavelet Decomposition
The decomposition process can be iterated, with
successive approximations being decomposed in turn,
so that one signal is broken down into many lower-
resolution components. This is called the wavelet
decomposition tree.
Lenna Image

Source: http://sipi.usc.edu/database/
Lenna DWT
Lenna DWT DC Level Shifted +70
Restored Image
Can you tell which is the original and which is the
restored image after removal of the lower right?
 DWT for Image Compression
 Block Diagram
2D Discrete
Entropy
Wavelet Quantization
Coding
Transform

2D discrete wavelet transform (1D

10 10
DWT applied alternatively to vertical
20 20 and horizontal direction line by line )
30 30 converts images into “sub-bands”
40 40
Upper left is the DC coefficient
50 50
60 60
Lower right are higher frequency
20 40 60 20 40 60 sub-bands.
 DWT for Image Compression
 Image Decomposition LL1 HL1
 Scale 1
LH1 HH1

 4 subbands: LL1, HL1, LH1, HH1

 Each coeff.  a 2*2 area in the original image
 Low frequencies: 0     / 2
 / 2  

High frequencies:
 DWT for Image Compression
 Image
Decomposition LL2 HL2

HL1

LH2 HH2
 Scale 2 LL , HL , LH , HH
2 2 2 2
 4 subbands:
• Each coeff.  a 2*2 LH1 HH1

area in scale 1 image

• Low Frequency:
• High frequencies: 0     / 4
 / 4   / 2
DWT for Image Compression
 Image Decomposition LL3 HL3
 Parent LH3 HH3
HL2

HL1
 Children
Descendants:
LH2 HH2


corresponding coeff. at
finer scales
LH1
 Ancestors: corresponding HH1

coeff. at coarser scales

 DWT for Image Compression
 Image Decomposition
 Feature 1:
 Energy distribution similar to
other TC: Concentrated in low
frequencies
 Feature 2:
 Spatial self-similarity across
subbands
LL3 HL3
HL2
LH3 HH3
HL1
LH2 HH2

LH1 HH1
The scanning order of the subbands
for encoding the significance map.
JPEG2000
 JPEG2000 (J2K) is an emerging standard for
image compression
 Achieves state-of-the-art low bit rate compression
and has a rate distortion advantage over the
original JPEG.
 Allows to extract various sub-images from a single
compressed image codestream, the so called
“Compress Once, Decompress Many Ways ”.
 ISO/IEC JTC 29/WG1 Security Working Setup in
2002
JPEG 2000
 Not only better efficiency, but also more
functionality
 Superior low bit-rate performance
 Lossless and lossy compression
 Multiple resolution
 Range of interest(ROI)
JPEG2000
 Can be both lossless and lossy
 Improves image quality
 Uses a layered file structure :
 Progressive transmission
 Progressive rendering
 File structure flexibility:
 Could use for a variety of applications
 Many functionalities
?Why another standard
 Low bit-rate compression
 Lossless and lossy compression
 Large images
 Single decompression architecture
 Transmission in noisy environments
 Computer generated imaginary
Compress Once, Decompress “
”Many Ways
A Single Original
Codestream

By resolutions By layers Region of Interest

Components

 Each image is
decomposed into
one or more
components, such
as R, G, B.
 Denote
components as Ci,
i = 1, 2, …, nC.
JPEG2000 Encoder
Block Diagram
 Key Technologies:
 Discrete Wavelet Transform (DWT)
 Embedded Block Coding with Optimized
Truncation (EBCOT)
Rate Control

2-D Discrete EBCOT Tier-1 EBCOT

Wavelet Quantization Encoder Tier-2
Transform (CF + AE) Encoder

transform quantize coding

 Resolution & Resolution-
Increments

J2K uses 2-D Discrete Wavelet

Transformation (DWT)
1-level DWT
 Resolution and Resolution-
Increments

1-level DWT

2-level DWT
Discrete Wavelet Transform

LL2 HL2

LH2 HH2 HL1

LH1 HH1
Layers & Layer-Increments
L0 {L0, L1} {L0, L1, L2}

All layer-
increments
 JPEG2000
v.s. JPEG

low bit-rate performance

JPEG2K - Quality Scalability
Improve decoding quality as receiving 

:more bits
Spatial Scalability
Multi-resolution decoding from one bit- 

:stream
ROI (range of interest)