Elective - II: Digital Image Processing

Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

B.E. (Elect. & Telecommunication / Elect.

& Communication Engineering)


Eighth Semester (C.B.S.)
Elective - II : Digital Image Processing
P. Pages : 3 NIR/KW/18/3647
Time : Three Hours *1400* Max. Marks : 80
_____________________________________________________________________
Notes : 1. All questions carry marks as indicated.
2. Solve Question 1 OR Questions No. 2.
3. Solve Question 3 OR Questions No. 4.
4. Solve Question 5 OR Questions No. 6.
5. Solve Question 7 OR Questions No. 8.
6. Solve Question 9 OR Questions No. 10.
7. Solve Question 11 OR Questions No. 12.
8. Due credit will be given to neatness and adequate dimensions.
9. Assume suitable data whenever necessary.
10. Illustrate your answers whenever necessary with the help of neat sketches.

1. a) Explain the fundamental steps in digital image processing with block diagram. 7

b) What are different distance measures used for image? Compute De , D 4 and D8 distance 6
between two points p and q in an image shown below :

0 1 1 1 (q)
1 0 0 0
1 1 1 1
(p) 1 1 0 1

OR

2. a) Write short note on image sampling and quantization. 7

b) Consider the image segment shown, Let V = 0, 1 and V = 1, 2 , compute the length of 6
the shortest 4−,8 − and m – path between p and q. If particular path does not exist, explain
why?
3 1 2 1 (q)
2 2 0 2
1 2 1 1
(p) 1 0 1 2

3. a) What is histogram equalization? Explain in detail. 6

b) Gray level histogram of an image is given below : 7


Gray level 0 1 2 3 4 5 6 7
Frequency 400 700 1350 2500 3000 1500 550 0
Compute the gray level histogram of the output image obtained by enhancing the input by
histogram equalization technique.
OR

NIR/KW/18/3647 1 P.T.O
4. a) Discuss the RGB and CMY color model. 6

b) Explain bit-plane slicing technique. Show the different bit planes of 4-bit image shown 7
below :
11 4 10 8
12 9 2 5
4 2 7 5
0 1 6 2

5. a) Obtain the 4 – length DCT for the following discrete sequence : 5


1, 3, − 2, 4
b) Generate 4  4 Haar transform matrix. Find Haar transform of an image shown below : 9

1 2 4 5
2 3 6 7
3 6 3 2
1 4 6 7

OR

6. a) Generate 4  4 slant transform. Show how it is “Orthogonal” transform. 7

b) Generate 8  8 Hadamard transform. Give its properties. 7

7. a) Explain the generalized image compression model with neat block diagram. 7

b) Determine which bit, if any in error in the Hamming encoded messages. 6


1100111, 1100110 and 1100010. What are decoded values?
OR
8. a) Explain Lossy Predictive model in detail. 6

b) The arithmetic decoding is the reverse of an encoding process. Decode the message 7
0.23355 given the coding model.

Symbol Probability
a 0.2
e 0.3
i 0.1
o 0.2
u 0.1
! 0.1

9. a) Explain region splitting and merging technique in region based segmentation. 7

b) Use Hough transform to find a straight line. Given data points at (0, 1), (1, 1), (2, 2) and 7
(3, 3)
OR

NIR/KW/18/3647 2
10. a) Find chain codes and shape numbers of the image given below. Also find order of shape 7
numbers. Assume 4 – connectivity.

b) Write short note on : 7

i) Fourier descriptor

ii) Boundary descriptor

11. a) Write short note on image degradation model. 7

b) Write short note on Wiener Filtering 6

OR

12. a) Write short note on inverse filtering. 7

b) Explain common PDFs found in image processing applications. 6

***********

NIR/KW/18/3647 3 P.T.O
NIR/KW/18/3647 4

You might also like