University Visvesvaraya College of Engineering

Preliminary project report

Subject : DSP

Topic : DFT-Assisted Edge Detection Technique

Team : Akash S (20GAECE004)

Manjunath Hegde (20GAECE022)

Shrisha G Hegde (20GAECE048)

Vivek Hegde (20GAECE058)

Introduction:

The detection of edges in images plays a fundamental role in computer vision,

image processing, and various fields such as object recognition, medical imaging, and
robotics. Edges represent significant changes in intensity or color in an image and
often correspond to the boundaries of objects or regions of interest. Accurate edge
detection is a critical step in various image analysis tasks, enabling the extraction of
meaningful features and structures from visual data.

In this report, we explore the use of the Discrete Fourier Transform (DFT) as a
powerful tool for image edge detection. The DFT is a mathematical technique that
allows us to analyze the frequency components of an image. While it is traditionally
used in signal processing and frequency domain analysis, it has also found
applications in image processing. The central idea is to transform an image from the
spatial domain to the frequency domain using the DFT and identify edges based on
variations in the spectral content.

Motivation
The motivation for utilizing the DFT in edge detection lies in its ability to
highlight the periodic patterns and abrupt transitions present in an image. Edges
often manifest as high-frequency components in the frequency domain, and the DFT
can accentuate these features. By taking advantage of the DFT's unique ability to
separate different frequency components, we can create effective edge detection
algorithms that are capable of preserving fine details and reducing noise.
Goals:

This report aims to provide a comprehensive overview of DFT-based image

edge detection methods, including the underlying theory, implementation
techniques, and practical applications. We will discuss the basic concepts of the DFT
and how it can be applied to image processing tasks. Additionally, we will explore
common challenges and considerations associated with DFT-based edge detection,
such as parameter tuning and computational efficiency.

The report is organized as follows: in the following section, we will delve into
the theoretical foundation of the DFT and its relevance to image analysis.
Subsequently, we will discuss the practical implementation of DFT-based edge
detection algorithms and present examples to illustrate their effectiveness. We will
also address the trade-offs and limitations of these methods. Finally, we will conclude
by highlighting the significance of DFT-based image edge detection and its potential
impact on various applications.

Through this report, we aim to shed light on the potential benefits of using the
Discrete Fourier Transform for image edge detection, providing researchers,
engineers, and practitioners with valuable insights into a powerful technique for
image analysis and computer vision tasks.
Methodology:

Formulas used:
Procedure:

Loading the Image:

Start by loading the input image, which is typically a grayscale image. We can use a library
like OpenCV to read the image file.

Preprocessing:

Convert the loaded image to grayscale. Grayscale images are simpler to work with for edge
detection because they have a single intensity channel.

DFT on the Grayscale Image:

The next step is to apply the DFT to the grayscale image. The DFT is applied to the image
pixel by pixel to transform it from the spatial domain to the frequency domain.
For a 2D image, you will apply the DFT separately to the rows and columns of the image. This
means you perform a 1D DFT on each row and a 1D DFT on each column, or equivalently, a 2D DFT
on the entire image.

Complex DFT Result:

The result of the DFT is a complex matrix representing the frequency components of the
image. This matrix has real and imaginary parts, where each element corresponds to a specific
frequency component.
Shifting the DFT Output:

To make it easier to interpret the DFT result, typically shift the zero frequency component
to the center of the matrix. This is done using the np.fft.fftshift function. Shifting allows you to view
the low-frequency components in the center and the high-frequency components at the corners of
the image.

Magnitude Spectrum:

To visualize the frequency components effectively, calculate the magnitude spectrum. This
is done by calculating the magnitude of the complex DFT result. The magnitude spectrum
represents the amplitude of the frequency components in the image.

Visualizing the DFT Output:

Creation of visualizations of the DFT output and magnitude spectrum, which will help us
understanding the frequency content of the image.

Edge Detection and Filtering:

Filters in image processing are just what the name suggests, Filter. They are typically a mask
array of the same size as the original image which when superimposed on the ordinal image,
extracts only the attributes that we are interested in. As mentioned earlier, in an DFT transformed
image, low frequencies are found in the center and high frequencies are scattered around, we can
then create a mask array which has a circle of zeros in the center and rest all ones. Now when this
mask is applied to the original image, the resultant image would only have high frequencies. This
becomes quite useful as low frequencies correspond to edges in spatial domain.

After the DFT analysis, perform edge detection using techniques like the Sobel operator. The
high-frequency components in the DFT result often correspond to edges in the spatial domain. By
filtering or enhancing these components, you can detect edges effectively.
Inverse DFT:

Once you've enhanced or filtered the DFT result to highlight edges, you can apply the
inverse DFT to convert the frequency domain representation back to the spatial domain. This will
result in an image where the edges are emphasized.

Software used:

Python

Modules used:

 Numpy

 Matplotlib

 openCv
Results and analysis:
Edge detection:
References:

 https://homepages.inf.ed.ac.uk/rbf/HIPR2/fourier.htm

 https://homepages.inf.ed.ac.uk/rbf/HIPR2/sobel.htm#:~:text=The%20Sobel%20operator%20p
erforms%20a,in%20an%20input%20grayscale%20image.

 https://ieeexplore.ieee.org/document/1048189