Justify any four of the following statements

1 (a)
Reduction in spatial resolution results in checker board degradation.

5 M

1 (b)
Huffman coding is a lossless compression technique.

5 M

1 (c)
Butterworth lowpass filter is preferred to ideal lowpass filter.

5 M

1 (d)
It is difficult to segment poorly illuminated images.

5 M

1 (e)
Dynamic range compression is used in displaying the Fourier transform of an image.

5 M

2 (a)
The gray level distribution of an image is shown in the table below. Perform histogram equalization and plot the original and equalized histograms.

Gray level | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 |

Frequency of occurrence | 0 | 50 | 100 | 200 | 400 | 200 | 50 | 0 |

10 M

2 (b)
With the help of block diagram, explain the working of a Homomorphic filter.

10 M

3 (a)
A 5×5 image segment is shown below. Perform bitplane slicing and lowpass filtering on the same:-

6 | 7 | 6 | 6 | 7 |

0 | 0 | 0 | 1 | 2 |

1 | 1 | 1 | 2 | 3 |

4 | 5 | 5 | 4 | 2 |

6 | 6 | 6 | 7 | 7 |

10 M

3 (b)
Which help of suitable example, explain the following morphological operations

i) Dilation

ii) Erosion.

i) Dilation

ii) Erosion.

10 M

4 (a)
What are the different types of data redundancies found in digital image? Explain in detail.

10 M

4 (b)
A source emits six symbols with probabilities as shown in the table below. Construct the Huffman code and calculate the coding the coding efficiency.

Symbol |
a_{1} |
a_{2} |
a_{3} |
a_{4} |
a_{5} |
a_{6} |

Probability | 0.05 | 0.25 | 0.05 | 0.15 | 0.2 | 0.3 |

10 M

5 (a)
Obtain the 2DDET of the image segment shown below using any one fast algorithm.

\[\begin{matrix} f(x,y)= \end{matrix}\begin{bmatrix} 0 &0 &1 &1 \\1 &2 &0 &0 \\1 &0 &1 &1 \\2 &0 &1 &0 \end{bmatrix}\]

\[\begin{matrix} f(x,y)= \end{matrix}\begin{bmatrix} 0 &0 &1 &1 \\1 &2 &0 &0 \\1 &0 &1 &1 \\2 &0 &1 &0 \end{bmatrix}\]

10 M

5 (b)
What is segmentation? With the help of examples, explain segmentation based on similarity.

10 M

6 (a)
Explain the following with examples

i) Signature

ii) Fourier Descriptor

i) Signature

ii) Fourier Descriptor

10 M

6 (b)
State and prove period and translation properties of 2DDFT. Write the transformation matrices for Hadamard and Fourier transformation for N=4.

10 M

Write short notes on any four

7 (a)
Isopreference curves

5 M

7 (b)
Hough transform .

5 M

7 (c)
Digital water marking.

5 M

7 (d)
Chain Code.

5 M

7 (e)
Biometric Authentication

5 M

More question papers from Digital Image Processing