Module-1 3 1 2 1

1. 2 2 0 2
Mention thematic bands in NASA's LANDSAT satellite, wavelength and uses. (05 1 2 1 1
Marks) p 1 0 12
Consider the image segment shown in Table Q1(b), compute the length of the
shortest 4, 8 and m-path between P and Q for (v={2,3,4}) (06 Marks) c. Find the time required in seconds to transmit a monochrome image
34120 of size 2.5" x 2" scanned at 150 DPI sent at 28 kilo bits per sec. (08
0020 Marks)
2234 1 of 2
P42

c. Explain the process of image acquisition using a single sensor with Module-2
motion to generate a 2-D image. (05 Marks) 4.
2. OR
OR Explain with block diagram the basic steps for image filtering in frequency
Discuss the most commonly used distance measures in image processing. (06 domain. (08 Marks)
Marks) Explain histogram matching. (08 Marks)
Explain the process of generating a digital image. (05 Marks) Explain smoothing in spatial domain. (08 Marks)
With the mathematical equation, explain the bicubic interpolation. (05 Marks) 15EC72
Module-1 Module-2
1. 3.
With the help of a neat diagram, explain the components of general purpose For a given 4x4 image having gray scales between [0, 9] perform histogram
image processing system. (08 Marks) equalization and draw the histogram of image before and after equalization. 4x4
Explain how image is formed in human eye. Suppose a camera is focused at a image is shown in Fig. Q3 (a).
pillar of height 2 meters and situated at a distance of 10 metres. The focal length 2332
of the image produced in camera. (06 Marks) 4243
Consider the two image subsets, (S_{1}) and (S_{2}) as shown in Fig. Q1(c). For V 3235
= {1}, determine whether these two subsets are: 2424
4-adjacent
8-adjacent or Fig. Q3 (a) (08 Marks)
m-adjacent. b. Explain smoothing of images in frequency domain using ideal,
1110 Butterworth and Gaussian Low pass filter. (08 Marks)
1000 OR
1000 4.
0000 Define 2D DFT, with respect to 2D DFT of an image and state the following
properties: (05 Marks)
Fig.Q1(c) (02 Marks) Translation
2. Rotation
OR Periodicity
Explain the following terms: Convolution theorem
False contouring With necessary graphs, explain the log and power law transformation used for
Check board effect spatial image enhancement. (05 Marks)
Distance measure. Compute shortest 4, 8 and m path between p and q for Explain image sharpening in spatial domain using second order Laplacian
v = {1, 2}. derivative. (06 Marks)
 Module-2 4.
3. For the given 4 x 4 image of Table Q4(a) having gray scale between 0
Explain the power law transformation and piece-wise linear contrast stretching to 9, perform histogram equalization and draw the histogram of image
with a neat graphical illustration. (10 Marks) before and after equalization.
Explain with a block diagram, the basic steps for image filtering in frequency 2332
domain. (06 Marks) 4243
4. 3235
OR 2424
Perform histogram equalization of the 5 x 5 image whose data is shown in Table
Q4(a). Table. Q4(a)
Gray level Number of pixels 5.
0 Explain the image smoothing in frequency domain using ideal low
0 pass filter. (08 Marks)
6 Module-2
14 3.
5 Using 2nd order derivative, develop a laplacian mask. (06 Marks)
6 What is linear filtering? (02 Marks)
7 The following table gives the number of pixels at each of the gray levels 0 to 7 in
0 an image.
n_x 0 1 2 3 4 5 6 7
Table Q4(a) (08 Marks) n_r 123 78 281 417 639 816 688
b. Explain the smoothing of images in frequency domain using: (08
Marks) Draw the histogram corresponding to these gray levels. Perform
ideal low pass filter histogram equalization and draw resulting histogram. (08 Marks)
butter worth low pass filter 4.
Module-2 OR
3. Explain Homomorphic filters for image enhancement with necessary equations,
Explain the following enhancement techniques in image processing: block diagram and transfer function. (08 Marks)
(08 Marks) Explain smoothing filters in frequency domain. (04 Marks)
Image Negatives Compute median value of the marked pixels shown below using 3 x 3 mask.
Power law transformation 18 22 33 25 32 24
4. 22 34 26 33 26 22
Discuss homomorphic filtering transformations. (04 Marks) 31 28 22 32 31 28
5. 29 19 31 28 28 22
Develop a method for second order derivative for enhancement in
spatial domain. (06 Marks) Fig.Q4(c) (04 Marks)
Module-3
Module-2 5.
3. Explain the following noise models: (08 Marks)
Explain the following intensity transformation functions: (05 Marks) Gaussian noise
Image negatives Rayleigh noise
ii. Log transformation Impulse noise
iii. Power-law transformation Uniform noise
OR
Explain inverse filter and Wiener filter with the help of equations. Explain the With necessary mathematical equations, explain estimate the degradation
advantages of Wiener filter over inverse filter. (08 Marks) function by modeling. (08 Marks)
6. Module-3
Define the process of image restoration. How is restoration different from 5.
enhancement? (05 Marks) With necessary equations and graph, explain any four noise probability density
What are order statistics filters? List any four such filters. (03 Marks) functions. (08 Marks)
What are adaptive filters? Explain adaptive mean filter and its advantages. (08 Explain minimum mean square error filtering method of restoring images. (08
Marks) Marks)
Module-3 6.
5. OR
What are the most commonly used probability density functions in image Explain how image degradation is estimated using, (08 Marks)
processing applications and explain it with the help of plot. (08 Marks) Observation
With the mathematical equations, discuss the minimum Mean Square Error Mathematical modeling.
Filtering. (08 Marks) Explain the order statistics filters used for restoring images in the presence of
6. noise. (08 Marks)
OR Wiener filter over inverse filter.
Explain the process of restoration in the presence of noise only using spatial Explain inverse filter and Wiener filter with the help of equations. Explain the
filtering for various mean filters. (08 Marks) advantages of Wiener filter over inverse filter. (08 Marks)
What are the three principal ways to estimate the degradation function for use in Explain minimum mean square error filtering (Wiener). (08 Marks)
image restoration and explain it? (08 Marks)
Module-3
5. 7.
Explain the model of image degradation/restoration. (08 Marks) Write the equations for converting colors from HSI to RGB. (06 Marks)
Explain observation and experimentation ways to estimate the degradation Explain how a color lookup table is constructed. (06 Marks)
function. (08 Marks) Explain the following morphological algorithms: (06 Marks)
6. Thinning
OR Thickening
Mention the probability density function, mean, variance of the following noise 8.
models: (08 Marks) What is Pseudo color image processing? Explain intensity slicing as applied to
Gaussian noise pseudo color image processing. (07 Marks)
Rayleigh noise Explain Erosion and Dilation operations used for morphological processing. (07
Gamma noise Marks)
Exponential noise Define wavelet function. (02 Marks)
With relevant expressions, explain minimum mean square filtering (Wiener). (08 Module-4
Marks) 7.
Module-3 Develop a procedure for converting: (08 Marks)
5. RGB to HSI model
Explain the basic model of image restoration process. Explain any four important HSI to RGB model.
noise probability density functions. (10 Marks) Obtain the Haar transform matrix for N = 4. (08 Marks)
Explain minimum mean square error (Wiener) filtering in image processing. (06 8.
Marks) OR
6. Write a note on pseudocolor image processing. Explain intensity slicing as applied
OR to pseudo color image processing. (08 Marks)
Explain adaptive mean filter and list its advantages. (08 Marks) Explain Erosion and Dilation in image processing. (08 Marks)
 Module-4 What is Laplacian of a Gaussian (LoG)? Write a 5 x 5 LoG mask with the graph?
7. (08 Marks)
Classify color models and explain the following color models: (08 Marks) 10.
HSI color model Explain image gradient and gradient operators for Edge detection. (08 Marks)
RGB color model Discuss the process of region splitting and merging for region based
Explain Dilation and Erosion with respect to morphological image processing. (08 segmentation. (08 Marks)
Marks) OR
8. Write the steps to be followed for developing an algorithm for a given binary region
Define multiresolution and explain the subband coding related to multiresolution. R and example it. (08 Marks)
(08 Marks) Mention the aberrations of Minimum Perimeter Polygons (MPP) algorithm and
Perform the following conversions in subband coding: (08 Marks) explain it. (08 Marks)
RGB to HSI Module-5
HSI to RGB 9.
Module-4 Define segmentation and explain segmentation based on discontinuity in intensity
7. levels. (08 Marks)
Explain the process of generating RGB image. (08 Marks) Explain Region Based Segmentation. (08 Marks)
Write the formulas used for converting RGB to HSI. Using these formula find the OR
value of HSI for the given RGB = (0.683, 0.1608, 0.1922). (08 Marks) Briefly explain the basic edge detection and relate first and second order
8. derivative to gray level profile. (08 Marks)
OR Explain the following related to representation and description: (08 Marks)
Draw the block diagram for converting gray level intensity to color transformation Chain codes
and explain it. (08 Marks) Signatures
What is image pyramids? Explain the system for creating approximation and Skeletons
prediction residual pyramids. (08 Marks) Module-5
Module-4 9.
7. Explain Marr-Wildreth edge detector in image processing. (08 Marks)
Explain RGB color model in detail listing its applications. What are Web safe Explain MPP algorithm in image representation (MPP - Minimum Perimeter
colors? (08 Marks) Polygon). (08 Marks)
With the help of block diagram, explain two-band sub-band coding and deciding 10.
system with its spectrum. (08 Marks) Explain basic global thresholding with iterative algorithm. (08 Marks)
8. Explain simple descriptors and Fourier descriptors. (08 Marks)
OR Module-5
What is pseudo color image processing? Explain any one method of pseudo color 9.
image processing. (08 Marks) Explain Marr-Hildreth edge detector. (10 Marks)
Explain erosion and dilation operations used for morphological processing. (08 Write short note on Boundary segments. (06 Marks)
Marks) 10.
Module-5 Explain the following boundary descriptors: (i) Shape numbers (ii) Fourier
9. descriptors. (08 Marks)
Explain Otsu's algorithm for global thresholding using suitable equations. (08 Explain Global Thresholding using Otsu's method. (08 Marks)
Marks)
Explain chain codes for boundary representation. (08 Marks)
OR
Explain the concept of Fourier descriptor for boundary representation. (08 Marks)