Scribd
Upload
140 views10 pages

Discrete Wavelet Transform

The document discusses the discrete wavelet transform (DWT) and its use in image compression. The DWT decomposes an image into different frequency subbands using successive low-pass and high-pass filtering. This decomposition can be iterated, breaking the image down into lower resolution components arranged in a tree structure. For image compression, DWT decomposes an image into subbands like LL, LH, HL, HH at different scales, concentrating most of the signal energy in the lower frequencies.

Uploaded by

VigneshInfotech
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
140 views10 pages

Discrete Wavelet Transform

The document discusses the discrete wavelet transform (DWT) and its use in image compression. The DWT decomposes an image into different frequency subbands using successive low-pass and high-pass filtering. This decomposition can be iterated, breaking the image down into lower resolution components arranged in a tree structure. For image compression, DWT decomposes an image into subbands like LL, LH, HL, HH at different scales, concentrating most of the signal energy in the lower frequencies.

Uploaded by

VigneshInfotech
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 10

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
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.
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 HL2
LH3 HH3
 Children HL1

 Descendants: LH2 HH2

corresponding coeff. at
finer scales
Ancestors: corresponding
LH1 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.
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

You might also like