Chap 4 Image Enhancement in the

Frequency Domain
Background
Any periodic function can be expressed as the sum of
sines and cosines of different frequencies, each
multiplied by a different coefficient.
We called this sum a Fourier series.

Even function that are not periodic can be expressed
as the integral of sines and cosines multiplied by a
weighting function.
This formation is the Fourier transform.



Periodic Function
A function f is periodic with period P greater
than zero if
Af(x + P) = Af(x), where A denotes amplitude.





f(x) = sinx, P = 2, frequency=1/ 2, A=1.
f(x) = Asinnx, P = 2/n, frequency=n/ 2 .
n, frequency.

Fourier Series
Suppose f(x) is a function defined on the interval [-,]. The
Fourier series expansion of f(x) is


where an and bn are constants called the Fourier
coefficients, and

=
+ + =
1
0
) sin cos (
2
) (
n
n n
nx b nx a
a
x f
}
}

=
=
t
t
t
t
t
t
nxdx x f b
nxdx x f a
n
n
sin ) (
1
cos ) (
1
Coefficients of Any Period T = 2L
Replace v by x/L to obtain the Fourier series of the
function (x) of period 2L







Complex Fourier Series
Complex exponentials
According to Eulers formula

and so,
Using these two equations we can find the complex
exponential form of the trigonometric functions as

u
u u
j
e j = + sin cos
u u u u
u
sin cos ) sin( ) cos(
) (
j e j
j
= = +

j
e e
e e
j j
j j
2
sin
2
cos
u u
u u
u
u

=
+
=
.
2
where
2 2 2
) (
1
0
T
w
e
jb a
e
jb a a
t f
n
t jn
n n
t jn
n n
t
e e
=
|
|
.
|

\
|
)
`

+
+
)
`

+ =

Complex Fourier Series

( )

=

=

=
+ + =
+ + = + + =
+ + = + + =
=

=
+
=

=
n
t jn
n
n
t jn
n
n
t jn
n
n
t jn
n
n
t jn
n
n
t n j
n
n
t jn
n
n n
t jn
n
n
t jn
n
t jn
n
t jn
n
n
n n n n
n
n n
n
e c
e c c e c
e c e c c e c e c c
e c e c c e c e c c t f
c
jb a jb a
c
jb a
c
0
0 0
0 0 0 0
0 0 0 0



) (
.
2 2
,
2
Define
1
0
1
1 1
0
1
) (
1
0
1 1
*
1
0
*
0
*
e
e e
e e e e
e e e e
}
}

=
=

=
2 /
2 /
2 /
2 /
0 0
0
) (
1

) sin )(cos (
2
2
2
where
T
T
t jn
T
T
n n
n
dt e t f
T
dt t n j t n t f
T
jb a
c
e
e e
Continuous Spectra
Consider the following function:




Only a single pulse remains and the resulting function is
no longer periodic. A function which is not periodic can be
considered as a function with very large period.
Continuous Spectra
} }
} }

=

= =
(

=

dv e v f F d e F
d e dv e v f t f
T
v j t j
t j
v
v j
e e
e e
t
e e e
t
e
t t
) (
2
1
) ( where ) (
2
1

) (
2
1
2
1
) (
integral an become sum the , As
These two integrals form the conclusion of Fouriers
integral theorem.
Alternative Forms
Note that there are a number of alternative forms for
Fourier transform, such as






The third form is popular in the field of signal processing
and communications systems.

dt e t f u F du e u F t f
u
dt e t f F d e F t f
dt e t f F d e F t f
ut j ut j
t j t j
t j t j
t t
e e
e e
t e t
e e e
t
t
e e e
2 2
) ( ) ( where ) ( ) (
2 defining by l exponentia in the 2 the absorbing by or,
) ( ) ( where ) (
2
1
) (
) (
2
1
) ( where ) ( ) (

} }
} }
} }
= =
=
= =
= =
4.2 Fourier Transform in the
Frequency Domain
Fourier transform F(u) of f(x) is defined as

The inverse Fourier Transform is

DFT for Discrete function f(x), x=0,1,..M-1
for u=0,1,..M-1
Inverse DFT
}

= dx e x f u F
ux j t 2
) ( ) (
}

= du e u F x f
ux j t 2
) ( ) (

=
1
0
/ 2
) (
1
) (
M
x
M ux j
e x f
M
u F
t

=
=
1
0
/ 2
) ( ) (
M
u
M ux j
e u F x f
t
Eulers formula:


Each term of the Fourier transform is composed
of the sum of all values of the function f(x).
M
2
summations and multiplications
The values of f(x) are multiplied by sines and cosines
of various frequencies.
The domain (values of u) over which the values of
F(u) range is appropriately called the frequency
domain, because u determines the frequency of the
components of the transform.
Each of the M terms of F(u) is called a frequency
component of the transform.
1 ., 2,.. ,1, 0 for
] / 2 sin / 2 )[cos (
1
) (
1
0
=
=

=
M u
M ux j M ux x f
M
u F
M
x
t t
u u
u
sin cos j e
j
+ =
Complex Spectra
In general, the components of Fourier transform are complex
quantities in the following form:
F(u) = R(u) + jI(u)
and can be written as
F(u) = |F(u)|e
j|(u)
The spectra is usually represented by the amplitude of a specific
frequency
Amplitude or spectrum of Fourier transform
|F(u)| = (R
2
(u)+I
2
(u))
1/2





Complex Spectra
These complex coefficients couples
Amplitude spectrum value
Magnitude of each of the harmonic
components.
Phase spectrum value
The phase of each harmonic relative to the
fundamental harmonic frequency
0
.
The frequency spectrum is centered at 0. To visual easily, we
sometimes multiply f(x) by (-1)
x
before applying the
transform.
Why (-1)
x
?
)
2
( ) (
1

) (
1

) (
1

) ( ) 1 (
1
) ( ) sin (cos ) 1 (
1
0
/ )
2
( 2
1
0
/ 2
1
0
/ 2
1
0
/ 2
M
u F e x f
M
e x f
M
e x f e
M
e x f
M
e e j
M
x
M
M
u x j
M
x
M ux j x j
M
x
M ux j x j
M
x
M ux j x
x j x j x x
= =
=
=

= = + =

t
t t
t t
t
t t
t t
4.2.2 The Two-dimensional Discrete Fourier
Transform (DFT)
2D-DFT of f(x, y) of size MN


Inverse 2-D DFT

=
+
=
1
0
1
0
) / / ( 2
) , (
1
) , (
M
x
N
y
N vy M ux j
e y x f
MN
v u F
t

=
+
=
1
0
1
0
) / / ( 2
) , ( ) , (
M
u
N
v
N vy M ux j
e v u F y x f
t
Modulation in the space domain
F[(-1)
x+y
f(x, y)]= F(u-M/2,v-N/2)
Shift the origin of F(u,v) to frequency
coordinates (M/2, N/2),
the center of (u, v), u=0,M-1, v=0,N-1.
frequency rectangle
Average of f(x,y)


For real f(x,y)
F(u, v) = F*(-u, -v)
|F(u, v)| = |F(-u, -v)|
The spectrum of the Fourier transform is
symmetric.

=
=
1 M
0 x
1 N
0 y
y x f
MN
1
) 0 , 0 F( ) , (
Implementation
What is the frequency of an image?
Since frequency is directly related rate of
change, it is not difficult intuitively to associate
frequencies with pattern of intensity variations
in an image.
The low frequencies correspond to the slowly
varying components of an image.
The higher frequencies begin to correspond to
faster and faster gray level changes in the image.
such as edges.
F(0, 0): the average gray level of an image.
4.2.3 Filtering in the Frequency Domain
1) Multiply the input image by (-1)
x+y
to center
the transform.
2) Compute DFT F(u, v)
3) Multiply F(u,v) by a filter function H(u,v)
G(u,v) = F(u,v)H(u,v)
4) Computer the inverse DFT of G(u,v)
5) Obtain the real part of g(x,y)
6) Multiply g(x,y) with (-1)
x+y
Filtering steps:
Notch filter: H(u,v) = 0 if (u,v) = (M/2, N/2),
H(u,v) = 1 otherwise
Lowpass filter

Highpass filter
4.2.4 Filtering in spatial and frequency domains
The discrete convolution f(x,y)*h(x,y)


f(x,y)*h(x,y) F(u,v)H(u,v)
f(x,y)h(x,y) F(u,v)*H(u,v)

=
= -
1 M
0 m
1 N
0 n
n y m x h n m f
MN
1
y x h y) x f ) , ( ) , ( ) , ( , (
4.3 Smoothing Frequency-Domain Filters
Frequency-Domain Filtering:
G(u,v) = H(u,v)F(u,v)
Filter H(u,v)
Ideal filter
Butterworth filter
Gaussian Filter
4.3.1 Ideal Low pass filter
H(u,v) = 1 if D(u,v) s D
0

= 0 if D(u,v) > D
0

The center is at (u,v)=(M/2, N/2)
D(u,v)=[(u-M/2)
2
+ (v-N/2)
2
]
1/2
Cutoff frequency is D
0

Power estimate:
The percentage of power enclosed in the circle is:


=

=
=
(

=
1
0
1
0
) , ( where , / ) , ( 100
M
u
N
v
T
u v
T
v u P P P v u P o
The blurring in this image is a clear
indication that most of the sharp detail
information in the picture is contained
in the 8% power removed by the filter.
The result of =99.5 is quite close to
the original, indicating little edge
information is contained in the upper
0.5% of the spectrum power.
4.3.2 Butterworth Lowpass Filter

Butterworth lowpass filter (BLPF) of
order n


At the frequency as an half of the cutoff
frequency D
0
, H(u, v)=0.5.
n
D v u D
v u H
2
0
] / ) , ( [ 1
1
) , (
+
=
4.3.2 Butterworth Lowpass Filter
4.3.2 Butterworth Lowpass Filter
4.3.2 Butterworth Lowpass Filter
4.3.3 Gaussian Lowpass Filter

Gaussian filter

Let o=D
0


When D(u, v)=D
0
, H(u, v)=0.667
2 2
2 / ) , (
) , (
o v u D
e v u H

=
2
0
2
2 / ) , (
) , (
D v u D
e v u H

=
4.3.3 Gaussian Lowpass Filter
4.3.3 Gaussian Lowpass Filter
4.3.4 Other Lowpass filtering examples
4.3.4 Other Lowpass filtering examples
4.4 Sharpening Frequency-Domain Filter

Highpass filtering:
H
hp
(u,v)=1-H
lp
(u,v)
Given a lowpass filter H
lp
(u,v), find the
spatial representation of the highpass filter
(1) Compute the inverse DFT of H
lp
(u,v)
(2) Multiply the real part of the result with (-1)
x+y


4.4 Sharpening Frequency-Domain Filter
4.4 Sharpening Frequency-Domain Filter
4.4.1 Ideal Highpass Filter

H(u,v)=0 if D(u,v)sD
0

=1 if D(u,v)>D
0

The center is at (u,v)=(M/2, N/2)
D(u,v)=[(u-M/2)
2
+(v-N/2)
2
]
1/2
Cutoff frequency is D
0


4.4.1 Ideal Highpass Filter
4.4.2 Butterworth Highpass Filter

Butterworth filter has no sharp cutoff


At cutoff frequency D
0
: H(u, v)=0.5

n
v u D D
v u H
2
0
)] , ( / [ 1
1
) , (
+
=
4.4.2 Butterworth Highpass Filter
4.4.3 Gaussian Highpass Filter
Gaussian highpass filter (GHPF)


Let o=D
0


2 2
2 / ) , (
1 ) , (
o v u D
e v u H

=
2
0
2
2 / ) , (
1 ) , (
D v u D
e v u H

=
4.4.3 Gaussian Highpass Filter
5.4 Periodic Noise Reduction by
Frequency Domain Filtering

Periodic noise is due to the electrical or
electromechanical interference during
image acquisition.
Can be estimated through the inspection of
the Fourier spectrum of the image.

Periodic Noise Reduction by Frequency Domain Filtering
5.4 Periodic Noise Reduction by
Frequency Domain Filtering

Bandreject filters
Remove or attenuate a band of frequencies.




D
0
is the radius.
D(u, v) is the distance from the origin, and
W is the width of the frequency band.

+ >
+ s s
<
=
2 / ) , (
2 / ) , ( 2 /
2 / ) , (
1
0
1
) , (
0
0 0
0
W D v u D if
W D v u D W D if
W D v u D if
v u H
Butterworth bandreject filter (order n)



Gaussian band reject filter
n
D v u D
W v u D
v u H
2
2
0
2
) , (
) , (
1
1
) , (
(

+
=
Butterworth and Gaussian Bandreject Filters
2
2
0
2
) , (
) , (
2
1
1 ) , (
(
(

=
W v u D
D v u D
e v u H
Bandreject Filters
Bandpass filter

Obtained form bandreject filter
H
bp
(u,v)=1-H
br
(u,v)
The goal of the bandpass filter is to isolate
the noise pattern from the original image,
which can help simplify the analysis of
noise, reasonably independent of image
content.
Result of The BandPass Filter
5.4.3 Notch filters

Notch filter rejects (passes) frequencies in
predefined neighborhoods about a center
frequency.


where

s s
=
otherwise
D v u D or D v u D if
v u H
1
) , ( ) , ( 0
) , (
0 2 0 1
| |
2 / 1
2
0
2
0 1
) 2 / ( ) 2 / ( ) , ( v N v u M u v u D + =
| |
2 / 1
2
0
2
0 2
) 2 / ( ) 2 / ( ) , ( v N v u M u v u D + + + =
Butterworth notch filter


Gaussian notch filter


Note that these notch filters will become
highpass when u
0
=v
0
=0
n
v u D v u D
D
v u H
(

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

=
2
0
2 1
) , ( ) , (
2
1
1 ) , (
D
v u D v u D
e v u H
5.4.3 Notch filters

Notch filters
Example 5.8

Use 1-D Notch pass filter to
find the horizontal ripple noise