MU Electronics Engineering (Semester 7)
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary
1 (a) What do you mean by zero memory operations?
5 marks
1 (b) Differentiate between 8 connectivity and m connectivity.
5 marks
1 (c) What is truncated Huffman code?
5 marks
1 (d) Justify the statement: "Laplacian filter is a high pass filter".
5 marks
2 (a) Explain the following enhancement operations and draw the graph of transformation function:
i) Dynamic range compression
ii) Gray level slicing.
5 marks
2 (b) Perform histogram equalization on the following image histogram and plot original and equalized histograms.
| Gray Level | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| Number of pixel | 550 | 300 | 0 | 0 | 0 | 200 | 325 | 225 |
5 marks
3 (a) Explain in detail the types of data redundancies seen in digital images.
5 marks
3 (b) Explain the method of edge linking using Hough Transform.
5 marks
4 (a) "Calculate the 2DDFT and Hadamard transform of the image segment shown below using matrix multiplication method. <mi>f</mi><mo stretchy="false">(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo stretchy="false">)</mo><mo>=</mo><mtable rowspacing="4pt" columnspacing="1em"><mtr><mtd><mn>0</mn></mtd><mtd><mn>0</mn></mtd><mtd><mn>1</mn></mtd><mtd><mn>4</mn></mtd></mtr><mtr><mtd><mn>1</mn></mtd><mtd><mn>1</mn></mtd><mtd><mn>1</mn></mtd><mtd><mn>4</mn></mtd></mtr><mtr><mtd><mn>1</mn></mtd><mtd><mn>0</mn></mtd><mtd><mn>1</mn></mtd><mtd><mn>0</mn></mtd></mtr><mtr><mtd><mn>0</mn></mtd><mtd><mn>2</mn></mtd><mtd><mn>0</mn></mtd><mtd><mn>2</mn></mtd></mtr></mtable></math>" role="presentation" style="font-size: 125%; text-align: center; position: relative;">f(x,y)=0014111410100202<math xmlns="https://www.w3.org/1998/Math/MathML" display="block"><mi>f</mi><mo stretchy="false">(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo stretchy="false">)</mo><mo>=</mo><mtable rowspacing="4pt" columnspacing="1em"><mtr><mtd><mn>0</mn></mtd><mtd><mn>0</mn></mtd><mtd><mn>1</mn></mtd><mtd><mn>4</mn></mtd></mtr><mtr><mtd><mn>1</mn></mtd><mtd><mn>1</mn></mtd><mtd><mn>1</mn></mtd><mtd><mn>4</mn></mtd></mtr><mtr><mtd><mn>1</mn></mtd><mtd><mn>0</mn></mtd><mtd><mn>1</mn></mtd><mtd><mn>0</mn></mtd></mtr><mtr><mtd><mn>0</mn></mtd><mtd><mn>2</mn></mtd><mtd><mn>0</mn></mtd><mtd><mn>2</mn></mtd></mtr></mtable></math><script type="math/tex; mode=display" id="MathJax-Element-1"> f(x,y)= \begin{matrix} 0 &0 &1 &4 \1 &1 &1 &4 \1
&0 &1 &0 \0 &2 &0 &2 \end{matrix} </script>"
5 marks
4 (b) Explain the importance of kernel separatility property of 2DDFT in implementing 2DFFT.
5 marks
4 (b) Differentiate between spatial and tonal resolution.
5 marks
5 (a) Explain why it is difficult to threshold images with poor illumination.
5 marks
5 (b) With the help of neat block diagram, explain the working of homomorphic filter.
5 marks
6 (a) What are fourier Descriptors? Explain how a two dimensional boundary is represented using Fourier Description.
5 marks
6 (b) Explain how Huffman code removes coding redundancy.
5 marks
Write short notes on any four of the following:
7 (a) Moments
5 marks
7 (b) Wavelet transform
5 marks
7 (c) Digital water marking
5 marks
7 (d) Biometric authentication
5 marks
7 (e) Motion based segmentation.
5 marks