SEMESTER-VII

CS 7107
DIGITAL IMAGE PROCESSING
TUTORIAL SHEET
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, B. I. T. MESRA
1. Explain the term "monochromatic digital image. What is a pixel or a pel ?
2. What are the fundamental steps of image processing? What is the significance of a knowledge base in image
processing?
3. Explain the functioning of an acquisition device.
4. Explain in detail a CCD line sensor devices working. How is it different from an area scanner?
5. In reference to image storage what is a frame buffer and a WORM device? Why does image processing require a
high speed memory?
6. Differentiate between software image processing and image processing boards. Justify the advantages that image
processing boards have. Suggest a parallel algorithm to find the brightest pixel in an image.
7. Explain image formation in the eye. In this regard explain the importance of rods and cones.
8. What is brightness adaptation? Plot a graph to depict the eyes adaptability to brightness and its limitations in this
regard.
9. What are simultaneous contrast and Mach bands?
10. Explain the image formation process in terms of illumination and reflection. What are grayscales and gray values?
11. Explain the terms sampling and quantization. What is the effect of varying resolution on the clarity of the image?
12. Explain the process of non uniform quantization and its relative advantage over uniform quantization.
13. Explain the term m-connectivity. In the figure below is A m connected to B
0 1
1(b)
0 1
0
1(a) 0
0
14. Describe an algorithm to count the number of distinct objects in a binary image
15. Even though the Euclidean distance is a standard measurement procedure, city block and chess board distances
are preferred in image measurements. Why?
16. Describe mathematically the processes of image translation, scaling and rotation. Can this operation s be
concatenated into a series of operations? If so how?
17. What is a perspective transformation? What is the need for a free variable in the transformation?
18. Explain stereo imaging. What is the advantage of stereo imaging over perspective transformation?
19. Consider the image segment shown below. Given V={0,1} find D4,D8,Dm distances between p and q .Repeat for
V={1,2}
3 1 2 1(q)
1 2 1 1
1 0 1 2
(p)
20. Suppose that a flat area having its center at (x0, y0) is illuminated by a light source with intensity distribution
i(x,y) = Kexp{-[(x-x0)2+(y-y0)2])
Assume reflectance is 1 and K=255. If the result is digitized with m bits of resolution and the eye can detect an abrupt
change of 8 shades of intensity between adjacent pixels , what value of m will cause false contouring.
21. Find the Fouriers transform for a 2d fn defined as f(x,y) = A ; 0<=x<=K ;0<=y<=K = 0 ; else
22. Enumerate various properties of the discrete Fouriers transform. Prove the periodicity of the Fouriers transform.
23. Expalin the importance of the term (-1)(x+y) in centering the Fouriers transform .
24. Explain the mechanism for convolution. In this respect what is the importance of a unit impulse. Why is padding
necessary for convolution of discrete functions?
25. State and prove the Shannon Whitaker sampling theorem in the one dimension and two dimension cases
26. Derive the Fast Fourier Transform and compute its complexity for additions and multiplications. What are the
algorithms implementation constraints?
27. Describe briefly
a. The Walsh's Transform
b. The Hotelling Transform
c. The DCT
28. Prove

a. Wu+2m, 2m = -Wu, 2m
b. W2ux, 2m = Wux, m
29. Differentiate between the mechanisms of the convolution and correlation operations.
30. Show that the Fourier transforms of the convolution of two functions is the product of their Fouriers transforms.
Assume the functions are one dimensional.
31. Explain bit plane splicing for grayscale images. Suggest an algorithm that utilizes bit plane splicing for
compression of images.
32. Describe histogram equalization. Derive its mathematical formulation. How is histogram matching different from
histogram equalization.
33. Explain the use of masks for image enhancement. What is high boost filtering?
34. What are derivative filters? Explain with examples. What advantages do they provide over sharpening filters?
35. Explain image enhancement in the frequency domain. Differentiate between ideal filters and Butterworth filters.
36. Derive and explain homomorphic filtering.
37. Derive and explain the Moore Penrose generalized inverse function and its importance
38. Explain why the discrete histogram equalization technique in general will not yield a flat histogram.
39. Present an algorithm for performing local histogram equalization over neighborhoods of size n x n.
40. Explain median filtering and its use in removing salt and pepper noise.
41. Discuss the continuous degradation model and in this respect explain circulization of the degradation matrix.
42. Discuss the discrete formulation of the degradation model. What is the advantage offered by diagonalization
43. Compare constrained and unconstrained methods of restoration deriving their respective mathematical models
44. What is inverse filtering? Show that removal of blur blur due to motion is a special case of inverse filtering
45. Write a short note on Wiener (least mean square filter) highlighting its advantages and implementation
46. Explain the process of grayscale interpolation. What is linear and bicubic interpolation.
47. Explain the term compression and compression ratio. Justify "reduction in size is not the only criteria for
judging the performance of an compression algorithm."
48. Explain the various forms of redundancies with proper examples. What are fidelity criteria?
49. How do we represent the entropy of a system? What does a high value of entropy suggest?
50. Derive and discuss the Shannon's noiseless and noisy coding theorems.
51. Explain in detail the Huffmans code, the truncated huffmans code and the Huffman shift code, highlighting their
relative advantages and disadvantages.
52. Encode the following grayscale sequence with a suitable algorithm
50 50 50 50 51 52 52 52 51 50 50 50 50 50 51 52 52 51
53. Discuss arithmetic coding and bit plane coding.
54. Compare 1D runlength encoding to 2D run length encoding and discuss their implementation aspects
55. Explain a lossy coding algorithm. What is a lossy predictive algorithm? Compare its performance to a non lossy
predictive algorithm
56. Derive a method to calculate optimal predictors
57. Explain a transform coding algorithm. How does such code remove psycho visual redundancy?
58. Discuss in detail the various stages of the JPEG algorithm. What is the importance of Quantization Tables?
59. Suggest an algorithm to compress an image using the image histogram
60. How many unique Huffman trees are their for a 3 symbol source code. Construct them