Reg. No. Question Paper Code : 23412 4 MBEWDECEMBER 2018 BE/B Tech. DEGREE EXAMINATION, NOVE! Seventh Semester Electronica and Communication Engineering pROCESSING Engineering) EC 2029 ~ DIGITAL IMAG (Common to Electronics and Instrumentation ital Imag (Also Common to PTEC 2029 - Digit ECE - Regul: Seventh Semester — Maximum : 100 marks ‘Time : Three hours ‘Answer ALL questions. PART A— (10 x 2= 20 marks) 1. Define brightness. Find the number of bits required to store a 256 x 256 image with 32 gray levels. 3. What is contrast stretching? Mention the limitations of averaging filters. Differentiate between image enhancement and image restoration. 6. How is a degradation process modeled? What are the three types of discontinuity in digital image? 8 Define region splitting and merging. 9. What is the need for compression? Draw the block diagram of general image compression system model. 10. www. Vidyarthiplus.comWww. Vidyarthiplus.com PART B — (6 « 16 = 80 marks) Mu @ @ @) — Expla : ieation with neat dingramn, 0% concepts of sampling and quantin on ) aw 5 (1) Determine the DCT matrix for M = 4 . Or ine a , process ©) Deseribe in detail about the elements of digit image F (8) system of RGB to HIS Gi) Tlustrate about RGB model and state the conversion @) model. tion for the 12 (a) Describe histogram equalization. Obtain Hise ng eayence on imag? following inee sepaunt ob mash toma : segment before and after equalization. . diaper ‘ 2 5 4 38 35 6 5 3}. 84) ba 444 4 4 os @) (©) @ Explain in detail about spatial filtering with an example. = f homomorphic filtering. Gi) Describe the principle o} is helpful to reduce the mean square error? (8) tion in image 13. (a) (@ How wiener filtering trie transformat 6) (i) Elucidate the principle of geomet restoration. Or (b) Explain the constrained least square filtering for image res! derive its transfer function. toration and using Hough transform. (10) 14. (a) (@ Explain the procese of edge linking ntation with an example, © Gi) Describe thresholding based segme! Or (b) Discuss the principle of image segmentation by watershed transformation and mention its drawback. Determine the Huffman code for the following data. P(a,)=0.4, P(a,)=0.2, P(a3)=0.2, P(a,)=0.1, P(as)=0-1 Compute the average Jength of code, entropy of the source and redundancy. \ 15. (a) Or (b) Explain the JPEG image compression standard with neat block diagram. ‘2: 93412www. Vidyarthiplus.com Reg. No. et [ Question Paper Code : 30908 2019. B.E/B.Tech. DEGREE EXAMINATIONS, APRIL/MAY Seventh Semester Electronics and Communication Engineering A iV EC 2029 — DIGITAL IMAGE PROCESSING (Common to Electronics and Instrumentation Engineering) ‘ (Regulation 2008) (Also common to PTEC 2029 — Digital Image Processing for B.E. (Part-Time) Seventh Semester - ECE — Regulation 2009) ‘Time : Three hours Maximum : 100 marks Answer ALL questions. PART A— (10 x 2 = 20 marke) 1. Define Quantization. 2. Give the properties of two-dimensional DFT. 3. What is Image Enhancement? 4. Name the different types of derivative filters. 5. What is the limitations of wienere filtering? 6. Draw the image degradation / restoration model. 7. What are-two main types of Data compression? 8. Define B-frame. 9. How the discontinuity is detected in an image using segmentation? 10. What is thinking or skeletonizing algorithm? www. Vidyarthiplus.com13. 14. 15. (@) (b) (a) (by (a) (b) f) ) @ (b) www. Vidyarthiplus.com PART B — (6 « 16 = 80 marks) Explain : ait (6) Explain 2D discrete cosine transform and mention 1t8 propert! Or Draw the functional block d: scital image processing jiagram of a digital ime 3 and explain the operation of various blocks with suitable © application. system xample (16) dure detail about the pro’e (16) What is histogram equalization? Discuss in Tae See table example: involved in histogram machine by taking 4 844 Or @) Explain briefly about the conce} an image. (i) Write a brief note on the types of noise corres with their characteristics. i ing in enhancing pt of spatial. averaging in © a image along ing the 1 8) 7 the constrained least plain about a6) With necessary equation, briefly squares filtering. Or @) What ie inverse filtering? Explain and mention (ii) With necessary expressions, explain how wiener filters can be used for restoring the images. (10) ‘its’ limitation. 6) Illustrate with suitable examples, how are gradient and laplacian operators used for detecting the edges. se) Or Explain in detail how an image is segmented using merging algorithm by taking an example. Briefly explain the necessity for data com runlength coding technique can be used for ima a suitable example.Download STUCOR App for all subject B.E/B. Tech. DEGREE Sixth/Seventh Semester Information Technology TT 6005 — DIGITAL IMAGE PROCESSING Engi ring, (Common to Biomedical Engineering, Computer Eclat nett Control Electronics and Communication Engineering, Inewwte™, Ylectronics and Engineering, Mechatronics En} Modicel , gineering, Tnetramntation Engineering) ulations 2018) os Meximum : 100 marks Time : Three hours 10. ‘Answer ALL questions. PART A— (10 x 2= 20 marks) When is fine sampling and coarse eampling used? What is the function of an image sensor? Differentiate between image enhancement and restoration. If all the pixels in an image are chuffled, will there be any change in the histogram? Justify your answer. Why the restoration is called as ‘unconstrained restoration? Define region growing. What is run length coding? What are the operations performed by error free compression? Does the use of chain code compress the seeere aye information of an object contour? What is meant: by pattern classes?Ro 12. 13. 14. 15. Cess 3,0004 Study (a) (b) @ (b) @) (b) () ) (@) () 1% ; st Materials for Semester Exams via PART B —(6 = 16 = 80 marks) Explain the components of image processing system oe antization. (8) @ Discuss the effecta of non uniform sampling and av i yt pace resented using HSI color ®1 a Gi) Explain how color images are rep: model, : 1 ‘ med in spatial Explain the various enhancement techniques perfor . domain. Or inet ire’ of a paint If a low pass filter is formed that averages the este sitet function (x, y) but excludes point (x, 7) itself: Find the eque see iter. H(u, v) in the frequency domain. Show that it is low pass fill < ify i tages: Derive a Wiener filter for image restoration and specify ite advantage over inverse filter. Or Explain region splitting and merging technique for image segmentation with suitable examples. With a neat block diagram, explain transform based Image compression scheme. Also give two valid reasons for the choice of “Discrete Cosine Transform” in JPEG image compression standard. Or Encode the sentence ‘I LOVE IMAGE PROCESSING’ using arithmetic coding procedure. Explain in detail about the object recognition techniques based on matching. Or Explain the various boundary descriptors in detail with a neat diagram. UCOR ApP