Introduction Fourier transform

and the frequency domain

Fourier Transform , named after Joseph Fourier, is
a mathematical transformation employed to
transform signals between time(or spatial
domain and frequency domain.
It is a tool that breaks a waveform(a function or
signal)into an alternate representation,
characterized by sine and cosines.
Fourier transformation is used in a wide range of
application such as image filtering, image
compression. Image analysis and image Fourier
reconstruction etc.
The formula for Fourier transformation

3
29-Nov-21
Example:

4
29-Nov-21
 IMAGE ENHANCEMENT TECHNIQUES

Fig. 1. Types of Enhancement Technique

The enhancement technique differs from one field to another according to its
objective. Advancement in the technology brings the development in the digital image
processing techniques in both domains:
 DIFFERENCE BETWEEN SPATIAL DOMAIN AND FREQUENCY DOMAIN

 Spatial domain  Frequency domain

1. Spatial domain deals with image plane 1. Frequency domain deals with the rate
itself. of pixel change.
2. Spatial domain works based on direct 2. Frequency domain works based on
manipulation of pixels. modifying Fourier transform.
3. Spatial domain can be more easier to 3. Frequency domain can be less easier to
understand. understand.
4. Spatial domain is more cheaper. 4. Frequency domain is less cheaper.
5. Spatial domain takes time to computer. 5. Frequency domain takes more time to
compute.
6. Used for filtering basics, smoothing filters,
sharpening filters, unsharp masking and 6. Used to filtering basics, Smooth an
Laplacian. image with a Gaussian kernel.

29-Nov-21
 A. Spatial domain

The term spatial domain refers to the image plane itself, and
approaches in this category are based on direct manipulation of pixel
values of an image. It enhances the whole image in a uniform
manner. The value of the pixels with coordinates (x, y) in an enhanced
image ‘F’ is the result of performing some operation on the pixels with
the neighbourhood of (x, y) in the input image ‘f’. This method is
straightforward and are chiefly utilized in real time applications. But it
lags in producing adequate robustness and imperceptibility
requirement.
29-Nov-21
 B. Frequency domain.

The frequency domain processing techniques are based on modifying

the Fourier transform of an image. The basic idea in using this technique is
to enhance the image by manipulating the transform coefficient of the
image, such as Discrete Fourier Transform (DFT), Discrete Wavelet
Transform (DWT), and Discrete Cosine Transform (DCT). This methods
advantages includes low complexity of computations, ease of viewing
and manipulating the frequency composition of the image and the easy
applicability of special transformed domain properties.
29-Nov-21
IMAGE ENHANCEMENT USING FREQUENCY DOMAIN TECHNIQUE

In frequency domain methods, the image is first transferred into frequency

domain. All the enhancement operations are performed on the Fourier
transform of the. Image enhancement function in the frequency domain

is denoted by the expression: g(x, y) = T[f(x, y)] where f(x, y) is the input

image, g(x, y) is an enhanced image formed by the result of performing

some operation, T on the frequency component of the transformed
image.

29-Nov-21
 Filtering in the Frequency Domain The procedures required to enhance an image using
frequency domain technique are:
i. Transform the input image into the Fourier domain.
ii. Multiply the Fourier transformed image by a filter.
iii. Take the inverse Fourier transform of the image to get the resulting enhanced image.
Basic Steps for Filtering in the Frequency Domain:
1. Given an input image f(x, y) of size M x N.
2. Compute F (u, v), the DFT of the image.

3. Multiply F (u, v) by a filter function H(u, v), i.e., G(u, v) = H(u, v)F(u, v)
4. Compute inverse DFT of the G(u, v).
5. Obtain the real part of the result.

29-Nov-21
Step-1 Input Image An input image may be defined as a two-dimensional function, f(x, y),
where x and y are spatial (plane) coordinates, and the amplitude of f at any pair of
coordinates (x, y) is called the intensity or grey level of the image at that point.

Fig. 2. Frequency Domain Filtering Operations

29-Nov-21
Step-2 Compute Fourier Transform of the input image. The image f(x, y) of size M x N
will be represented in the frequency domain F(u, v) using Discrete Fourier Transform
(DFT). The concept behind the Fourier transform is that any waveform that can be
constructed using a sum of sine and cosine waves of different frequencies. The Discrete
Fourier Transform (DFT) of an image takes a discrete signal and transforms it into its
discrete frequency domain representation. The Fourier transform F(u), of a single variable
continuous function f(x), is defined by:

where, u represents the frequency and x represents time/space. The exponential in the
above formula can be expanded into sines and cosines with the variables u and v
determining these frequencies. 29-Nov-21
Step-3
Filtering of the Fourier Transformed image. A filter is a tool designed to suppress certain
frequency components of an input image and return the image in a modified format.
They are used to compensate for image imperfections such as noise, and insufficient
sharpness. By filter design we can create filters that pass signals with frequency
components in some bands, and attenuate signals
with content in other frequency bands. The general formula for filtering is given as: G(u,
v) = F(u, v).H(u, v) where the H(u, v) is the transfer function, and F(u, v) is the Fourier
transform of the image function. The G(u, v) is the filtered final function. In all the filters, it
is important to find the right filter function H(u, v) as it amplifies some frequencies and
suppresses certain frequency components in an image. There are many filters that are

used for blurring/smoothing, sharpening and edge detection in an image.

 Fig. 3. Types of Frequency Domain Filters
Based on the property of using the frequency domain the image filters are broadly
classified into two categories:
1. LOW-PASS FILTERS / SMOOTHING FILTERS.
2. HIGH-PASS FILTERS / SHARPENING FILTERS 29-Nov-21
Lowpass filter (smoothing)
A low pass filter is used to pass low-frequency signals.
The strength of the signal is reduced and frequencies which are passed is higher
than the cut-off frequency.
The amount of strength reduced for each frequency depends on the design of the
filter. Smoothing is low pass operation in the frequency domain.
Following are some lowpass filters:
1. Ideal Lowpass Filters
The ideal lowpass filter is used to cut off all the
high-frequency components of Fourier
transformation.
Below is the transfer function of an ideal lowpass
filter.

29-Nov-21
2. Butterworth Lowpass Filters
Butterworth Lowpass Filter is used to remove high-frequency noise with very
minimal loss of signal components.

29-Nov-21
High pass filters (sharpening)

A high pass filter is used for passing high frequencies but the
strength of the frequency is lower as compared to cut off
frequency. Sharpening is a high pass operation in the
frequency domain. As lowpass filter, it also has standard
forms such as Ideal high pass filter, Butterworth high pass
filter, Gaussian high pass filter.

29-Nov-21
Text and References:
Gonzalez, R. C. and Woods, R. E., "Digital Image Processing", Prentice Hall,
3rd Ed.
Jain, A. K., "Fundamentals of Digital Image Processing", PHI Learning, 1st
Ed.
Bernd, J., "Digital Image Processing", Springer, 6th Ed.
Burger, W. and Burge, M. J., "Principles of Digital Image Processing",
Springer
Scherzer, O., " Handbook of Mathematical Methods in Imaging", Springer