written 5.5 years ago by
yashbeer
★ 11k
|
|
Electronics Engineering (Semester 7)
Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Draw neat diagrams wherever necessary.
Q1) Answer any four of the following:
1(a)
Justify Huffman coding is a lossless compression technique.
(5 marks)
00
1(b)
Explain the role of illumination in segmentation.
(5 marks)
00
1(c)
Explain Bit-plane slicing with the help of an example.
(5 marks)
00
1(e)
Discuss various color models used in image processing.
(5 marks)
00
1(e)
Explain any two properties of 2D DFT.
(5 marks)
00
2(a)
Perform Histogram Equalization on Gray level distribution shown in the table.
Draw the histograms of the original and equalized images. Comment on the contrast
of the image before histogram equalization and after histogram equalization.
Gray Levels |
0 |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
No. of pixels |
0 |
100 |
400 |
50 |
200 |
50 |
200 |
0 |
(10 marks)
00
2(b)
Explain Homomorphic filtering with the help of a neat block diagram.
(10 marks)
00
3(a)
Using Hough transform find the equation of the line that passes through
maximum number of points using the following edge points.
(1,4), (2,3), (3,1), (4,1) and (5,0)
(10 marks)
00
3(b)
Calculate the efficiency of Huffman code for the following symbol whose
probability of occurrence is given below:
Symbol |
a1 |
a2 |
a3 |
a4 |
Probability |
0.9 |
0.06 |
0.02 |
0.02 |
Explain Run-length coding with the help of an example.
(10 marks)
00
4(a)
Consider an 8x8 image, the grey level ranges from 0 to 7. Segment this image
using region growing and region splitting technique. Comment on the results.
(10 marks)
00
4(b)
Explain the following morphological operations with the help of an example.
(10 marks)
00
5(a)
Explain discrete wavelet transform in detail. Discuss its relevance in
compression.
(10 marks)
00
5(b)
Explain any two spatial filtering techniques for image enhancement with the
help of examples.
(10 marks)
00
Q6) Write short notes on any four of the following:
6(a)
Distance Transforms
(5 marks)
00
6(b)
Chain Codes
(5 marks)
00
6(c)
Data redundancies
(5 marks)
00
6(d)
Eye Diagram
(5 marks)
00
6(e)
Low pass avenging filter
(5 marks)
00