ImageProcessing7 FrequencyFiltering

Digital Image Processing
Image Enhancement:
Filtering in the Frequency Domain
Course Website: http://www.comp.dit.ie/bmacnamee

2
of
54
Contents
In this lecture we will look at image
enhancement in the frequency domain
– Jean Baptiste Joseph Fourier
– The Fourier series & the Fourier transform
– Image Processing in the frequency domain
• Image smoothing
• Image sharpening
– Fast Fourier Transform
3
of
54
Jean Baptiste Joseph Fourier
Fourier was born in Auxerre,
France in 1768
– Most famous for his work “La Théorie
Analitique de la Chaleur” published in
1822
– Translated into English in 1878: “The
Analytic Theory of Heat”
Nobody paid much attention when the work was
first published
One of the most important mathematical theories
in modern engineering
4
of
54
The Big Idea
Images taken from Gonzalez & Woods, Digital Image Processing (2002)
Any function that periodically repeats itself can be

expressed as a sum of sines and cosines of
different frequencies each multiplied by a different
coefficient – a Fourier series
5
of
54
The Big Idea (cont…)
Taken from www.tfh-berlin.de/~schwenk/hobby/fourier/Welcome.html
Notice how we get closer and closer to the

original function as we add more and more
frequencies
6
of
54
The Big Idea (cont…)
Frequency
domain signal
processing
example in Excel
7
of
54
The Discrete Fourier Transform (DFT)
The Discrete Fourier Transform of f(x, y), for x =

0, 1, 2…M-1 and y = 0,1,2…N-1, denoted by
F(u, v), is given by the equation:
M −1 N −1
F (u , v) = ∑∑ f ( x, y )e − j 2π ( ux / M +vy / N )
x =0 y =0
for u = 0, 1, 2…M-1 and v = 0, 1, 2…N-1.

8
of
54
DFT & Images
The DFT of a two dimensional image can be
visualised by showing the spectrum of the

images component frequencies
DFT
9
of
54
DFT & Images
of
54
10
DFT & Images
11
of
54
DFT & Images (cont…)
DFT
Scanning electron microscope Fourier spectrum of the image

image of an integrated circuit
magnified ~2500 times
of
54
12
of
54
13
14
of
54
The Inverse DFT
It is really important to note that the Fourier
transform is completely reversible
The inverse DFT is given by:
M −1N −1
1
f ( x, y ) =
MN
∑∑ F (u, v)e
u =0 v =0
j 2π ( ux / M +vy / N )
for x = 0, 1, 2…M-1 and y = 0, 1, 2…N-1

15
of
54
The DFT and Image Processing
To filter an image in the frequency domain:

1. Compute F(u,v) the DFT of the image

2. Multiply F(u,v) by a filter function H(u,v)
3. Compute the inverse DFT of the result
16
of
54
Some Basic Frequency Domain Filters
Low Pass Filter

High Pass Filter

of
54
17
of
54
18
19
of
54
Smoothing Frequency Domain Filters
Smoothing is achieved in the frequency domain

by dropping out the high frequency components
The basic model for filtering is:
G(u,v) = H(u,v)F(u,v)
where F(u,v) is the Fourier transform of the
image being filtered and H(u,v) is the filter
transform function
Low pass filters – only pass the low frequencies,
drop the high ones
20
of
54
Ideal Low Pass Filter
Simply cut off all high frequency components that
are a specified distance D0 from the origin of the

transform
changing the distance changes the behaviour of

the filter
21
of
54
Ideal Low Pass Filter (cont…)
The transfer function for the ideal low pass filter
can be given as:
1 if D (u , v) ≤ D0
H (u , v) = 
0 if D(u , v) > D0
where D(u,v) is given as:
D (u , v) = [(u − M / 2) 2 + (v − N / 2) 2 ]1/ 2
22
of
54
Above we show an image, it’s Fourier spectrum

and a series of ideal low pass filters of radius 5,
15, 30, 80 and 230 superimposed on top of it
of
54
23
of
54
24
25
of
54
Result of filtering
Original with ideal low pass
image filter of radius 5
Result of filtering Result of filtering

with ideal low pass with ideal low pass
filter of radius 15 filter of radius 30
Result of filtering
Result of filtering
with ideal low pass
with ideal low pass
filter of radius 230
filter of radius 80
26
of
54
Result of filtering
with ideal low pass
filter of radius 5
27
of
54
Result of filtering
with ideal low pass
filter of radius 15
28
of
54
Butterworth Lowpass Filters
The transfer function of a Butterworth lowpass
filter of order n with cutoff frequency at distance

D0 from the origin is defined as:
1
H (u , v) =
1 + [ D (u , v) / D0 ]2 n
29
of
54
Butterworth Lowpass Filter (cont…)
Result of filtering
Original with Butterworth filter
image of order 2 and cutoff
radius 5
Result of filtering with Result of filtering

Butterworth filter of with Butterworth
order 2 and cutoff filter of order 2 and
radius 15 cutoff radius 30
Result of filtering
Result of filtering with
with Butterworth filter
Butterworth filter of
of order 2 and cutoff
order 2 and cutoff
radius 230
radius 80
30
of
54
Original
image
Result of filtering
with Butterworth filter
of order 2 and cutoff
radius 5
31
of
54
Result of filtering with

Butterworth filter of
order 2 and cutoff
radius 15
32
of
54
Gaussian Lowpass Filters
The transfer function of a Gaussian lowpass
filter is defined as:

− D 2 ( u ,v ) / 2 D0 2
H (u , v) = e
33
of
54
Gaussian Lowpass Filters (cont…)
Result of filtering
Original with Gaussian filter
image with cutoff radius 5

with Gaussian with Gaussian filter
filter with cutoff with cutoff radius 30
radius 15

with Gaussian with Gaussian filter
filter with cutoff with cutoff radius
radius 85 230
34
of
54
Lowpass Filters Compared
Result of filtering
Result of filtering
with Butterworth
with ideal low pass
filter of order 2
filter of radius 15
and cutoff radius
15
Result of filtering
with Gaussian
filter with cutoff
radius 15
35
of
54
Lowpass Filtering Examples
A low pass Gaussian filter is used to connect
broken text
of
54
36
Lowpass Filtering Examples
37
of
54
Lowpass Filtering Examples (cont…)
Different lowpass Gaussian filters used to
remove blemishes in a photograph

of
54
38
39
of
54
Original Gaussian lowpass

image filter
Spectrum of Processed
original image image
40
of
54
Sharpening in the Frequency Domain
Edges and fine detail in images are associated

with high frequency components
High pass filters – only pass the high
frequencies, drop the low ones
High pass frequencies are precisely the reverse
of low pass filters, so:
Hhp(u, v) = 1 – Hlp(u, v)
41
of
54
Ideal High Pass Filters
The ideal high pass filter is given as:
0 if D(u , v) ≤ D0
H (u , v) = 
1 if D (u , v) > D0
where D0 is the cut off distance as before
42
of
54
Ideal High Pass Filters (cont…)
Results of ideal Results of ideal Results of ideal

high pass filtering high pass filtering high pass filtering
with D0 = 15 with D0 = 30 with D0 = 80
43
of
54
Butterworth High Pass Filters
The Butterworth high pass filter is given as:
1
H (u , v) =
1 + [ D0 / D (u , v)]2 n
where n is the order and D0 is the cut off
distance as before
44
of
54
Butterworth High Pass Filters (cont…)
Results of Results of
Butterworth Butterworth
high pass high pass
filtering of filtering of
order 2 with order 2 with
D0 = 15 D0 = 80
Results of Butterworth high pass

filtering of order 2 with D0 = 30
45
of
54
Gaussian High Pass Filters
The Gaussian high pass filter is given as:
− D 2 ( u ,v ) / 2 D0 2
H (u , v) = 1 − e
where D0 is the cut off distance as before
46
of
54
Gaussian High Pass Filters (cont…)
Results of Results of
Gaussian Gaussian
high pass high pass
filtering with filtering with
D0 = 15 D0 = 80
Results of Gaussian high pass

filtering with D0 = 30
47
of
54
Highpass Filter Comparison
Results of ideal
high pass filtering
with D0 = 15
48
of
54
Results of Butterworth
high pass filtering of order
2 with D0 = 15
49
of
54
Results of Gaussian
high pass filtering with
D0 = 15
50
of
54
Results of ideal Results of Butterworth Results of Gaussian

high pass filtering high pass filtering of order high pass filtering with
with D0 = 15 2 with D0 = 15 D0 = 15
51
of
54
Results of ideal
high pass filtering
with D0 = 15
52
of
54
Results of Butterworth
high pass filtering of order
2 with D0 = 15
53
of
54
Results of Gaussian
high pass filtering with
D0 = 15
of
54
High frequency 54
emphasis result Original image
equalisation Highpass filtering result

After histogram
Highpass Filtering Example
55
of
54
56
of
54
57
of
54
58
of
54
of
54
Inverse DFT of 59
Laplacian in the Laplacian in the
frequency domain frequency domain
domain
in the frequency
2-D image of Laplacian
spatial filter
left compared to
the image on the
Zoomed section of
Laplacian In The Frequency Domain
60
of
54
Frequency Domain Laplacian Example
Original Laplacian
image filtered
image
Laplacian
Enhanced
image scaled
image
61
of
54
Fast Fourier Transform
The reason that Fourier based techniques have
become so popular is the development of the
Fast Fourier Transform (FFT) algorithm
Allows the Fourier transform to be carried out in
a reasonable amount of time
Reduces the amount of time required to perform
a Fourier transform by a factor of 100 – 600
times!
62
of
Frequency Domain Filtering & Spatial
54 Domain Filtering
Similar jobs can be done in the spatial and
frequency domains
Filtering in the spatial domain can be easier to
understand
Filtering in the frequency domain can be much
faster – especially for large images
63
of
54
Summary
In this lecture we examined image
enhancement in the frequency domain
– The Fourier series & the Fourier transform
– Image Processing in the frequency domain
• Image smoothing
• Image sharpening
– Fast Fourier Transform
Next time we will begin to examine image
restoration using the spatial and frequency
based techniques we have been looking at
64
of
Imteresting Application Of Frequency
54 Domain Filtering
65
of
Imteresting Application Of Frequency
54 Domain Filtering
66
of
54
Questions?

ImageProcessing7 FrequencyFiltering

Încărcat de

Informații document

Descriere originală:

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

ImageProcessing7 FrequencyFiltering

Încărcat de

Drepturi de autor:

Formate disponibile

Digital Image Processing

Course Website: http://www.comp.dit.ie/bmacnamee

Any function that periodically repeats itself can be

Notice how we get closer and closer to the

The Discrete Fourier Transform of f(x, y), for x =

for u = 0, 1, 2…M-1 and v = 0, 1, 2…N-1.

visualised by showing the spectrum of the

Scanning electron microscope Fourier spectrum of the image

for x = 0, 1, 2…M-1 and y = 0, 1, 2…N-1

To filter an image in the frequency domain:

1. Compute F(u,v) the DFT of the image

Low Pass Filter

High Pass Filter

Smoothing is achieved in the frequency domain

are a specified distance D0 from the origin of the

changing the distance changes the behaviour of

Above we show an image, it’s Fourier spectrum

Result of filtering Result of filtering

filter of order n with cutoff frequency at distance

Result of filtering with Result of filtering

Result of filtering with

filter is defined as:

Result of filtering Result of filtering

Result of filtering Result of filtering

remove blemishes in a photograph

Original Gaussian lowpass

Edges and fine detail in images are associated

Results of ideal Results of ideal Results of ideal

Results of Butterworth high pass

Results of Gaussian high pass

Results of ideal Results of Butterworth Results of Gaussian

equalisation Highpass filtering result

S-ar putea să vă placă și