IMAGE PROCESSING ELECTIVES DECEMBER 2007 ELECTRONICS AND TELECOMMUNICATION SEMESTER 8
Con.5857-07. (REVISED COURSE) CD-7206(3 Hours) [Total Marks:-100]
N.B:- (1) Question No.1 is compulsory.
(2) Answer any four out of remaining six questions.
(3) Figures to the right indicate full marks.
(4) Assume suitable data if necessary.
1) Justify/Contradict following statements(Any five):- [20 Marks]
(a) For digital image having salt and pepper noise median filter is the best.
(b) Continuous image histogram can be perfectly equalized, but it may not be so for Digital Image.
(c) Run length coding always gives data compression.
(d) Quality of picture depends on number of pixels and gray levels that represent the picture.
(e) All image compression techniques are invertible.
(f) Magnitude and determinant of unity Transform is unity.
2. (a) Gray level Histogram of an image is given below:- [10 Marks]
|
Gray Levels
|
0
|
1
|
2
|
3
|
4
|
5
|
6
|
7
|
|
No of pixels
|
0
|
0
|
26
|
39
|
16
|
84
|
20
|
0
|
Compute Gray Level Histogram of the output image obtained by enhancing the input by
histogram equalization technique.
(b) Assume that edge starts in the first row and ends in the last row for the following gray
image. [10 Marks]
5 6 1
6 7 0
7 1 3
Sketch all possible paths and determine edge corresponding to minimum cost path.
3. (a) Explain basic principles of detecting following in the images. [10 Marks]
(i) Lines (ii) Points (iii) Edges
Give 3x3 mask for each of them and explain their operation.
(b) Find Huffman code for the following six symbols. The symbols and their probabilities are
given in tabular form.
|
Symbol
|
A1
|
A2
|
A3
|
A4
|
A5
|
A6
|
|
Probability
|
0.1
|
0.4
|
0.06
|
0.1
|
0.04
|
0.3
|
4. (a) Explain the following techniques [10 Marks]
(i) Arithmetic Coding (ii) Bit plane coding
(b) Explain method of segmentation of images by region splitting and merging. [10 Marks]
5. (a) Explain Replication and Linear Interpolation method of zooming. Apply these techniques
to following image and obtain zoomed image
(b) Show that 2D-DCT of an image can be computed by row and column passes with
1D DCT algorithm. [10 Marks]
6. (a) For 2x2 transform A & Image U [10 Marks]
(b) Prove two Dimensional Energy Conservation relation. [10 Marks]
Where f(x,y) represent 2D Image signal and F(u,v) represent transform image
7. Write short notes on (any four) [20 Marks]
(i) Uniform and Nonuniform sampling.
(ii) Fourier Descriptor
(iii) Chain Code
(iv) Descrete Fourier Transform
(v) Connectivity of pixels
No comments:
Post a Comment