Scribd
Upload
4 views

Assignment_02

Uploaded by

nur45lab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Assignment_02

Uploaded by

nur45lab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment No.

02
Digital Image Processing (Course Code: 5101/6101/i2P5101)
Due date for submission: 05/03/2024

1. Develop an algorithm (along with a flow chart) and implement in MATLAB for computation of convolution of two given sequences,
i.e., y[n] = x1[n1]*x2[n2] (where -a<n<a). Determine and display – with implementation of the developed algorithm – y[n] with
{x1[n]} = {-1, 2, 6, 0, 10, 15} (‘n’ corresponds to -1, 0, 1, 2, 3, and 4) while {x2[n]} = {7, 2, 5, 1, -3, 0, 13, -1} (‘n’ corresponds to -3, -2, -
1, 0, 1, 2, 3, and 4). Compare the results with inbuilt syntax from MATLAB and estimate the error. Determine the Fourier transform
of y[n]. (10)
2. As given in Question No. 1, using MATLAB, plot the functions (or Fourier components) representing each terms – in a figure – that
appear in the Fourier transform of x1[n] = and subsequently, the sum of the terms that give the corresponding Fourier transform of
x1[n]. Similarly, plot the Fourier components representing each terms in the Fourier transform of x2[n] and arrive at the Fourier
transform of y[n]. (10)
3. Estimate y[m, n] = x1[m, n]**x2[m, n] (‘**’ represents convolution operation) for the given sequences:
3 1 −1
1 0
𝑥! [𝑚, 𝑛] = ( . ; 𝑥" [𝑚, 𝑛] = 02 0 1 2;
2 −1
0 1 −1

with the proper graphical representation of each steps to arrive at y[m, n]. Use (1, 1) as the origin of frame of reference. (10)
4. Develop an algorithm and implement in MATLAB for estimation of Fourier transform of:
a. A sinusoidal function x[n] = A*sin(𝜔# n), A=1.
(!$%! )' ("$%" )'
! &' ) *
b. 2D Gaussian function 𝑥[𝑚, 𝑛] = 𝑒 '('
! '('
" .
"$%! %"

NOTE: Give the corresponding flowchart and display the results. (20)
5. Develop an algorithm and the associated MATLAB code to obtain an image half the dimension of a given image (in this case,
Lecture_03_Lena_Gray.bmp) by cropping certain region of interest, i.e., first crop a certain region of interest from a given image and
reduce the dimension to half. (10)
6. Prove the Nyquist theorem that minimum sampling frequency (Ω+ ) so as to avoid aliasing while sampling of a given continuous
signal (x(t)) is given by:
Ω+ ≥ ∆Ω,
where ∆Ω is the bandwidth of the given signal. Give a proper graphical diagram.
Deduce that, for a signal with unlimited bandwidth, it is not possible to perform sampling without any aliasing. (5 + 5 = 10)
7. Show that Fourier transform of impulse train is impulse train. (5)
,
8. Show that transformation (T) 𝑥[𝑛] → 𝑦[𝑛] = 𝑇(𝑥[𝑛]) = ∑.
-/&. 𝑎- 𝑥- [𝑛] is linear. (5)
9. 𝑒 012 is an Eigen-function of LTI system and 𝐻(𝑒 01 ) is its corresponding eigen-value, where 𝐻(𝑒 01 ) is the Fourier transform of
impulse response (h[n]). (5)
10. For a given square matrix (R), it can be diagonised as:
a. 𝜙 &! 𝑅𝜙 = Λ; for unitary 𝜙.
b. 𝜙 ∗, 𝑅𝜙 = Λ; for unitary 𝜙.
c. 𝜙 , 𝑅𝜙 = Λ; for orthogonal 𝜙. (5 + 2.5 + 2.5 = 10)
11. Prove the following identities of Fourier transform: (3 x 7 = 21 (for all of the questions except Q11(8) and Q11(9)). Q11(8) and
Q11(9) carry 5 marks)

You might also like