Jodhpur Institute of Engineering & Technology
6AIML4-05: Digital Image Processing
Branch: CSE (AI and ML)
Branch: AIML (III Year / VI SEM)
6AIML4-05: Digital Image Processing
UNIT 2
TUTORIAL SHEET
1. Explain Smoothing filters and Sharpening filters in spatial domain.
2. Write a note on Histogram stretching. RTU 2016
3. What is meant by histogram equalization? Explain the process in detail.
4. Explain spatial filtering in image enhancement.
5. Explain the need and process of image averaging.
6. Gray level 0 2 3 4 5 6 7 8 RTU 2016
No of pixels 100 90 85 70 0 0 0 0
Perform histogram stretching so that the new image has a dynamic range of (0, 8)
7. What do you mean by Fourier transforms? Explain its properties.
RTU 2016
8. Write notes on spatial domain methods and Frequency domain methods.
RTU 2016
9. Explain the overall procedure for histogram matching.
10. Explain image enhancement in the frequency domain.
11. What is meant by intensity transformation? Explain in detail.
12. Obtain digital negative of the following 8 level grey scale image.
122 150 210
251 220 225 .
205 154 177
13. A grey level image is given, whose range is 10-60. It is necessary to transform this image to
another image B, whose range should be 120-180. What should be the grey level
transformations?
14. Perform grey level slicing on the following image:
3 4 5
6 6 7
1 2 2
15. Perform Histogram equalization on the following image:
1 3 5
4 4 3
5 2 2
Page 36 of 43
Jodhpur Institute of Engineering & Technology
6AIML4-05: Digital Image Processing
Branch: CSE (AI and ML)
16. Compute the median value of the marked pixel using 3x3 mask.
1 5 7
2 4̇ 6
3 2 1
17. What is Histogram? What is significance of Histogram equalization? Explain process of
Histogram equalization for NxN size image. (GTU 2019)
18. Explain Bitplane slicing method of image representation. What is the significance of this
method in image Compression and Information hiding? (GTU 2019)
19. Explain image subtraction and image averaging methods.
20. Filter the following image using a 3x3 neighbourhood averaging by assuming
(a) Zero padding (b) Pixel replication
1 2 3 2
4 2 5 1
1 2 6 3
2 6 4 7
Note: (a). Zero Padding: (b). Pixel Replication
1 1 2 3 2 2
0 0 0 0 0 0 1 1 2 3 2 2
0 1 2 3 2 0 4 4 2 5 1 1
0 4 2 5 1 0 1 1 2 6 3 3
0 1 2 6 3 0 2 2 6 4 7 7
0 2 6 4 7 0 2 2 6 4 7 7
0 0 0 0 0 0
Page 37 of 43