JNTUWORLD. 4. Prove that the average value of laplacian of the equation 2 h = ((r2 σ 2 )/σ 4 ))exp( r 2 /2σ 2 ) is zero. [16]

Similar documents
IT Digital Image ProcessingVII Semester - Question Bank

SYDE 575: Introduction to Image Processing

3. (a) Prove any four properties of 2D Fourier Transform. (b) Determine the kernel coefficients of 2D Hadamard transforms for N=8.

Chapter 3: Intensity Transformations and Spatial Filtering

Image Processing. BITS Pilani. Dr Jagadish Nayak. Dubai Campus

Image Processing. Traitement d images. Yuliya Tarabalka Tel.

Line, edge, blob and corner detection

Noise Model. Important Noise Probability Density Functions (Cont.) Important Noise Probability Density Functions

Digital Image Procesing

Outlines. Medical Image Processing Using Transforms. 4. Transform in image space

Digital Image Processing, 2nd ed. Digital Image Processing, 2nd ed. The principal objective of enhancement

Babu Madhav Institute of Information Technology Years Integrated M.Sc.(IT)(Semester - 7)

EECS490: Digital Image Processing. Lecture #19

Anno accademico 2006/2007. Davide Migliore

Sharpening through spatial filtering

Filtering and Enhancing Images

Edge detection. Stefano Ferrari. Università degli Studi di Milano Elaborazione delle immagini (Image processing I)

Lecture 7: Most Common Edge Detectors

Image Processing

Biomedical Image Analysis. Point, Edge and Line Detection

Point and Spatial Processing

Classification of image operations. Image enhancement (GW-Ch. 3) Point operations. Neighbourhood operation

Digital Image Processing. Image Enhancement - Filtering

Biomedical Image Analysis. Spatial Filtering

EEM 463 Introduction to Image Processing. Week 3: Intensity Transformations

Digital Image Processing

Edge detection. Gradient-based edge operators

Linear Operations Using Masks

Digital Image Processing

EE795: Computer Vision and Intelligent Systems

Filtering Images. Contents

Digital Image Processing. Image Enhancement in the Spatial Domain (Chapter 4)

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)

Lecture 4: Spatial Domain Transformations

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road UNIT I

Lecture 6: Edge Detection

Comparison between Various Edge Detection Methods on Satellite Image

Digital Image Processing COSC 6380/4393

Computer Vision 2. SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung. Computer Vision 2 Dr. Benjamin Guthier

Fundamentals of Digital Image Processing

Segmentation algorithm for monochrome images generally are based on one of two basic properties of gray level values: discontinuity and similarity.

Digital Image Processing. Prof. P. K. Biswas. Department of Electronic & Electrical Communication Engineering

CS334: Digital Imaging and Multimedia Edges and Contours. Ahmed Elgammal Dept. of Computer Science Rutgers University

C E N T E R A T H O U S T O N S C H O O L of H E A L T H I N F O R M A T I O N S C I E N C E S. Image Operations II

Neighborhood operations

Final Review. Image Processing CSE 166 Lecture 18

Vivekananda. Collegee of Engineering & Technology. Question and Answers on 10CS762 /10IS762 UNIT- 5 : IMAGE ENHANCEMENT.

Filters. Advanced and Special Topics: Filters. Filters

EECS 556 Image Processing W 09. Image enhancement. Smoothing and noise removal Sharpening filters

What will we learn? Neighborhood processing. Convolution and correlation. Neighborhood processing. Chapter 10 Neighborhood Processing

Edge Detection. CSE 576 Ali Farhadi. Many slides from Steve Seitz and Larry Zitnick

Topic 4 Image Segmentation

Feature Detectors - Sobel Edge Detector

Assignment 3: Edge Detection

Texture. Outline. Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation

Local Image preprocessing (cont d)

Chapter 3 Image Enhancement in the Spatial Domain

Edge Detection Lecture 03 Computer Vision

Image Segmentation Image Thresholds Edge-detection Edge-detection, the 1 st derivative Edge-detection, the 2 nd derivative Horizontal Edges Vertical

Other Linear Filters CS 211A

Chapter 10: Image Segmentation. Office room : 841

Concepts in. Edge Detection

Review for Exam I, EE552 2/2009

Chapter 11 Image Processing

A New Technique of Extraction of Edge Detection Using Digital Image Processing

ECG782: Multidimensional Digital Signal Processing

5. Feature Extraction from Images

Sobel Edge Detection Algorithm

BSc (Hons) Computer Science. with Network Security. Examinations for / Semester 2

CS534: Introduction to Computer Vision Edges and Contours. Ahmed Elgammal Dept. of Computer Science Rutgers University

Edge Detection. CS664 Computer Vision. 3. Edges. Several Causes of Edges. Detecting Edges. Finite Differences. The Gradient

Lecture: Edge Detection

EN1610 Image Understanding Lab # 3: Edges

Image Enhancement in Spatial Domain (Chapter 3)

Image Processing. Application area chosen because it has very good parallelism and interesting output.

Lecture 2 Image Processing and Filtering

x' = c 1 x + c 2 y + c 3 xy + c 4 y' = c 5 x + c 6 y + c 7 xy + c 8

What Are Edges? Lecture 5: Gradients and Edge Detection. Boundaries of objects. Boundaries of Lighting. Types of Edges (1D Profiles)

Digital Image Processing (EI424)

Image gradients and edges April 11 th, 2017

Ulrik Söderström 16 Feb Image Processing. Segmentation

An Algorithm for Blurred Thermal image edge enhancement for security by image processing technique

Image gradients and edges April 10 th, 2018

Image Restoration and Reconstruction

Point Operations and Spatial Filtering

ECG782: Multidimensional Digital Signal Processing

Lecture 4: Image Processing

Chapter - 2 : IMAGE ENHANCEMENT

Image Enhancement in Spatial Domain. By Dr. Rajeev Srivastava

CHAPTER 3 IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN

MRT based Fixed Block size Transform Coding

A Robust Method for Circle / Ellipse Extraction Based Canny Edge Detection

CS 4495 Computer Vision. Linear Filtering 2: Templates, Edges. Aaron Bobick. School of Interactive Computing. Templates/Edges

Algorithms for Edge Detection and Enhancement for Real Time Images: A Comparative Study

Point operation Spatial operation Transform operation Pseudocoloring

Edge Detection. Today s reading. Cipolla & Gee on edge detection (available online) From Sandlot Science

Comparative Analysis of Edge Detection Algorithms Based on Content Based Image Retrieval With Heterogeneous Images

Image Restoration and Reconstruction

(10) Image Segmentation

the most common approach for detecting meaningful discontinuities in gray level. we discuss approaches for implementing

Transcription:

Code No: 07A70401 R07 Set No. 2 1. (a) What are the basic properties of frequency domain with respect to the image processing. (b) Define the terms: i. Impulse function of strength a ii. Impulse function shifting property. [16] 2. (a) Give the schematic sketch of R G B color cube? Indicate the primary color vertices on the cube. (b) Explain in brief about pesudocolor image processing. [8+8] 3. Propose a set of gray level slicing transformations capable of producing all the individual bit planes of an 8-bit monochrome Image. [16] 4. Prove that the average value of laplacian of the equation 2 h = ((r2 σ 2 )/σ 4 ))exp( r 2 /2σ 2 ) is zero. [16] 5. Discuss the basics separable transforms. Also give example for it. [16] 6. Explain the following: (a) Arithmetic operations on Images (b) Logical operations on Images. [16] 7. An 8 level image has the gray level distribution given in table. r k P r (r k ) Code 1 L 1 (r k ) Code 2 L 2 (r k ) r 0 = 0 0.19 000 3 11 2 r 1 =1/7 0.25 001 3 01 2 r 2 =1/7 0.21 010 3 10 2 r 3 =3/7 0.10 011 3 001 3 r 4 =4/7 0.08 100 3 0001 4 r 5 =5/7 0.06 101 3 00001 5 r 6 =6/7 0.03 110 3 000001 6 r 7 =1 0.02 111 3 000000 6 (a) compute the average word length for each code and compare the to entropy form part (b) compute entropy of the source. [16] 1

Code No: 07A70401 R07 Set No. 2 8. Explain the following: (a) Gaussian noise (b) Rayleigh noise. [16] 2

Code No: 07A70401 R07 Set No. 4 1. What is homomorphic filtering? Discuss its usefulness in Image enhancement. Explain with the help of block diagram. [16] 2. (a) What are the primary and secondary colors? Give the relation among them. (b) Define the terms hue, saturation and intensity. [8+8] 3. Explain the working of LZW source level encoding with an example. [16] 4. Suggest typical derivative masks for Image enhancement i.e. (a) Roberts (b) Prewitt (c) Sobel. [16] 5. Obtain the total number of additions and multiplications needed for 1-DFFT & 2-D FFT. [16] 6. (a) Explain the significance of the following 3 3 Mask with respect to the digital 1 2 1 image processing 0 0 0 1 2 1 (b) Write an algorithm to impelement the above marking operation. [8+8] 7. The white bars in the test pattern shown in figure 7b are 7 pixels wide and 210 pixels high. The separation between bars is17 pixels. What would this image look like after application of (a) A 3 3 median filter? (b) A 7 7 median filter? [16] Figure 7b 3

Code No: 07A70401 R07 Set No. 4 8. Show that the Sobel and Prewitt Gradient masks of following images give isotropic results for horizontal and vertical edges and for edges oriented at + or - 45 0. f = mag( f)[g 2 x +G2 y] 1/2 and f = Gx + Gy give identical results for edges oriented in the horizontal and vertical directions. [16] Z1 Z2 Z3 Z4 Z5 Z6 Z7 Z8 Z9 4

Code No: 07A70401 R07 Set No. 1 1. Discuss following techniques for Image enhancement (a) Image subtraction (b) Image averaging. [16] 2. Explain the concept of generation of spatial masks from frequency domain specifications. [16] 3. propose a technique for detecting gaps of length ranging between 1 and L pixels in line segment of a binary image. Assume that the lines are 1 pixel thick. Note: base your technique on 8-neighbor connectivity analysis. [16] 4. Explain the following: (a) Color transformation (b) Spatial processing. [16] 5. What is Error Free Compression? Explain about variable length coding. [16] 6. Does fast algorithm is applicable for computation Hadamard transform, if so what are the problems encountered in implementation. [16] 7. A common measure of transmission for digital data is the baud rate, defined as the number of bits transmitted per second. Generally, transmission is accomplished in pockets consisting of starting bit, a byte of information, and a stop bit. Using this approach, answer the following. (a) How many minutes would it take to transmit a 512 512 image with 256 gray levels at 300 baud? (b) What would the time be at 9600 baud? (c) Repeat (a) and (b) for a 1024 1024 image 256 gray levels. [16] 8. Explain about Iterative Nonlinear Restoration Using the Lucy-Richardson Algorithm. [16] 5

Code No: 07A70401 R07 Set No. 3 1. (a) Explain the statement that Fourier transform is viewed as a mathematical prism. (b) Get the expressions for magnitude spectrum, phase spectrum and power spectrum of Fourier transform. [8+8] 2. (a) Explain the need of color image smoothing. (b) Draw the HIS color model and give the expression for R G B interms of HIS. [8+8] 3. Discuss following intensity transformations. (a) Gray level slicing (b) Bit plane slicing. [16] 4. The white bars in the test pattern shown in figure 4b are 7 pixels wide and 210 pixels high. The separation between bars is 17 pixels. What would this image look like after application of (a) A 3 3 geometric mean filter? (b) A 9 9 geometric mean filter? [16] Figure 4b 5. The arithmetic decoding process is the reverse of the encoding procedure. Decode the message 0.23355 given the coding model. [16] Symbol Probabiliy a 0.2 e 0.3 i 0.1 o 0.2 u 0.1! 0.1 6

Code No: 07A70401 R07 Set No. 3 6. Give the expressions for 1D and 2D kernels of Walsh transform, also give the transform expressions. [16] 7. The results obtained by a single through an image of some 2D- masks can also be achieved by two passes using 1-D masks. The results of using a 3 3 smoothing mask with coefficients 1/9 can also be obtained by passing through an image the 1 mask [1 1 1]. The result of this pass is then followed by a pass of the mask. 1. 1 The final result is then scaled by 1/9. Show that the Sobel masks can be implemented by one pass of a differencing mask of the form [-1 0 1] (or it s vertical counterpart) followed By a smoothing mask of the form [1 2 1] (or it s vertical counterpart). [16] 8. Consider the image segment shown below 3 1 2 1(q) 2 2 0 2 1 2 1 1 (p)1 0 1 2 (a) Let V = {0,1} and compute the D4, D8 and Dm distances between p and q (b) repeat for V = {1,2} [16] 7