STUPIDSID
1 (a)
Justify / Contradict : Quality of picture depends on number of pixels and gray levels that represents the picture.
5 M
1 (b)
What is K-L transform? Why it is called as method of principle components?
5 M
1 (c)
Explain log transformation method of data compression indicating clearly whether they are lossy or lossless. Also state the type of redundancy they can minimize:
i) Huffman coding
Transform coding
iii) Adaptive Delta Modulation
iv) Differential Pulse code Modulation
v) Run length coding on bit planes.
i) Huffman coding
Transform coding
iii) Adaptive Delta Modulation
iv) Differential Pulse code Modulation
v) Run length coding on bit planes.
5 M
2 (a)
Explain the method of segmentation of image by region splitting and merging.
10 M
2 (b)
Draw and explain a model of the image degradation/restoration process.
10 M
3 (a)
State and explain the properties of 2-D Fourier transform. (Any five)
10 M
3 (b)
Explain with block diagram basic steps for filtering in frequency domain
10 M
4 (a)
Generate Huffman code for following table in which eight symbol with corresponding probabilities are given :
| Symbol | A0 | A1 | A2 | A3 | A4 | A5 | A6 | A7 |
| Probability | 0.05 | 0.008 | 0.022 | 0.06 | 0.18 | 0.13 | 0.07 | 0.48 |
10 M
4 (b)
Obtain Hadamard matrix H(8) from simple second order matrix 8(2) and draw flow diagram for H(8). Define frequency and find it for H(8).
10 M
5 (a)
Histogram of a digital image with eight quantization level is shown below. Perform histogram equalization.
| Gray Level | R | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| No. of gray level | hr | 220 | 140 | 50 | 60 | 70 | 170 | 130 | 160 |
10 M
5 (b)
Explain principal techniques to estimate the degradation function for use in image
restoration.
10 M
6 (a)
Explain the following techniques:-
(i) Arithmetic coding
(ii) Bit Plane Coding
(i) Arithmetic coding
(ii) Bit Plane Coding
10 M
6 (b)
For the 3bit 4X4 size image , perform the following operations:
i)Negation
ii) Threshold with T=4
iii) Intensity level slicing with background r1=2 and r2=5
iv) Bit plane slicing for MSB and LSB planes.
v) Clipping with r1=2 and r2=5
i)Negation
ii) Threshold with T=4
iii) Intensity level slicing with background r1=2 and r2=5
iv) Bit plane slicing for MSB and LSB planes.
v) Clipping with r1=2 and r2=5
| 1 | 2 | 3 | 0 |
| 2 | 4 | 6 | 7 |
| 5 | 2 | 4 | 3 |
| 3 | 2 | 6 | 1 |
10 M
Write short note (any two)
7 (a)
Connectivity of pixels
10 M
7 (b)
2 D-DCT computation by row and column passes with 1D-DCT algorithm
10 M
7 (c)
Wiener filtering
10 M
More question papers from Image Processing