BIRLA INSTITUTE OF TECHNOLOGY INTERNATIONAL CENTER, RAK- UAE

Department: CS Semester: VII Date : 21/12/2011 Class: BE Subject: Digital Image Processing Question Bank : 2 Subject Code: CP 7107

Image Restoring : Degradations Model - Definitions, Degradation Model for Continuous Functions, Algebraic Approach to Restoration, Unconstrained Restoration, Constrained Restoration, Inverse Filtering Formulation, Removal of Blur Caused by Uniform Linear Motion, Restoration in the Spatial Domain, Geometric. Image Compression : Fundamentals Coding Redundancy, Interpixel Redundancy, Psychovisual Redundancy, Fidelity Criteria. Image Compression Models The Source Encoder and Decoder, The Channel Encoder and Decoder. Elements of Information Theory Measuring Information, The Information Channel, Fundamental Coding Theorems, Using Information Theory. Error-Free Compression Variable-Length Coding, Bit-Plane Coding, Lossless Predictive Coding. Lossy Compression Lossy Predictive Coding, Transform Coding. Question bank 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. Give the model of an image Degradation/Restoration process? Explain inverse filtering for image restoration? What are the operations in geometric transformations? Explain Minimum Mean Square Error (Wiener) filtering? What is constrained least square filtering? Explain? Explain why the sub image obtained with geometric mean filtering is less blurred? Discuss about unconstrained, constrained restorations? What is (a)Data redundancy (b)Compression ratio What are the three basic data redundancies in digital image? With a neat diagram explain in detail a general image compression system model? What are the two classes of fidelity criteria? How can we measure information system? Give the model of an information system? Discuss the functioning of the channel encoder and decoder in a image compression model? With a neat diagram explain the lossy predictive coding model? Draw the relevant diagram for source encoder and source decoder? Discuss the advantages and disadvantages of lossy compression and loss-less compression? Write a short note on elements of information theory for image compression? What are various fundamental coding theorems? Explain variable length coding? Explain bit plane coding? Explain transform coding? Explain lossless predictive coding? What is meant by convolution? Explain with an example how convolution is performed? Explain the distributivity and scaling properties of Fourier transforms? What is padding? What is its need? Refer Page No.218 Q.No 4.21 (Padding Question)?

Text Book : 1. Rafael. C. Gonzalez & Richard E.Woods.- Digital Image Processing, 2/e Pearson Education, New Delhi - 2006 Reference Books : 1. W.K.Pratt.-Digital Image Processing, 3/e Edn., John Wiley & sons, Inc. 2006 2. A.K.Jain.- Fundamentals of Digital Image Processing, PHI, New Delhi, 2006 3. M. Sonka et.al Image Processing, Analysis and Machine Vision, 2/e, Thomson, Learning, India Edition, 2007. Note: Question will be added later subject to important Question for the End Exam..

BIRLA INSTITUTE OF TECHNOLOGY INTERNATIONAL CENTER, RAK- UAE

be_viii>dip.doc Class : BE- VIII
1.

Department of Computer Sc. B.I.T., Mesra Tutorial Sheet

Sub: DIP

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 device's working. How is it different from an area scanner? 5. I 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 is simultaneous contrast and Mach bands. 10. Explain the image formation process in terms of illumination and reflection . What are grayscales and grayvalues 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

BIRLA INSTITUTE OF TECHNOLOGY INTERNATIONAL CENTER, RAK- UAE

21. 22. 23. 24. 25. 26. 27. of intensity between adjacent pixels , what value of m will cause false contouring. Find the fourier's transform for a 2d fn defined as f(x,y) = A ; 0<=x<=K ;0<=y<=K = 0 ; else Enumerate various properties of the discrete fourier's transform . Prove the periodicity of the fourier's transform. Expalin the importance of the term (-1)(x+y) in centering the fourier's transform . Explain the mechanism for convolution . In this respect what is the importance of an unit impulse . Why is padding necessary for convolution of discrete functions State and prove the Shannon Whitaker sampling theorem in the one dimension and two dimension cases Derive the Fast Fourier Transform and compute its complexity for additions and multiplications . What are the algorithms implementation constraints. 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 transform of the convolution of two functions is the product of their fourier's transform's . 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 continous 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. 46. 47. Write a short note on Wiener (least mean square filter) highlighting its advantages and implementation Explain the process of grayscale interpolation . What is linear and bicubic interpolation . Explain the term compression and compression ratio . Justify

BIRLA INSTITUTE OF TECHNOLOGY INTERNATIONAL CENTER, RAK- UAE

48. 49. 50. 51. 52. 53. 54. 55. 56. 57. 58. 59. 60. "reduction in size is not the only criteria for judging the performance of an compression algorithm." Explain the various forms of redundancies with proper examples . What is fidelity criteria How do we represent the entropy of a system . What does a high value of entropy suggest . Derive and discuss the Shannon's noiseless and noisy coding theorems. Explain in detail the huffman's code , the truncated huffman's code and the Huffman shift code , highlighting their relative advantages and disadvantages . 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 Discuss arithmetic coding and bit plane coding. Compare 1D runlength encoding to 2D runlength encoding and discuss thei implementation aspects Eexplain a lossy coding algorithm . What is a lossy predictive algorithm . Compare its performance to a non lossy predictive algorithm Derive a method to calculate optimal predictors Explain a transform coding algorithm . How does such codes remove psycho visual redundancy Discuss in detail the various stages of the JPEG algorithm . What is the importance of Quantization Tables Suggest an algorithm to compress an image using the image histogram How many unique Huffman trees are their for a 3 symbol source code. Construct them