You are on page 1of 4

MAULANA AZAD NATIONAL INSTITUTE OF TECHNOLOGY,

BHOPAL
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
END TERM EXAM. (APRIL-2021)
Sub: DIP Sub. Code: CSE 339
Time: 3 Hours Max Marks: 50

Note: Attempt all questions. Answers should be brief and to the point. Make
suitable assumptions wherever necessary and clearly state the same.
Q1 (A) Suppose we have a 2 X 2 input image as given below, scale up this
image by factor of 2 in both directions using the bilinear interpolation. Calculate
intensity of pixels P1, P2, P3, P4 in output image. (4)

60 20
80 30
Input Image

P1 P2

P3 P4

Output Image

(B) Calculate the Discrete Fourier Transform values of the discrete function
given below and also evaluate inverse Fourier Transform of calculated Fourier
Transform values? (6)
Q2 (A) Consider the image subset as shown in the figure given below. Assume
that V= {3, 4}, compute shortest 4-, 8-, m-path between pixels X and Y. Also
evaluate the D4, D8 and Dm Distances between X and Y. (5)

1 2 3 1 3 4 3
2 4 4 3 4 1 4
2 3 1 2 2 3 3
(X) 4 4 1 2 1 1 3 (Y)
1 1 4 1 2 4 2
2 1 3 3 4 1 2

(B) Show the step by step labeling of connected components of the binary
image given below for V= {1}. (5)

0 0 0 0 0 0 0 0 0 0 0 0
0 0 1 1 1 0 0 1 1 0 0 0
0 1 0 0 0 0 0 0 1 0 0 0
0 0 1 1 1 0 0 0 1 0 0 0
0 0 1 1 0 0 0 1 1 1 1 1
1 1 1 0 0 0 0 0 0 1 1 1
0 0 1 0 0 0 0 0 0 0 0 1
0 0 1 0 0 0 0 0 1 1 1 1
0 0 0 0 0 0 0 0 0 0 0 0
Q3 (A) Suppose that the image given below is a frequency domain filter
transfer function. If we use this filter transfer function for filtering of an image
then what changes will occurs in input image. Which type of problem we will
see in output image and why? Explain that problem with help of an example.
(5)

(B) Apply region splitting and merging algorithm on the following image.
Assume the threshold value is ≤ 3. (5)
Q4 (A) What are uses of dilation in image processing also perform the dilation
on the mage with the given structuring element. (5)

(B) Explain region growing algorithm with the help of example. Why seed point
and threshold is used in this algorithm. (5)
Q5 (A) Apply thinning algorithm on the given image and show the image after
each step. (5)
1 1 0 0 0 0 0 1 1 1
1 1 1 1 1 1 1 1 0 0
1 1 1 1 1 1 1 1 0 0
1 1 1 1 1 1 1 1 0 0
1 1 1 0 0 1 1 1 0 0

(B) Perform histogram matching on the given histogram (a) & (b), modify
histogram (a) as given (b). (5)
(a)

(b)

You might also like