3. (a) Prove any four properties of 2D Fourier Transform. (b) Determine the kernel coefficients of 2D Hadamard transforms for N=8.

Size: px

Start display at page:

Download "3. (a) Prove any four properties of 2D Fourier Transform. (b) Determine the kernel coefficients of 2D Hadamard transforms for N=8."

Helen Harmon
5 years ago
Views:

1 Set No.1 1. (a) What are the applications of Digital Image Processing? Explain how a digital image is formed? (b) Explain with a block diagram about various steps in Digital Image Processing. [6+10] 2. (a) Explain the process of sampling and quantization of digital image. (b) Explain clearly the principle of projecting 3D points onto a 2D plane. [8+8] 3. (a) Prove any four properties of 2D Fourier Transform. (b) Determine the kernel coefficients of 2D Hadamard transforms for N=8. [8+8] 4. (a) Explain the principle of Hotelling transformation. (b) Explain about RGB color model with neat a diagram. [8+8] 5. (a) Distinguish between smoothing & sharpening techniques. (b) Explain the concept of Gray-level slicing and bit-plane slicing. [8+8] 6. (a) Explain the procedure of diagonalization of circulant matrices. (b) What is meant by inverse filtering? Derive an expression for inverse filtering and what are the draw backs of this method in the presence of noise? [8+8] 7. What are the various approaches in image segmentation? Explain the methods of detecting discontinuities. [16] 8. (a) Draw the block diagram of basic image compression system and explain about each block. (b) Construct a 3-bit IGS code for a given data:{12, 12, 11, 13, 13, 12, 60, 56, 40} that has been uniformly quantized with 6-bit accuracy. [8+8] 1 of 1

2 Set No.2 1. (a) Explain how formation of an image depends on illumination and reflectance component: What are the ranges of these components? (b) Explain various types of connectivity relations between pixels with an example of each. [8+8] 2. (a) Explain the concept of stereo imaging process with a neat diagram. (b) Explain the following image transformations. [8+8] i. Translation ii. Rotation iii. Scaling 3. (a) Develop a successive doubling FFT algorithm for N=8. (b) Determine the kernel coefficients of 2D walsh transform for N=8. [8+8] 4. (a) Obtain the slant transform matrix for N=4 with a procedure. (b) Explain about CMY and YIQ color models. [8+8] 5. (a) Obtain the mask coefficients for derivative filters for 3X3 mask. (b) Explain the filtering method of brightness range compression and contrast enhancement. [8+8] 6. (a) What is the need for diagonaliation of circulant matrices? Explain the diagonalization of circulant matrix. (b) Derive an expression for wiener filtering? [8+8] 7. (a) Explain about Hough transform with an example. (b) Find the edge corresponding to minimum cost path in a section of an image given below where the numbers in parenthesis indicate intensity values and assume that the edge starts in the first column and ends in the last column. [8+8] 1 of 2

3 Set No * * * (2) (1) (0) 1 * * * (1) (1) (7) 2 * * * (6) (8) (2) 8. (a) What are the various types of redundancies and explain them briefly. (b) Develop an arithmetic code for a given data and message sequence: aaieuo! [8+8] Symbol Probability a 0.2 e 0.3 i 0.1 o 0.2 u 0.1! of 2

4 Set No.3 1. (a) What are the applications of Digital Image Processing? Explain how a digital image is formed? (b) Explain with a block diagram about various steps in Digital Image Processing. [6+10] 2. (a) Explain the concept of stereo imaging process with a neat diagram. (b) Explain the following image transformations. [8+8] i. Translation ii. Rotation iii. Scaling 3. (a) Prove any four properties of 2D Fourier Transform. (b) Determine the kernel coefficients of 2D Hadamard transforms for N=8. [8+8] 4. (a) Obtain the Haar transform matrix for N=4 with a procedure. (b) Explain about CMY and YIQ color models. [8+8] 5. (a) Distinguish between spatial domain and frequency domain enhancement techniques. (b) Explain the concept of histogram specification method. [10+6] 6. (a) What is the need for diagonaliation of circulant matrices? Explain the diagonalization of circulant matrices. (b) Derive an expression for Wiener filtering? [8+8] 7. What are the various approaches in image segmentation? Explain the methods of region oriented segmentation. [16] 8. (a) Compare and contrast lossless and lossy predictive coding methods. (b) Develop an Huffman code for a given data symbols. [8+8] Symbol Probability a 0.2 e 0.3 i 0.1 o 0.2 u 0.1! of 2

5 Set No.3 2 of 2

6 Set No.4 1. (a) Explain how formation of an image depends on illumination and reflectance component: What are the ranges of these components? (b) Explain various types of distance measures with an example of each. [8+8] 2. (a) Explain the effect of sampling and quantization of digital image. (b) Explain clearly the principle of projecting 3D points onto a 2D plane. [8+8] 3. (a) Develop a successive doubling FFT algorithm for N=8. (b) Determine the kernel coefficients of 2D DCT transform for N=4. [8+8] 4. (a) Explain the principle of principle component transform. (b) Explain about RGB color model with neat a diagram. [8+8] 5. (a) Explain the principle of high pass and high boost filtering methods. (b) Explain the filtering method of brightness range compression and contrast enhancement. [8+8] 6. (a) Explain the procedure of diagonalization of circulant matrices. (b) What is meant by inverse filtering? Derive an expression for inverse filtering and what are draw backs of this method in the presence of noise. [8+8] 7. (a) Explain about Hough transform with an example. (b) Find the edge corresponding to minimum cost path in a section of an image given below where the numbers in parenthesis indicate intensity values and assume that the edge starts in the first column and ends in the last column. [8+8] * * * (6) (8) (2) 1 * * * (1) (1) (7) 2 * * * (2) (1) (0) 1 of 2

7 Set No.4 8. (a) Draw the block diagram of transform based image compression system and explain about each block. (b) Construct a 3-bit IGS code for a given data: {12, 12, 11, 13, 13, 12, 60, 56, 40} that has been uniformly quantized with 6-bit accuracy. [8+8] 2 of 2

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road UNIT I

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road UNIT I UNIT I IMAGE REPRESENTATION 1. (a)differentiate the features of gray scale and color image. (b)state and prove following properties of 2D DFT: (i) Conjugate symmetry (ii) Frequency translation 2. (a)derive