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)
Explain the Human visual system in accordance with the processing of images.
(5 marks)
00
1(b)
Why is the sum of coefficients of High pass filter mask zero?
(5 marks)
00
1(c)
Define Hadamard transform. Write the Hadamard matrix for N=8.
(5 marks)
00
1(d)
Explain the steps involved in homomorphism filtering with the help of neat block diagram.
(5 marks)
00
1(e)
What effect would setting to zero the lower order bit planes have on the histogram of an image in general?
(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.
Gray Level |
0 |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
No. of pixels |
790 |
1023 |
850 |
656 |
329 |
245 |
122 |
81 |
(10 marks)
00
2(b)
Explain the following image enhancement techniques in spatial domain with the help of 10
transformation graphs.
- i. Contrast stretching
- ii. Grey level slicing
(10 marks)
00
3(a)
What are the different types of data redundancies found in digital images? Explain in detail.
(10 marks)
00
3(b)
Explain arithmetic coding in detail with the help of an example.
(10 marks)
00
4(a)
Explain the following morphological operations with the help of an example.
(10 marks)
00
4(b)
What are chain codes? For the following figure calculate the chain code and prove that, the chain code is invariant to translation and rotation.
(5 marks)
00
5(a)
Explain the properties of 2D DFT in detail. Find the DFT transform of the image segment shown below:
(5 marks)
00
5(b)
Explain Euclidean distance, City block distance, Chess board distance and Dm distance with the help of an example.
(10 marks)
00
Q6) Write short notes on any four of the following:
6(a)
JPEG encoder and decoder
(5 marks)
00
6(b)
Hough Transform
(5 marks)
00
6(c)
Region Splitting
(5 marks)
00
6(d)
Connectivity of pixels
(5 marks)
00
6(e)
Vector Quantization
(5 marks)
00