UNIT-1 Q. 1) Explain various image acquisition techniques in detail. Q.

2) Consider the image segment shown below: (8m) 3 1 2 1q 2 2 0 2 1 2 1 1 p1 0 1 2 (i) Let V={0, 1} & compute D4, D8 & Dm distance between p & q (ii) Repeat for V = {1, 2}. Q.3)Consider the image shown, let V = {0, 1} & V = {1, 2}. Compute the length of the shortest 4-, 8- & m-path between p & q. Its particular path does not exist between these two pixels, why? Q. 4) Discuss various aspects related to Digital Image representation and Digital Image Processing. Q. 5) Explain the need of sampling and quantization. How is it implemented in digital image processing system. Q. 6) What do you understand by spatial resolution and gray scale resolution of an image? Explain. Q. 7) Explain the sampling and quantization process used for creating digital image. Q. 8) Explain various image acquisition techniques in detail. Q. 9) Define the terms 4-, 8- & m- path between two points p and q in an image. Q. 10) Discuss the process of obtaining a digital image from a continuous image. Q. 11) Discuss relation of spatial resolution of image with their visibility. Q. 12) Consider 2 image subsets S1 & S2 shown in fig. For V = {1}, determine whether these 2 subsets are: (i) 4-adjacent, (ii) 8-adjacent, (iii) m-adjacent. If yes, find path length between points p (green) & q (red). 0 0 0 0 0 0 0 1 1 0 1 0 0 1 0 0 1 0 0 1 1 0 0 1 0 1 1 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 1 1 1 0 0 1 1 1 Q. 13) Discuss the fundamental steps in digital image processing (6m) Q. 14) Define the following terms: (i) Neighbors of a pixel (ii) Adjacency (iii) Connectivity (iv) Paths (v) Region (vi) Boundaries (vii) City Block distance (viii) Chess Board distance (ix) Euclidean distance Q. 15) Give various applications of Digital Image Processing. Q. 16) A digital camera resembles a human eye. Comment. Q. 17) Explain any one Digital Image Processing system in detail.

UNIT- 2 Q,1) Obtain the 4 length DCT for the following discrete sequence. [1, 3, -2, 4] Q,2) Generate 8 x 8 Harr transform from Harr function and show how it is an orthogonal transform. Q,3) Obtain the 4-length DCT for discrete sequence X(n)= {4,3,-2,5} Q,4) Write Short note on: HAAR Transform. Q,5) Generate 4 x 4 Haar transform from Haar function and show how it is an orthogonal transform. Q,6) For the 2 x 2 transform A and the image U. Calculate the transformed image V and the basic image also. A = 3/2 1/2 U= 2 3 -1/2 3/2 1 2 UNIT-3 Q.1) Explain Histogram Processing? Q.2) Why an ideal LPF not suitable for smoothing operation? Explain how the Gaussian LPF overcomes the drawback of ideal LPF. Q.3) Write in short about Minimum Mean Square Error (Wiener) filtering. Q.4) Suppose F(u, v) is a 2D Fourier transform of an image f(x, y) and a new function G(u, v) is obtained as G(u, v) = f(u/2, v/2). What would be the image g(x, y) after taking the Inverse Fourier transform of G(u, v)? Q.5) Write a short note on Histogram Equalization. Q.6) Write a short note on Bit Plane Slicing. Q.7) Write a short note on Order Statistics Filter. Q.8) The Gray level histogram of an image is given below: Gray Level 0 1 2 3 4 5 6 7 Frequency of occurrence 400 700 1350 2500 3000 1500 550 0 Compute the Gray level histogram of the output image obtained by enhancing the input by histogram equalization technique. [7m] Q.9) What is Histogram Matching? Explain. [5m] Q.10) What are the advantages and disadvantages of median filter? Obtain output image by applying 3 x 3 median filter on the following image. [8m] [ 2 4 15 0] [ 3 5 2 6] [11 0 2 10] [ 6 16 0 2] Q.11) Write a short note on different Gradient filters. Q.12) Explain the following terms in significant details in reference to image enhancement in spatial domain: (i) Contrast Stretching (ii) Histogram Equalization (iii) Bit Plane Slicing (iv) The Laplacian Q.13) Explain Homomorphic filtering in frequency domain. [5m] Q.14) The gray level histogram of an image is given below:

Compute the gray histogram of the output image obtained by enhancing the input by the histogram equalization technique. [9m] Gray Level 0 1 2 3 4 5 6 7 Freq. of Occurrence 123 78 281 417 639 1054 816 688 Q.15) Explain the principle objective of image enhancement process in spatial domain process. Q.16) Explain image subtraction, image averaging and image smoothing through smoothing linear filter. Q.17) A short note on Median Filtering.

UNIT-4 1) Enlist different image compression techniques. Explain any one in brief. 2) Huffman coding algorithm for image compression 3) aeiou! 4) Explain generalized image compression model with neat block diagram. 5) Discuss about image compression. Explain the need of image compression in image processing. 6) Short note on image compression standard. 7) Short note on Lossy Predictive coding. 8) Short note on LZW coding. 9) Explain various types of data redundancies used in digital image compression. 10) Write a short note on Huffman coding. UNIT-5 Explain Heuristic search algorithm for boundary extraction given the edge map of the image. Suppose that an image has the following intensity distributions, where p1(z) corresponds to the intensity of object and p2(z) corresponds to the intensity of the background. Assume that P1 = P2 and find the optimal threshold between object & background pixels. Explain four types of gradient operators. Describe a point detection method for detection of isolated points in an image. Describe the region splitting & merging technique for image segmentation. What do you mean by image Segmentation? Explain techniques used for image segmentation. Explain optimum thresholding and give the equation for A, B & C. State the algorithm for global thresholding. 9) An image contains two types of region R1 & R2. The prior probabilities are P1 = 0.4 & P2 = 0.6 resp. PDF of regions R1 & R2 re denoted by p1(z) & p2(z) resp. where, p1(z) = 0.25 0.0625|4-z| for 0 z 8 p2(z) = 0.2 0.04|9-z| for 4 z 14. Determine the optimum threshold image segmentation. 10) Global Processing via Hough Transform. 11) Region Growing Techniques. 12) Use a Hough Transform to find straight line, given data points at (0,1), (1,1), (2,2) & (3,3). 13) Find the Hough Transform of the points (1,1), (1,5), (5,5), (5,1). Use normal representation of a line.

1) 2)

3) 4) 5) 6) 7) 8)

14) Define Image segmentation. State the property satisfied by the pixels in each region obtained by gray level thresholding technique. Elaborate the terms global, local & dynamic threshold. UNIT-6 1) Explain the chain code for representing a digital image. 2) Write a short note on polygon approximation. 3) Write a short note on Merging and Splitting techniques. 4) What is a signature? Explain in detail signatures of circle, square & equilateral triangle. 5) Explain thinning (or skeletonizing) algorithm. 6) Explain the following terms: (i) Length (ii) diameter (iii)major & minor axis (iv) curvatures (v) eccentricity of boundary descriptors. 7) Write a short note on Fourier Descriptors. 8) Write a short note on Boundary Descriptors. 9) Find the chain code and shape numbers of the images given in figure. Also find the order of shape numbers. Assume 4-connectivity. 10) Explain the chain code descriptors.