Professional Documents
Culture Documents
WINSEM2022-23 CSE4019 ETH VL2022230503082 2023-03-09 Reference-Material-I
WINSEM2022-23 CSE4019 ETH VL2022230503082 2023-03-09 Reference-Material-I
4.1 INTRODUCTION
(IFT)
where
Why is FT Useful?
• Easier to remove undesirable frequencies.
• Inverse FT
Discrete Fourier Transform (DFT) (cont’d)
• Forward DFT
• Inverse DFT
Extending DFT to 2D
• Assume that f(x,y) is M x N.
• Forward DFT
• Inverse DFT:
Extending DFT to 2D (cont’d)
• Special case: f(x,y) is N x N.
• Forward DFT
|F(u,v)| |D(u,v)|
2 N 1
(2i 1)k
1-D DCT: X (k ) C (k ) x(i) cos[ ]
N i 0 2 N
N 1
(2i 1)k
C (k ) X (k ) cos[
1-D IDCT: 2
x(i ) ]
N k 0
2N
k = 0, 1, 2, …, N-1.
and i = 0, 1, 2, …, N-1.
Implementation of the DCT
• DCT-based codecs use a two-dimensional version of the
transform.
• The 2-D DCT and its inverse (IDCT) of an N x N block are shown
below:
2 N 1 N 1
(2 x 1)u (2 y 1)v
2-D DCT: F (u , v) C (u )C (v) f ( x, y ) cos[ ] cos[ ]
N y 0 x 0 2N 2N
2 N 1 N 1
(2 x 1)u (2 y 1)v
2-D IDCT: f ( x, y )
N
C (u)C (v) F (u, v) cos[
v 0 u 0 2N
] cos[
2N
]