Min Khant Zaw

VR-EC-9

Biomedical Signal And Image Processing

Assignment II
I : What is Convolution ?

 In image processing, convolution of a matrix involves laying a matrix over another and
then calculating the weighted sum of all pixel values

 Convolution is a general purpose filter effect for images.

 Is a matrix applied to an image and a mathematical operation comprised of
integers
 It works by determining the value of a central pixel by adding the weighted values
of all its neighbors together

 The output is a new modified filtered image

Examples of convoluti on in Image Processing

Original Image
 Sharpened Image

The process of image Convolution

 A convolution is done by multiplying a pixel’s and its neighboring pixels color value by a
matrix

 We use image Convolution for these four main reasons.

1) Smooth
2) Sharpen
3) Intensify
4) Enhance
Kernel

 A kernel is a (usually) small matrix of numbers that is used in image convolutions.

 Differently sized kernels containing different patterns of numbers produce different

results under convolution.

 Allows for “area” effects such as blur, sharpening and edge-detection

 The size of a kernel is arbitrary but 3x3 is often used.

Kernel Application

Most Popularly know Kernels

Box blur

 Pixel value is based on average of its neighborhood:

1/9 * {{1, 1, 1},

{1, 1, 1},
{1, 1, 1}}
Or approximately:
{ {0.11, 0.11, 0.11},
{0.11, 0.11, 0.11},
{0.11, 0.11, 0.11} }

Gaussian blur

 Use of Gaussian function for convolution:

 Low-pass filter that reduces high frequency features including noise

 Weight average better preserves features

1D Gaussian distribution
II: Discrete Fourier Transform (DFT) and It’s Application area

The discrete Fourier transform (DFT) is one of the most important tools in digital signal
processing. This chapter discusses three common ways it is used. First, the DFT can calculate a
signal's frequency spectrum. This is a direct examination of information encoded in the
frequency, phase, and amplitude of the component sinusoids. For example, human speech and
hearing use signals with this type of encoding. Second, the DFT can find a system's frequency
response from the system's impulse response, and vice versa. This allows systems to be
analyzed in the frequency domain, just as convolution allows systems to be analyzed in the time
domain. Third, the DFT can be used as an intermediate step in more elaborate signal processing
techniques. The classic example of this is FFT convolution, an algorithm for convolving signals
that is hundreds of times faster than conventional methods.
DFT is used when signals are needed to transform from time domain to frequency
domain. In other words, the DFT can calculate a signal's frequency spectrum. This is a direct
examination of information encoded in the frequency, phase, and amplitude of the component
sinusoids. Moreover, frequency response and impulse response can be calculated.

Derivati on of Discrete Fourier Transform