Scribd
Upload
61 views

Digital Image Procesing: Discrete Cosinetrasform (DCT) in Image Processing

The document discusses the discrete cosine transform (DCT) and its applications in image processing and compression. [1] DCT transforms a signal or image into a combination of cosine functions oscillating at different frequencies. [2] It has excellent energy compaction properties, meaning most of the signal information can be represented by just a few low-frequency DCT coefficients. [3] This property allows the DCT to be used for lossy image compression by discarding high-frequency coefficients.

Uploaded by

Barath Kandappan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
61 views

Digital Image Procesing: Discrete Cosinetrasform (DCT) in Image Processing

The document discusses the discrete cosine transform (DCT) and its applications in image processing and compression. [1] DCT transforms a signal or image into a combination of cosine functions oscillating at different frequencies. [2] It has excellent energy compaction properties, meaning most of the signal information can be represented by just a few low-frequency DCT coefficients. [3] This property allows the DCT to be used for lossy image compression by discarding high-frequency coefficients.

Uploaded by

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

Digital Image Procesing

Discrete CosineTrasform (DCT) in Image Processing

DR TANIA STATHAKI
READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING
IMPERIAL COLLEGE LONDON
1-D Discrete Cosine Transform

N 1
 (2 x  1)u 
C (u )  a(u )  f ( x) cos
x 0  2 N 
u  0,1,, N  1
 1
 u0
 N
a (u )  
 2
 u  1,, N  1
N
1-D Inverse Discrete Cosine Transform (IDCT)

N 1
 (2 x  1)u 
f ( x)   a(u )C (u ) cos
u 0  2 N 
1-D Basis Functions N=8
u=0 u=1 u=2 u=3
1.0 1.0 1.0 1.0

0.5 0.5 0.5 0.5

0 0 0 0

-0.5 -0.5 -0.5 -0.5

-1.0 -1.0 -1.0 -1.0

u=4 u=5 u=6 u=7


1.0 1.0 1.0 1.0

0.5 0.5 0.5 0.5

0 0 0 0

-0.5 -0.5 -0.5 -0.5

-1.0 -1.0 -1.0 -1.0


1-D Basis Functions N=16
Example: 1D signal
2-D Discrete Cosine Transform (IDCT)

N 1N 1
 (2 x  1)u   (2 y  1)v 
C (u, v)  a(u )a(v)   f ( x, y ) cos cos
x 0 y 0 
 2N 
  2 N 

N 1N 1
 (2 x  1)u   (2 y  1)v 
f ( x, y )    a(u )a(v)C (u, v) cos cos
u 0 v 0 
 2N 
  2 N 

u, v  0,1,, N  1
Advantages of the Discrete Cosine Transform

• Notice that the DCT is a real transform.

• The DCT has excellent energy compaction


properties.

• There are fast algorithms to compute the DCT


similar to the FFT.
2-D Basis Functions N=4
v
0 1 2 3

3
2-D Basis Functions N=8
Separability of DCT
Example: 2D signal
Example: 8x8 Block DCT
Example: Energy Compaction
Experiment
Experiment that demonstrates the superiority of DCT in terms of energy compaction
Relation between DCT and DFT

Define

g ( x )  f ( x )  f (2 N  1  x )
 f ( x ), 0  x  N 1

 f ( 2 N  1  x ), N  x  2 N  1

N  point 2 N  point DFT 2 N  point N  point


f ( x)  g ( x)  G (u )  C f (u )
Relation between DCT and DFT
Using DCT for Image Compression

You might also like