Wednesday, July 2, 2014

Digital Signal and Image Processing (DSIP) Semester 7 (3 Hours) December 2009

Digital Signal and Image Process

Digital Signal and Image Processing (DSIP)
Semester 7
(3 Hours) December 2009

 

SP-6578
[Total Marks : 100]
 

N.B: (1) Question no 1 is compulsory.  
  (2) Attempt any four out of remaining six questions.  
  (3) Assume suitable data wherever necessary and state them clearly.  
       
1. Justify the following statement :- 20
  (a) Median filter is the best filter to remove salt and pepper noise in an image.  
  (b) Image resulting from poor illumination could be quite difficult to segment.  
  (c) The process of removing the psychovisual redundance is a lossy technique.  
  (d) Convolution in spatial domain is multiplication in frequency domain.  
  (e) Mixed adjacency is introduced to eliminate the ambiguities that often arise when 8-adjacency is used.  
       
2. (a)

For pixels p and q shown in figure with co-ordinates (1, 1) and (4, 4), Find -
(i) Euclidean distance
(ii) City block distance (D4)
(iii) Chess board distance (D8)

P 2 4 5 3 3 V = {2, 3, 4}
5 3 2 4 5
7 6 2 1 5
6 5 3 4 0
4 5 7 2 6
08
  (b) Perform contract stretching on the image segment shown according to the transfer function shown in the figure. Draw the histogram of the original image and contract stretched image.
08
  (c) What is false contouring? When does it happen in digital images ? 04
       
3. (a) Suppose that a 64 x 64 8 level image has the following gray level distribution.
 
Gray Level rk 0 1 2 3 4 5 6 7
No. of pixels nk 780 1024 855 650 335 240 125 83

Perform histogram equalization and draw the original and equalized histogram.

10
  (b) Differentiate between Point Processing and Mask Processing Techniques. 04
  (c) Classify the following image processing technique into point processing and Mask Processing :-
(i) Digital negative
(ii) Laplacian filter
(iii) Bit plane slicing
(iv) Power log transformation
(v) Gray level slicing
(vi) Derivative filtering.
06
       
4. (a) Find the 2D-DFT of the following image segment using any FFT algorithm :-
 
3 1 2 1
3 0 0 1
1 4 3 2
2 1 1 2
12
  (b) Segment the image shown in the figure using Region splitting and Merging technique. Shown the Quadtree representation corresponding to your segmentation :-
08
     
5. (a) Find a set of code word and average word length using Huffman coding scheme for a set of input gray levels (a - g) with the probabilities as given below :-
 
Symbol a b c d e f g
Probabilities 0.07 0.03 0.08 0.06 0.06 0.4 0.3
08
  (b) Name and explain different types of data redundancies associated with digital images. 06
  (c) What is IGS coding? How it is operations on the image below with the structuring element given :- 06
       
6. (a) Perform the dialation and erosion operations on the image below with the structuring element given :-
08
  (b) For the following boundary shown below, find the chain code and shape number.
06
  (c) Define moment of an image. Explain how they can be used in shape analysis of an image. 06
       
7. Write short notes on any four of the following :- 20
  (a) Hough transform  
  (b) Closing and opening  
  (c) Transform coding  
  (d) Haar transform  
  (e) Fourier descriptors.  

No comments:

Post a Comment