0
2.0kviews
Image And Video Processing Question Paper - May 17 - Electronics And Telecomm (Semester 7) - Mumbai University (MU)
1 Answer
0
148views

Image And Video Processing - May 17

Electronics And Telecomm (Semester 7)

Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Question No. 1 is compulsory
(2) Attempt any three from remaining five questions
(3) Draw neat diagrams wherever necessary

1(a) Write a short note on connectivity of pixels.(Any four)
(5 marks) 1303

1(b) Discuss the classification of video frames.
(5 marks) 847

1(c) Explain dilation and erosion of binary image.
(5 marks) 1337

1(d) Explain image degradation model.
(5 marks) 00

1(e) Quality of picture depends on the number of pixels and grey level that represent the picture. Justify or contradict.
(5 marks) 823

2(a) A two dimensional DFT can be obtained using one dimensional DFT algorithms twice, explain with following example.

0 1 2 1
1 2 3 2
2 3 4 3
1 2 3 2

(10 marks) 823

2(b) Explain image enhancement in frequency domain.
(10 marks) 830

3(a) For the following image find the contrast stretching, $r_2=5, r_1= 3, s_2=6, s_1=2$

$f(x,y)$= $\begin{bmatrix}4 & 3 & 2 & 1\\ 3 & 1 & 2 & 4\\ 5 & 1 & 6 & 2\\ 2 & 3 & 5 & 6\end{bmatrix}$

(10 marks) 00

3(b) Explain KL transform
(10 marks) 826

4(a) Perform histogram equalization for following image. Plot original and the equalized histogram.

4 4 4 4 4
3 4 5 4 3
3 5 5 5 3
3 4 5 4 3
4 4 4 4 4

(10 marks) 00

4(b) Discuss the concept of optical flow for motion estimation.
(10 marks) 849

5(a) Give 5 points use Hough transform to draw a line joining these points.

(1,4) (2,3) (3,1) (4,1) (5,0)

(10 marks) 1338

5(b) Let V= {0,1}. compute $D_e$, $D_4$, $D_8$, $D_m$ using $D_4$ connectivity distance between two pixels p & q.Let the pixel coordinates p & q be (3,0) and (2,3) respectively for the image shown. Find the distance measures.

enter image description here

(10 marks) 00

Q6 Write short note on

  • (a) Weiner filter

845

  • (b) RGB and HSI color models

822

  • (c) Exhaustive block matching algorithms

850

(20 marks) 00

Please log in to add an answer.