SRM University 2007 B.Tech Electronics and Communications Engineering Bank Digital Image Processing - Question Paper

6) Obtain the Haar transform matrix for N=4?
7) Obtain the Haar transform matrix for N=8?
8) Obtain the slant transform matrix for N=4?
9) Obtain the slant transform matrix for N=8?
10) Obtain the Hadamard transform matrix for N=4?
11) Obtain the Hadamard transform for N=8?
12) Obtain the Walsh transform matrix for N=4?

UNIT – IV
Part- A
1. What is image enhancement? elaborate the kinds of enhancement available?
2. What is point processing?
3. What is contrast stretching? Why is it required?
4. What is the need for reducing the dynamic range of image?
5. What is gray level slicing?
6. What is bit plane slicing?
7. What is histogram?
8. What is histogram equalization?
9. Draw the histogram for bright image and low contrast image?
10. Give the steps in histogram specification?
11. What is spatial filtering?
12. What are the effects of low pass and high pass filtering of images?
13. What is image smoothening? elaborate the kinds available?
14. Explain high boost filtering.
15. Draw the mask for various derivative filters.
16. What is homomorphic filtering?
17. Differentiate restoration and enhancement.
18. What is circulant and block-circulant matrices.
19. What is meant by diagonalization? Why is it required?
20. What is meant by algebraic approach to restoration? elaborate the types?
21. What is constrained and unconstrained restoration?
22. What is inverse filtering?
23. Write the formula for wiener filter.
24. What is parametric wiener filter?
25. What is rubber sheet transformation?
26. What are the basic operations in geometric transformation?
27. What is Gray- level interpolation?

Part –B
1) Explain the various point processing techniques used for image enhancement.
2) With neat diagram histogram processing and Equalization.
3) Explain histogram specification.
4) Explain the different kinds of image smoothening filters.
5) Explain in detail about homomorphic filtering.
6) Explain the concept of degradation model.
7) Explain discrete formulation of degradation model.
8) Describe the process involved in diagonalisation of circulant and block circulant matrices.
9) Explain constrained and unconstrained algebraic approach in detail.
10) Explain inverse filtering in detail.
11) Explain weiner filter in detail.
12) Write notes on Geometric transformation.

Unit V
Part A
1. What is data redundancy?
2. What is coding redundancy?
3. What is variable length coding.
4. What is psychovisual redundancy?
5. Define distance b/w 2 codewords.
6. What is the distance ranging from codewords 101101 & 011101
7. Define info of a random event E
8. What is BSC
9. State Shannon’s channel capacity theorem.
10. What is blocking artifact?
11. What is bit allocation?
12. What is a zonal mask.
13. What are the kinds of discontinuities in a digital image.
14. What is global thresholding
15. What is local thresholding
16. What is dynamic thresholding
17. What is the purpose of image segmentation?
18. Give the 3x3 prewitt mask.
19. Draw the 3x3 sobel mask.
20. What is run length coding?
21. What is direct contour tracing?
22. Define rate distortion function.
23. What is channel matrix?
24. Define mutual info.
25. Mention any 2 variable length coding techniques.

Part B
1. Explain improved gray-scale quantization.
2. Explain the fidelity criteria used for assessment of images.
3. Explain with a neat block diagram a general compression system model.
4. Explain with block diagrams, the source encoder & source decoder used in image compression.
5. Explain briefly about channel encoder & channel decoder used in image compression.
6. Define (a) Entropy of source (b) Conditional entropy
(c) Mutual info. (d) Binary symmetric channel.
7. Explain in detail the rate distortion theory.
8. Explain Huffman coding with an example.
9. For the symbols a,b,c,d,e,f the respective probabilities are p(a)=0.1, p(b)=0.4, p(c)=0.06, p(d)=0.1, p(e)=0.04, p(f)=0.3.
(a) What is avg. length of the code.
(b) What is the Huffman code efficiency.
10. Explain constant area coding.
11. Explain with a neat block diagram, the lossy predictive coding model .
12. What is transform coding? discuss with a neat diagram.
13. Explain zonal coding?
14. Explain briefly about threshold coding.
15. Explain point detection & line detection.
16. Explain the process of edge detection using gradient operators.
17. Explain edge detection using laplacian operator.
18. What is thresholding? discuss in detail.
19. Explain region growing by pixel aggregation
20. Explain edge linking using hough transform.

Earning:   Approval pending.