You are on page 1of 13

Outlines Introduction Discrete Fourier Transform Frequency Filtering

Frequency Domain Filtering

Digital Image Processing Laboratory

(2020-21)

Department of Electronics and Electrical Communication Engineering


Indian Institute of Technology Kharagpur, West Bengal, India

September 29, 2020

1/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering


Outlines Introduction Discrete Fourier Transform Frequency Filtering

Outlines

1 Outlines

2 Introduction

3 Discrete Fourier Transform

4 Frequency Filtering

2/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering


Outlines Introduction Discrete Fourier Transform Frequency Filtering

Introduction

Deal with images in


Spatial domain - Processing in pixel/spatial domain.
Frequency Domain - Processing in the transformed domain.

Input Image Spatial Filter Output Image

Forward Inverse
Frequency Filter
Transformation Transformation

Figure: Frequency domain filtering

3/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering


Outlines Introduction Discrete Fourier Transform Frequency Filtering

Frequency
Time series:
dA
In 1-D time series, frequency is related to dt
.
If rate of change of amplitude higher then frequency is also higher
Images:
dI
For images, spatial frequency is related to dx
.
For edges frequency is higher, smooth regions frequency is lower.

Figure: 1-D Time Signal Figure: An Image.

4/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering


Outlines Introduction Discrete Fourier Transform Frequency Filtering

Why Frequency Domain Processing?

It is computationally faster to perform 2D Fourier transforms and a filter


multiply than to perform a convolution in the image (spatial) domain.

Frequency domain has a established suit of processes and tools that can be
borrowed directly from signal processing in other domains.

Easy to remove periodic noise in images.

The parameters are easily manipulated.

Very useful in compression - few coefficients represent most of the information.

5/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering


Outlines Introduction Discrete Fourier Transform Frequency Filtering

Image Transforms
Forward Inverse
Input Image Filtering Filtered Image
Transformation Transformation

f(x,y) F(u,v) G(u,v) g(x,y)

Frequency Filter
H(u,v)

Figure: Frequency domain filtering

Convolution in spatial domain ↔ Multiplication in frequency domain.


G(u,v)= H(u,v).F(u,v)

6/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering


Outlines Introduction Discrete Fourier Transform Frequency Filtering

Image Transforms
Forward Inverse
Input Image Filtering Filtered Image
Transformation Transformation

f(x,y) F(u,v) G(u,v) g(x,y)

Frequency Filter
H(u,v)

Figure: Frequency domain filtering

Convolution in spatial domain ↔ Multiplication in frequency domain.


G(u,v)= H(u,v).F(u,v)

Standard Transforms - Kernel is image independent


Discrete Fourier Transform (DFT).
Discrete Cosine Transform (DCT).
Discrete Sine Transform (DST).
Discrete Hadamard Transform (DHT).
Image dependent Transforms - Kernel is image dependent
K-L Transform.
6/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering
Outlines Introduction Discrete Fourier Transform Frequency Filtering

Discrete Fourier Transform


1-D Continuous Fourier Transform
Z ∞
F (u) = f (x)e −j2πux dx (1)
−∞

2-D Continuous Discrete Fourier Transform


Z ∞ Z ∞
F (u, v ) = f (x, y )e −j2π(ux+vy ) dxdy (2)
−∞ −∞

7/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering


Outlines Introduction Discrete Fourier Transform Frequency Filtering

Discrete Fourier Transform


1-D Continuous Fourier Transform
Z ∞
F (u) = f (x)e −j2πux dx (1)
−∞

2-D Continuous Discrete Fourier Transform


Z ∞ Z ∞
F (u, v ) = f (x, y )e −j2π(ux+vy ) dxdy (2)
−∞ −∞

2-D Discrete Fourier Transform


N−1 N−1
1 XX 2π
F (u, v ) = f (x, y )e −j N (ux+vy ) (3)
N x=0 y =0

2-D Inverse Discrete Fourier Transform


N−1 N−1
1 XX 2π
f (x, y ) = F (u, v )e j N (ux+vy ) (4)
N u=0 v =0

For a 512 × 512 image → 5124 complex multiplications. Huge complexity!


7/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering
Outlines Introduction Discrete Fourier Transform Frequency Filtering

Separability Property
2-D Discrete Fourier Transform

N−1 N−1 N−1 N−1


1 XX 2π 1 X −j 2π ux √ 1 X 2π
F (u, v ) = f (x, y )e −j N (ux+vy ) = e N . N. √ f (x, y )e −j N vy
N x=0 y =0 N x=0 N y =0
N−1 N−1
1 X −j 2π ux √ 1 X 2π
= e N . N.F (x, v ) = √ F (x, v )e −j N ux = F (u, v )
N x=0 N x=0

8/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering


Outlines Introduction Discrete Fourier Transform Frequency Filtering

Separability Property
2-D Discrete Fourier Transform

N−1 N−1 N−1 N−1


1 XX 2π 1 X −j 2π ux √ 1 X 2π
F (u, v ) = f (x, y )e −j N (ux+vy ) = e N . N. √ f (x, y )e −j N vy
N x=0 y =0 N x=0 N y =0
N−1 N−1
1 X −j 2π ux √ 1 X 2π
= e N . N.F (x, v ) = √ F (x, v )e −j N ux = F (u, v )
N x=0 N x=0

0,0 N-1 0,0 N-1 0,0 N-1


y v v

Row Transformation Column Transformation


f(x,y) F(x,v) F(u,v)

N-1 N-1 N-1

x x u

Figure: Separability - 2-D Transform as combination of 1-D Transform

8/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering


Outlines Introduction Discrete Fourier Transform Frequency Filtering

Fast Fourier Transform

Faster implementation of DFT.

Exploiting Periodicity and Symmetry properties of DFT.


N−1 N−1
1 X 2π 1 X
F (u) = f (x)e −j N ux = f (x)WNux (5)
N x=0 N x=0

Figure: Butterfly structure.

Figure: 16 point FFT

10/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering


Outlines Introduction Discrete Fourier Transform Frequency Filtering

Fast Fourier Transform

For an N-Point FFT, computational complexity would by O(NlogN).


For an image we can have a computational complexity of O(N 2 logN).
For 512 × 512 image - 128 × 512 × 9 complex multiplications.
Similarly we have faster implementation of IDFT.

Implement 1-D FFT as an recursive function.

11/16 Digital Image Processing Laboratory (2020-21) Frequency Domain Filtering

You might also like