DIGITAL IMAGE PROCESSING

UNIT 1 ROLL NO 1-14

1. Define Digital Image Processing. Explain the fundamental Steps in Digital Image Processing with a
neat block diagram. 10
2. Explain any 4 applications that used DIP. 10
3. Explain the Components of an Image Processing System with a neat diagram. 6
4. Explain the Process of Image Sensing and Acquisition. 8
5. Illustrate Image Sampling and Quantization with an example. 6
6. Explain with neat diagram, how image is acquired using sensor strips. 8
7. Define 4-, 8- & m-adjacency. Compute the lengths of the shortest 4-, 8- & m-path between p & q in
the image segment shown below by considering V={2,3,4}. 6

3 4 1 2 0
0 1 0 4 2
2 2 3 1 4
3 0 4 2 1
1 2 0 3 4
8. Explain the importance of brightness adaptation and discrimination in image processing. 6
9. Explain ‘false contouring’ and check board pattern in image processing. 6
10. Explain city block distance with an example. 4
11. With the mathematical equation, explain the bicubic interpolation. 5
12. Explain the process of generating a digital image. 5
13. Discuss the most commonly used distance measures between the pixels in digital image processing.6
14. Explain the concept of color spaces in digital image processing. Discuss at least three commonly used
color spaces and their applications. (10)
UNIT 2 ROLL NO 15-28
1. Explain different types of spatial filters used for image smoothing. 10
2. What is image histogram? Discuss histogram equalization for image enhancement. 10
3. Explain the following Basic Intensity Transformation: i) Image Negatives ii) Log Transformations
and iii) Power law transformation. 10
4. Describe Histogram Processing with at least two examples. 10
5. Explain Image Smoothing and Image Sharpening Using Frequency Domain Filters. 10
6. For a given 4x4 image having a gray scales between [0,9] perform histogram equalization and draw
the histogram of the image before and after the equalization . 4x4 image is shown below. 8

7. 2 8. 3 9. 3 10. 2
11. 4 12. 2 13. 4 14. 3
15. 3 16. 2 17. 3 18. 5
19. 2 20. 4 21. 2 22. 4
7. With necessary graph, explain the log & power law transformation used for spatial image
enhancement. 8
8. Explain piece-wise linear contrast stretching with a neat graphical illustration. 5
9. Explain image sharpening in spatial domain using second order Laplacian derivative. 6
10. Explain how the first order derivatives are used in image sharpening. 10

11. Define normalized histogram. Consider a 3 bit image L=8 of size 64 x 64 pixels (MN=4096) with the
intensity distribution given in the table. Perform histogram equalization. 10
 12. Explain smoothing spatial filter.
13. Discuss the concept of image thresholding and its significance in image processing. Provide examples
of applications where thresholding is used. (8)

14. Explain the concept of image segmentation and its importance in digital image processing. Discuss at
least two segmentation techniques and their respective advantages and disadvantages. (10)
UNIT 3 ROLL NO 29-42
1. Explain with block diagram, the basic steps for image filtering in frequency domain. 10
2. Explain the smoothing of images in frequency domain using ideal, butter worth and Gaussian low
pass filter. 8
3. Define 2D DFT with respect to 2D DFT of an image and state the following properties: Translation,
Rotation, Periodicity and Convolution theorem. 5
4. Explain the image smoothing in frequency domain using ideal low pass filter. 8
5. Explain image smoothing and image sharpening using frequency domain filters. 10
6. Obtain the equation for 1D Discrete Fourier transform and its inverse from the continuous
transformed sampled function of one variable. 10
7. Explain any five properties of two dimensional DFT. 10
8. Discuss about 2D DFT and its inverse. Explain any three properties of DFT. 10
9. Discuss the following FDF: Ideal, Butterworth, and Gaussian high pass filter. 10
10. Explain the algorithm for FDF with neat diagram. 10
11. Draw a block diagram of homomorphic filtering for image enhancement and explain it. 10
12. Discuss the concept of spatial domain vs. frequency domain in image processing. Provide examples of
situations where each domain is more suitable for specific image processing tasks. (8)
13. Explain the concept of convolution in image processing. Discuss its role in various image processing
tasks and provide examples. (10)
14. Discuss the concept of phase correlation in image processing. Explain its applications and advantages
over traditional methods. (8)

UNIT 4 ROLL NO 43-56

1. Define local & global threshold. Explain how point detection algorithm works. 10
2. What conditions need to be satisfied while partitioning an image into regions. 10

3. Explain the following gradient operators: 10

i. Roberts cross gradient operators

ii. Prewitt operators
iii. Sobel operators
iv. Prewitt and Sobel mask for detecting diagonal edges.
4. Explain the global processing via Hough transform. 10
5. Explain Marr-Hildreth edge detector in image processing. 10
6. Write a short note on boundary segments. 6
7. Explain Global thresholding using Otsu’s method. 8
8. Explain basic global thresholding with iterative algorithm. 8
9. Explain image gradient and gradient operators of edge detection. 8
10. Discuss the process of region splitting and merging for region based segmentation. 8
11. Discuss the procedure of obtaining segmented regions using split and merge strategy with
example. 10
12. Explain the techniques for detecting three basic types of gray level discontinuities in a digital
Image. 10
13. Describe the procedure of detecting lines using Hough transform. 10
14. Discuss Image segmentation using Thresholding in detail. 10
UNIT 5 ROLL NO 57-70
1. What is image compression? Describe the general compression models with a neat block diagram.10
2. Write a short note on Arithmetic coding and Run length coding. 7
3. Explain the Huffman compression technique. Obtain the Huffman code for the following data given
in the below table. Also compute the average length of the code. 10

Symbol a1 a2 a3 a4 a5 a6
Probability 0.1 0.4 0.06 0.1 0.04 0.3

4. Explain how the wavelet transform can be used for image compression. 7
5. With the help of a block diagram, explain DCT based JPEG compression standard. 10
6. An information source produces sequences of independent symbols A, B, C, D, E, F, G with
corresponding probability 1/3, 1/27, 1/3, 1/9, 1/9, 1/27 & 1/27. Construct a binary code using
Huffman coding algorithm. 7
7. What is image compression? Describe the general compression models with a neat block diagram. 10
8. Write a short note on error-free compression and lossy compression.
9. Discuss the concept of wavelet-based image compression. Compare and contrast wavelet-based
compression with other traditional compression techniques. (10)
10. Explain the concept of lossy compression in image processing. Discuss at least two popular lossy
compression algorithms and their trade-offs. (8)
11. Explain the role of transform-based compression techniques in image processing. Compare and
contrast transforms such as DCT and wavelet transform in compression. (10)
12. Describe the principles of fractal compression in image processing. Discuss its advantages and
limitations compared to other compression techniques. (8)
13. Discuss the concept of predictive coding in image compression. Explain how predictive coding
reduces redundancy in image data and provide examples of predictive coding techniques. (8)
14. Explain the role of entropy coding in image compression. Compare and contrast entropy coding
techniques such as Huffman coding and arithmetic coding. (10)