Scribd
Upload
152 views18 pages

N U X X F U A U C: 1-D Discrete Cosine Transform

1. The 1-D and 2-D discrete cosine transforms (DCT) are described through their mathematical formulas. The DCT transforms a signal from the spatial domain to the frequency domain. 2. The DCT has excellent energy compaction properties, meaning it concentrates signal energy in low-frequency components. It also has fast computation algorithms similar to the fast Fourier transform (FFT). 3. Examples of 1-D and 2-D basis functions and an image transformed using an 8x8 block DCT are shown, demonstrating the DCT's ability to concentrate image information into fewer coefficients.

Uploaded by

Sreenath Reddy
Copyright
© Attribution Non-Commercial (BY-NC)
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
152 views18 pages

N U X X F U A U C: 1-D Discrete Cosine Transform

1. The 1-D and 2-D discrete cosine transforms (DCT) are described through their mathematical formulas. The DCT transforms a signal from the spatial domain to the frequency domain. 2. The DCT has excellent energy compaction properties, meaning it concentrates signal energy in low-frequency components. It also has fast computation algorithms similar to the fast Fourier transform (FFT). 3. Examples of 1-D and 2-D basis functions and an image transformed using an 8x8 block DCT are shown, demonstrating the DCT's ability to concentrate image information into fewer coefficients.

Uploaded by

Sreenath Reddy
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 18

1-D DISCRETE COSINE TRANSFORM

DCT

+
=

=
1
0 2
) 1 2 (
cos ) ( ) ( ) (
N
x N
u x
x f u a u C
t
1 , , 1 , 0 = N u

=
=
=
1 , , 1
2
0
1
) (
N u
N
u
N
u a

1-D INVERSE DISCRETE COSINE TRANSFORM


IDCT

+
=

=
1
0 2
) 1 2 (
cos ) ( ) ( ) (
N
u N
u x
u C u a x f
t
1-D Basis Functions N=8
1.0
0.5
0
-0.5
-1.0
u=0
1.0
0.5
0
-0.5
-1.0
u=1
1.0
0.5
0
-0.5
-1.0
u=2
1.0
0.5
0
-0.5
-1.0
u=3
1.0
0.5
0
-0.5
-1.0
u=4
1.0
0.5
0
-0.5
-1.0
u=5
1.0
0.5
0
-0.5
-1.0
u=6
1.0
0.5
0
-0.5
-1.0
u=7
1-D Basis Functions N=16
Example: 1D signal
2-D DISCRETE COSINE TRANSFORM
DCT
(

=

=

= N
v y
N
u x
y x f v a u a v u C
N
x
N
y 2
) 1 2 (
cos
2
) 1 2 (
cos ) , ( ) ( ) ( ) , (
1
0
1
0
t t
(

=

=

= N
v y
N
u x
v u C v a u a y x f
N
u
N
v 2
) 1 2 (
cos
2
) 1 2 (
cos ) , ( ) ( ) ( ) , (
1
0
1
0
t t
1 , , 1 , 0 , = N v u
ADVANTAGES
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
0
1
2
3
0 1 2 3
u
v
2-D Basis Functions N=8
Separable
Example: 2D signal
8x8 Block DCT
Example: Energy Compaction
Relation between DCT and DFT
Define
) ( ) ( ) ( ) (
point point 2 DFT point 2 point
u C u G x g x f
N N N N
f

s s
s s
=
+ =
1 2 ), 1 2 (
1 0 ), (

) 1 2 ( ) ( ) (
N x N x N f
N x x f
x N f x f x g
From DFT to DCT (Cont.) From DFT to DCT (Cont.)
DCT has a higher compression ration than DFT
- DCT avoids the generation of spurious spectral
components
Transform (DCT) Transform (DCT)

You might also like