1.Discuss the frequency domain techniques of image enhancement in detail.

Save this PDF as:

Size: px
Start display at page:

Download "1.Discuss the frequency domain techniques of image enhancement in detail."

Transcription

1 1.Discuss the frequency domain techniques of image enhancement in detail. Enhancement In Frequency Domain: The frequency domain methods of image enhancement are based on convolution theorem. This is represented as, g(x, y) = h (x, y)*f(x, y) Where. g(x, y) = Resultant image h(x, y) = Position invariant operator f(x, y)= Input image The Fourier transform representation of equation above is, G (u, v) = H (u, v) F (u, v) The function H (u, v) in equation is called transfer function. It is used to boost the edges of input image f (x, y) to emphasize the high frequency components. The different frequency domain methods for image enhancement are as follows. 1. Contrast stretching. 2. Clipping and thresholding. 3. Digital negative. 4. Intensity level slicing and 5. Bit extraction. 1. Contrast Stretching: Due to non-uniform lighting conditions, there may be poor contrast between the background and the feature of interest. Figure 1.1 (a) shows the contrast stretching transformations. Fig.1.1 (a) Histogram of input image GRIET/ECE 1

2 Fig.1.1 (b) Linear Law These stretching transformations are expressed as Fig.1.1 (c) Histogram of the transformed image In the area of stretching the slope of transformation is considered to be greater than unity. The parameters of stretching transformations i.e., a and b can be determined by examining the histogram of the image. 2. Clipping and Thresholding: Clipping is considered as the special scenario of contrast stretching. It is the case in which the parameters are α = γ = 0. Clipping is more advantageous for reduction of noise in input signals of range [a, b]. Threshold of an image is selected by means of its histogram. Let us take the image shown in the following figure 1.2. GRIET/ECE 2

3 \ Fig. 1.2 The figure 1.2 (b) consists of two peaks i.e., background and object. At the abscissa of histogram minimum (D1) the threshold is selected. This selected threshold (D1) can separate background and object to convert the image into its respective binary form. The thresholding transformations are shown in figure 1.3. Fig Digital Negative: The digital negative of an image is achieved by reverse scaling of its grey levels to the transformation. They are much essential in displaying of medical images. A digital negative transformation of an image is shown in figure 1.4. GRIET/ECE 3

4 Fig Intensity Level Slicing: The images which consist of grey levels in between intensity at background and other objects require to reduce the intensity of the object. This process of changing intensity level is done with the help of intensity level slicing. They are expressed as The histogram of input image and its respective intensity level slicing is shown in the figure 1.5. Fig.1.5 GRIET/ECE 4

5 When an image is uniformly quantized then, the n th most significant bit can be extracted and displayed. Let, u = k 1 2 B-1 + k 2 2 B k B k B Then, the output is expressed as 2. Distinguish between spatial domain and frequency domain enhancement techniques. The spatial domain refers to the image plane itself, and approaches in this category are based on direct manipulation of pixels in an image. Frequency domain processing techniques are based on modifying the Fourier transform of an image. The term spatial domain refers to the aggregate of pixels composing an image and spatial domain methods are procedures that operate directly on these pixels. Image processing function in the spatial domain may he expressed as. g(x, y) = T[f(x, y)] Where (x, y). f(x, y) is the input image g(x, y) is the processed image and T is the operator on f defined over some neighborhood values of Frequency domain techniques are based on convolution theorem. Let g(x, y) be the image formed by the convolution of an image f(x, y) and linear position invariant operation h(x, y) i.e., Applying convolution theorem g(x, y) = h(x, y) * f(x, y) G(u, v) = H(u, v) F(u, v) GRIET/ECE 5

6 Where G, H and F are the Fourier transforms of g, h and f respectively. In the terminology of linear system the transform H (u, v) is called the transfer function of the process. The edges in f(x, y) can he boosted by using H (u, v) to emphasize the high frequency components of F (u, v). 3. Explain about Ideal Low Pass Filter (ILPF) in frequency domain. Lowpass Filter: The edges and other sharp transitions (such as noise) in the gray levels of an image contribute significantly to the high-frequency content of its Fourier transform. Hence blurring (smoothing) is achieved in the frequency domain by attenuating us the transform of a given image. G (u, v) = H (u, v) F(u, v) where F (u, v) is the Fourier transform of an image to be smoothed. The problem is to select a filter transfer function H (u, v) that yields G (u, v) by attenuating the high-frequency components of F (u, v). The inverse transform then will yield the desired smoothed image g (x, y). Ideal Filter: A 2-D ideal lowpass filter (ILPF) is one whose transfer function satisfies the relation where D is a specified nonnegative quantity, and D(u, v) is the distance from point (u, v) to the origin of the frequency plane; that is, Figure 3 (a) shows a 3-D perspective plot of H (u, v) u a function of u and v. The name ideal filter indicates that oil frequencies inside a circle of radius GRIET/ECE 6

7 Fig.3 (a) Perspective plot of an ideal lowpass filter transfer function; (b) filter cross section. Do are passed with no attenuation, whereas all frequencies outside this circle are completely attenuated. The lowpass filters are radially symmetric about the origin. For this type of filter, specifying a cross section extending as a function of distance from the origin along a radial line is sufficient, as Fig. 3 (b) shows. The complete filter transfer function can then be generated by rotating the cross section 360 about the origin. Specification of radially symmetric filters centered on the N x N frequency square is based on the assumption that the origin of the Fourier transform has been centered on the square. For an ideal lowpass filter cross section, the point of transition between H(u, v) = 1 and H(u, v) = 0 is often called the cutoff frequency. In the case of Fig.3 (b), for example, the cutoff frequency is Do. As the cross section is rotated about the origin, the point Do traces a circle giving a locus of cutoff frequencies, all of which are a distance Do from the origin. The cutoff frequency concept is quite useful in specifying filter characteristics. It also serves as a common base for comparing the behavior of different types of filters. The sharp cutoff frequencies of an ideal lowpass filter cannot be realized with electronic components, although they can certainly be simulated in a computer. GRIET/ECE 7

8 4. Discuss about Butterworth lowpass filter with a suitable example. Butterworth filter: The transfer function of the Butterworth lowpass (BLPF) of order n and with cutoff frequency locus at a distance Do, from the origin is defined by the relation A perspective plot and cross section of the BLPF function are shown in figure 4. Fig.4 (a) A Butterworth lowpass filter (b) radial cross section for n = 1. Unlike the ILPF, the BLPF transfer function does not have a sharp discontinuity that establishes a clear cutoff between passed and filtered frequencies. For filters with smooth transfer functions, defining a cutoff frequency locus at points for which H (u, v) is down to a certain fraction of its maximum value is customary. In the case of above Eq. H (u, v) = 0.5 (down 50 percent from its maximum value of 1) when D (u, v) = Do. Another value commonly used is 1/ 2 of the maximum value of H (u, v). The following simple modification yields the desired value when D (u, v) = Do: GRIET/ECE 8

9 5. Discuss about Ideal High Pass Filter and Butterworth High Pass filter. High pass Filtering: An image can be blurred by attenuating the high-frequency components of its Fourier transform. Because edges and other abrupt changes in gray levels are associated with high-frequency components, image sharpening can be achieved in the frequency domain by a high pass filtering process, which attenuates the low-frequency components without disturbing high-frequency information in the Fourier transform. Ideal filter: 2-D ideal high pass filter (IHPF) is one whose transfer function satisfies the relation where Do is the cutoff distance measured from the origin of the frequency plane. Figure 5.1 shows a perspective plot and cross section of the IHPF function. This filter is the opposite of the ideal lowpass filter, because it completely attenuates all frequencies inside a circle of radius Do while passing, without attenuation, all frequencies outside the circle. As in the case of the ideal lowpass filler, the IHPF is not physically realizable. Fig.5.1 Perspective plot and radial cross section of ideal high pass filter GRIET/ECE 9

10 s Butterworth filter: The transfer function of the Butterworth high pass filter (BHPF) of order n and with cutoff frequency locus at a distance Do from the origin is defined by the relation Figure 5.2 shows a perspective plot and cross section of the BHPF function. Note that when D (u, v) = Do, H (u, v) is down to ½ of its maximum value. As in the case of the Butterworth lowpasss filter, common practice is to select the cutoff frequency locus at points for which H (u, v) is down to 1/ 2 of its maximum value. Fig.5.2 Perspective plot and radial cross section for Butterworth High Pass Filter with n = 1 GRIET/ECE 10

11 6. Discuss about Gaussian High Pass and Gaussian Low Pass Filter. Gaussian Lowpass Filters: The form of these filters in two dimensions is given by where, D(u, v) is the distance from the origin of the Fourier transform. Fig.6.1 (a) Perspective plot of a GLPF transfer function, (b) Filter displayed as an image, (c) Filter radial cross sections for various values of Do. σ is a measure of the spread of the Gaussian curve. By letting σ = Du, we can express the filter in a more familiar form in terms of the notation: where Do is the cutoff frequency. When D (u, v) = Do, the filter is down to of its maximum value. Gaussian Highpass Filters: The transfer function of the Gaussian highpass filter (GHPF) with cutoff frequency locus at a distance Do from the origin is given by GRIET/ECE 11

12 The figure 6.2 shows a perspective plot, image, and cross section of the GHPF function. Fig.6.2. Perspective plot, image representation, and cross section of a typical Gaussian high pass filter Even the filtering of the smaller objects and thin bars is cleaner with the Gaussian filler. 7. Explain how Laplacian is implemented in frequency domain. The Laplacian in the Frequency Domain: It can be shown that From this simple expression, it follows that The expression inside the brackets on the left side of the above Eq. is recognized as the Laplacian of f(x, y). Thus, we have the important result GRIET/ECE 12

13 which simply says that the Laplacian can be implemented in the frequency domain by using the filter As in all filtering operations, the assumption is that the origin of F (u, v) has been centered by performing the operation f(x, y) (-1) x+y prior to taking the transform of the image. If f (and F) are of size M X N, this operation shifts the center transform so that (u, v) = (0, 0) is at point (M/2, N/2) in the frequency rectangle. As before, the center of the filter function also needs to be shifted: The Laplacian-filtered image in the spatial domain is obtained by computing the inverse Fourier transform of H (u, v) F (u, v): Conversely, computing the Laplacian in the spatial domain and computing the Fourier transform of the result is equivalent to multiplying F(u, v) by H(u, v). We express this dual relationship in the familiar Fourier-transform-pair notation The spatial domain Laplacian filter function obtained by taking the inverse Fourier transform of Eq. has some interesting properties, as Fig.7 shows. Figure 7(a) is a 3-D perspective plot. The function is centered at (M/2, N/2), and its value at the top of the dome is zero. All other values are negative. Figure 7(b) shows H (u, v) as an image, also centered. Figure 7(c) is the Laplacian in the spatial domain, obtained by multiplying by H (u, v) by (-1) u+v, taking the inverse Fourier transform, and multiplying the real part of the result by (-l) x+y. Figure 7(d) is a zoomed section at about the origin of Fig.7(c).' Figure 7(e) is a horizontal gray-level profile passing through the center of the zoomed section. Finally, Fig.7 (f) shows the mask to implement the definition of the discrete Laplacian in the spatial domain. GRIET/ECE 13

14 Fig.7 (a) 3-D plot of Laplacian in the frequency domain, (b) Image representation of (a), (c) Laplacian in the spatial domain obtained from the inverse DFT of (b) (d) Zoomed section of the origin of (c). (e) Gray-level profile through the center of (d). (f) Laplacian mask GRIET/ECE 14

15 A horizontal profile through the center of this mask has the same basic shape as the profile in Fig. 7(e) (that is, a negative value between two smaller positive values). We form an enhanced image g(x, y) by subtracting the Laplacian from the original image: 8. Write about high boost and high frequency filtering. High-Boost Filtering and High-Frequency Emphasis Filtering: All the filtered images have one thing in common: Their average background intensity has been reduced to near black. This is due to the fact that the highpass filters we applied to those images eliminate the zero-frequency component of their Fourier transforms. In fact, enhancement using the Laplacian does precisely this, by adding back the entire image to the filtered result. Sometimes it is advantageous to increase the contribution made by the original image to the overall filtered result. This approach, called high-boost filtering, is a generalization of unsharp masking. Unsharp masking consists simply of generating a sharp image by subtracting from an image a blurred version of itself. Using frequency domain terminology, this means obtaining a highpass-filtered image by subtracting from the image a lowpass-filtered version of itself. That is High-boost filtering generalizes this by multiplying f (x, y) by a constant A > 1: Thus, high-boost filtering gives us the flexibility to increase the contribution made by the image to the overall enhanced result. This equation may be written as Then, using above Eq. we obtain This result is based on a highpass rather than a lowpass image. When A = 1, high-boost filtering reduces to regular highpass filtering. As A increases past 1, the contribution made by the image itself becomes more dominant. GRIET/ECE 15

16 We have F hp (u,v) = F (u,v) F lp (u,v). But F lp (u,v) = H lp (u,v)f(u,v), where H lp is the transfer function of a lowpass filter. Therefore, unsharp masking can be implemented directly in the frequency domain by using the composite filter Similarly, high-boost filtering can be implemented with the composite filter with A > 1. The process consists of multiplying this filter by the (centered) transform of the input image and then taking the inverse transform of the product. Multiplication of the real part of this result by (-l) x+y gives us the high-boost filtered image f hb (x, y) in the spatial domain. 9. Explain the concept of homomorphic filtering. Homomorphic filtering: The illumination-reflectance model can be used to develop a frequency domain procedure for improving the appearance of an image by simultaneous gray-level range compression and contrast enhancement. An image f(x, y) can be expressed as the product of illumination and reflectance components: Equation above cannot be used directly to operate separately on the frequency components of illumination and reflectance because the Fourier transform of the product of two functions is not separable; in other words, GRIET/ECE 16

17 where F i (u, v) and F r (u, v) are the Fourier transforms of ln i(x, y) and ln r(x, y), respectively. If we process Z (u, v) by means of a filter function H (u, v) then, from where S (u, v) is the Fourier transform of the result. In the spatial domain, Now we have Finally, as z (x, y) was formed by taking the logarithm of the original image f (x, y), the inverse (exponential) operation yields the desired enhanced image, denoted by g(x, y); that is, Fig.9.1 Homomorphic filtering approach for image enhancement GRIET/ECE 17

18 and are the illumination and reflectance components of the output image. The enhancement approach using the foregoing concepts is summarized in Fig This method is based on a special case of a class of systems known as homomorphic systems. In this particular application, the key to the approach is the separation of the illumination and reflectance components achieved. The homomorphic filter function H (u, v) can then operate on these components separately. The illumination component of an image generally is characterized by slow spatial variations, while the reflectance component tends to vary abruptly, particularly at the junctions of dissimilar objects. These characteristics lead to associating the low frequencies of the Fourier transform of the logarithm of an image with illumination and the high frequencies with reflectance. Although these associations are rough approximations, they can be used to advantage in image enhancement. A good deal of control can be gained over the illumination and reflectance components with a homomorphic filter. This control requires specification of a filter function H (u, v) that affects the low- and high-frequency components of the Fourier transform in different ways. Figure 9.2 shows a cross section of such a filter. If the parameters γ L and γ H are chosen so that γ L < 1 and γ H > 1, the filter function shown in Fig. 9.2 tends to decrease the contribution made by the low frequencies (illumination) and amplify the contribution made by high frequencies (reflectance). The net result is simultaneous dynamic range compression and contrast enhancement. Fig.9.2 Cross section of a circularly symmetric filter function D (u. v) is the distance from the origin of the centered transform. GRIET/ECE 18

19 GRIET/ECE 19

Fourier Transforms and the Frequency Domain

Fourier Transforms and the Frequency Domain Lecture 11 Magnus Gedda magnus.gedda@cb.uu.se Centre for Image Analysis Uppsala University Computer Assisted Image Analysis 04/27/2006 Gedda (Uppsala University)

CoE4TN4 Image Processing. Chapter 3: Intensity Transformation and Spatial Filtering

CoE4TN4 Image Processing Chapter 3: Intensity Transformation and Spatial Filtering Image Enhancement Enhancement techniques: to process an image so that the result is more suitable than the original image

Image Smoothening and Sharpening using Frequency Domain Filtering Technique

Volume 5, Issue 4, April (17) Image Smoothening and Sharpening using Frequency Domain Filtering Technique Swati Dewangan M.Tech. Scholar, Computer Networks, Bhilai Institute of Technology, Durg, India.

Filtering. Image Enhancement Spatial and Frequency Based

Filtering Image Enhancement Spatial and Frequency Based Brent M. Dingle, Ph.D. 2015 Game Design and Development Program Mathematics, Statistics and Computer Science University of Wisconsin - Stout Lecture

DIGITAL IMAGE PROCESSING UNIT III

DIGITAL IMAGE PROCESSING UNIT III 3.1 Image Enhancement in Frequency Domain: Frequency refers to the rate of repetition of some periodic events. In image processing, spatial frequency refers to the variation

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad - 500 043 ELECTRONICS AND COMMUNICATION ENGINEERING QUESTION BANK Course Title Course Code Class Branch DIGITAL IMAGE PROCESSING A70436 IV B. Tech.

IMAGE ENHANCEMENT IN SPATIAL DOMAIN

A First Course in Machine Vision IMAGE ENHANCEMENT IN SPATIAL DOMAIN By: Ehsan Khoramshahi Definitions The principal objective of enhancement is to process an image so that the result is more suitable

Digital Image Processing

Digital Image Processing Part 2: Image Enhancement Digital Image Processing Course Introduction in the Spatial Domain Lecture AASS Learning Systems Lab, Teknik Room T26 achim.lilienthal@tech.oru.se Course

Head, IICT, Indus University, India

International Journal of Emerging Research in Management &Technology Research Article December 2015 Comparison Between Spatial and Frequency Domain Methods 1 Anuradha Naik, 2 Nikhil Barot, 3 Rutvi Brahmbhatt,

Prof. Vidya Manian Dept. of Electrical and Comptuer Engineering

Image Processing Intensity Transformations Chapter 3 Prof. Vidya Manian Dept. of Electrical and Comptuer Engineering INEL 5327 ECE, UPRM Intensity Transformations 1 Overview Background Basic intensity

Image Enhancement in Spatial Domain

Image Enhancement in Spatial Domain 2 Image enhancement is a process, rather a preprocessing step, through which an original image is made suitable for a specific application. The application scenarios

Image Processing Lecture 4

Image Enhancement Image enhancement aims to process an image so that the output image is more suitable than the original. It is used to solve some computer imaging problems, or to improve image quality.

Digital Image Processing

Digital Image Processing Lecture # 5 Image Enhancement in Spatial Domain- I ALI JAVED Lecturer SOFTWARE ENGINEERING DEPARTMENT U.E.T TAXILA Email:: ali.javed@uettaxila.edu.pk Office Room #:: 7 Presentation

8.2 IMAGE PROCESSING VERSUS IMAGE ANALYSIS Image processing: The collection of routines and

8.1 INTRODUCTION In this chapter, we will study and discuss some fundamental techniques for image processing and image analysis, with a few examples of routines developed for certain purposes. 8.2 IMAGE

Lecture #10. EECS490: Digital Image Processing

Lecture #10 Wraparound and padding Image Correlation Image Processing in the frequency domain A simple frequency domain filter Frequency domain filters High-pass, low-pass Apodization Zero-phase filtering

DIGITAL IMAGE PROCESSING Quiz exercises preparation for the midterm exam

DIGITAL IMAGE PROCESSING Quiz exercises preparation for the midterm exam In the following set of questions, there are, possibly, multiple correct answers (1, 2, 3 or 4). Mark the answers you consider correct.

Spatial Domain Processing and Image Enhancement

Spatial Domain Processing and Image Enhancement Lecture 4, Feb 18 th, 2008 Lexing Xie EE4830 Digital Image Processing http://www.ee.columbia.edu/~xlx/ee4830/ thanks to Shahram Ebadollahi and Min Wu for

Midterm Review. Image Processing CSE 166 Lecture 10

Midterm Review Image Processing CSE 166 Lecture 10 Topics covered Image acquisition, geometric transformations, and image interpolation Intensity transformations Spatial filtering Fourier transform and

COMPREHENSIVE EXAMINATION WEIGHTAGE 40%, MAX MARKS 40, TIME 3 HOURS, DATE Note : Answer all the questions

BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE PILANI, DUBAI CAMPUS, DUBAI INTERNATIONAL ACADEMIC CITY DUBAI I SEM 212-213 IMAGE PROCESSING EA C443 (ELECTIVE) COMPREHENSIVE EXAMINATION WEIGHTAGE 4%, MAX MARKS

PRACTICAL IMAGE AND VIDEO PROCESSING USING MATLAB

PRACTICAL IMAGE AND VIDEO PROCESSING USING MATLAB OGE MARQUES Florida Atlantic University *IEEE IEEE PRESS WWILEY A JOHN WILEY & SONS, INC., PUBLICATION CONTENTS LIST OF FIGURES LIST OF TABLES FOREWORD

Image Enhancement in the Spatial Domain

Image Enhancement in the Spatial Domain Algorithms for improving the visual appearance of images Gamma correction Contrast improvements Histogram equalization Noise reduction Image sharpening Optimality

Image Processing for feature extraction

Image Processing for feature extraction 1 Outline Rationale for image pre-processing Gray-scale transformations Geometric transformations Local preprocessing Reading: Sonka et al 5.1, 5.2, 5.3 2 Image

DIGITAL IMAGE PROCESSING (COM-3371) Week 2 - January 14, 2002

DIGITAL IMAGE PROCESSING (COM-3371) Week 2 - January 14, 22 Topics: Human eye Visual phenomena Simple image model Image enhancement Point processes Histogram Lookup tables Contrast compression and stretching

Image acquisition. Midterm Review. Digitization, line of image. Digitization, whole image. Geometric transformations. Interpolation 10/26/2016

Image acquisition Midterm Review Image Processing CSE 166 Lecture 10 2 Digitization, line of image Digitization, whole image 3 4 Geometric transformations Interpolation CSE 166 Transpose these matrices

Fourier Transform. Any signal can be expressed as a linear combination of a bunch of sine gratings of different frequency Amplitude Phase

Fourier Transform Fourier Transform Any signal can be expressed as a linear combination of a bunch of sine gratings of different frequency Amplitude Phase 2 1 3 3 3 1 sin 3 3 1 3 sin 3 1 sin 5 5 1 3 sin

Digital Image Processing. Lecture 5 (Enhancement) Bu-Ali Sina University Computer Engineering Dep. Fall 2009

Digital Image Processing Lecture 5 (Enhancement) Bu-Ali Sina University Computer Engineering Dep. Fall 2009 Outline Image Enhancement in Spatial Domain Histogram based methods Histogram Equalization Local

CSE 564: Visualization. Image Operations. Motivation. Provide the user (scientist, t doctor, ) with some means to: Global operations:

Motivation CSE 564: Visualization mage Operations Klaus Mueller Computer Science Department Stony Brook University Provide the user (scientist, t doctor, ) with some means to: enhance contrast of local

Fig Color spectrum seen by passing white light through a prism.

1. Explain about color fundamentals. Color of an object is determined by the nature of the light reflected from it. When a beam of sunlight passes through a glass prism, the emerging beam of light is not

Image Filtering. Median Filtering

Image Filtering Image filtering is used to: Remove noise Sharpen contrast Highlight contours Detect edges Other uses? Image filters can be classified as linear or nonlinear. Linear filters are also know

Image Enhancement (from Chapter 13) (V6)

Image Enhancement (from Chapter 13) (V6) Astronomical images often span a wide range of brightness, while important features contained in them span a very narrow range of brightness. Alternatively, interesting

EE482: Digital Signal Processing Applications

Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 15 Image Processing 14/04/15 http://www.ee.unlv.edu/~b1morris/ee482/

IIR Filter Design Chapter Intended Learning Outcomes: (i) Ability to design analog Butterworth filters

IIR Filter Design Chapter Intended Learning Outcomes: (i) Ability to design analog Butterworth filters (ii) Ability to design lowpass IIR filters according to predefined specifications based on analog

NON UNIFORM BACKGROUND REMOVAL FOR PARTICLE ANALYSIS BASED ON MORPHOLOGICAL STRUCTURING ELEMENT:

IJCE January-June 2012, Volume 4, Number 1 pp. 59 67 NON UNIFORM BACKGROUND REMOVAL FOR PARTICLE ANALYSIS BASED ON MORPHOLOGICAL STRUCTURING ELEMENT: A COMPARATIVE STUDY Prabhdeep Singh1 & A. K. Garg2

Chapter 3 Exponential and Logarithmic Functions

Chapter 3 Exponential and Logarithmic Functions Section 1 Section 2 Section 3 Section 4 Section 5 Exponential Functions and Their Graphs Logarithmic Functions and Their Graphs Properties of Logarithms

USE OF HISTOGRAM EQUALIZATION IN IMAGE PROCESSING FOR IMAGE ENHANCEMENT

USE OF HISTOGRAM EQUALIZATION IN IMAGE PROCESSING FOR IMAGE ENHANCEMENT Sapana S. Bagade M.E,Computer Engineering, Sipna s C.O.E.T,Amravati, Amravati,India sapana.bagade@gmail.com Vijaya K. Shandilya Assistant

Lecture 4: Spatial Domain Processing and Image Enhancement

I2200: Digital Image processing Lecture 4: Spatial Domain Processing and Image Enhancement Prof. YingLi Tian Sept. 27, 2017 Department of Electrical Engineering The City College of New York The City University

Noise and Restoration of Images

Noise and Restoration of Images Dr. Praveen Sankaran Department of ECE NIT Calicut February 24, 2013 Winter 2013 February 24, 2013 1 / 35 Outline 1 Noise Models 2 Restoration from Noise Degradation 3 Estimation

1. (a) Explain the process of Image acquisition. (b) Discuss different elements used in digital image processing system. [8+8]

Code No: R05410408 Set No. 1 1. (a) Explain the process of Image acquisition. (b) Discuss different elements used in digital image processing system. [8+8] 2. (a) Find Fourier transform 2 -D sinusoidal

Image Enhancement contd. An example of low pass filters is:

Image Enhancement contd. An example of low pass filters is: We saw: unsharp masking is just a method to emphasize high spatial frequencies. We get a similar effect using high pass filters (for instance,

Color Transformations

Color Transformations It is useful to think of a color image as a vector valued image, where each pixel has associated with it, as vector of three values. Each components of this vector corresponds to

Stochastic Image Denoising using Minimum Mean Squared Error (Wiener) Filtering

Stochastic Image Denoising using Minimum Mean Squared Error (Wiener) Filtering L. Sahawneh, B. Carroll, Electrical and Computer Engineering, ECEN 670 Project, BYU Abstract Digital images and video used

from: Point Operations (Single Operands)

from: http://www.khoral.com/contrib/contrib/dip2001 Point Operations (Single Operands) Histogram Equalization Histogram equalization is as a contrast enhancement technique with the objective to obtain

IMAGE PROCESSING: AREA OPERATIONS (FILTERING)

IMAGE PROCESSING: AREA OPERATIONS (FILTERING) N. C. State University CSC557 Multimedia Computing and Networking Fall 2001 Lecture # 13 IMAGE PROCESSING: AREA OPERATIONS (FILTERING) N. C. State University

Various Image Enhancement Techniques - A Critical Review

International Journal of Innovation and Scientific Research ISSN 2351-8014 Vol. 10 No. 2 Oct. 2014, pp. 267-274 2014 Innovative Space of Scientific Research Journals http://www.ijisr.issr-journals.org/

Digital Image Fundamentals and Image Enhancement in the Spatial Domain

Digital Image Fundamentals and Image Enhancement in the Spatial Domain Mohamed N. Ahmed, Ph.D. Introduction An image may be defined as 2D function f(x,y), where x and y are spatial coordinates. The amplitude

Image analysis. CS/CME/BIOPHYS/BMI 279 Fall 2015 Ron Dror

Image analysis CS/CME/BIOPHYS/BMI 279 Fall 2015 Ron Dror A two- dimensional image can be described as a function of two variables f(x,y). For a grayscale image, the value of f(x,y) specifies the brightness

Performance Evaluation of Edge Detection Techniques for Square Pixel and Hexagon Pixel images

Performance Evaluation of Edge Detection Techniques for Square Pixel and Hexagon Pixel images Keshav Thakur 1, Er Pooja Gupta 2,Dr.Kuldip Pahwa 3, 1,M.Tech Final Year Student, Deptt. of ECE, MMU Ambala,

Digital Imaging Systems for Historical Documents

Digital Imaging Systems for Historical Documents Improvement Legibility by Frequency Filters Kimiyoshi Miyata* and Hiroshi Kurushima** * Department Museum Science, ** Department History National Museum

Preparing Remote Sensing Data for Natural Resources Mapping (image enhancement, rectifications )

Preparing Remote Sensing Data for Natural Resources Mapping (image enhancement, rectifications ) Why is this important What are the major approaches Examples of digital image enhancement Follow up exercises

Guided Image Filtering for Image Enhancement

International Journal of Research Studies in Science, Engineering and Technology Volume 1, Issue 9, December 2014, PP 134-138 ISSN 2349-4751 (Print) & ISSN 2349-476X (Online) Guided Image Filtering for

Logarithmic Functions and Their Graphs

Logarithmic Functions and Their Graphs Accelerated Pre-Calculus Mr. Niedert Accelerated Pre-Calculus Logarithmic Functions and Their Graphs Mr. Niedert 1 / 24 Logarithmic Functions and Their Graphs 1 Logarithmic

Vision Review: Image Processing. Course web page:

Vision Review: Image Processing Course web page: www.cis.udel.edu/~cer/arv September 7, Announcements Homework and paper presentation guidelines are up on web page Readings for next Tuesday: Chapters 6,.,

Removing Temporal Stationary Blur in Route Panoramas

Removing Temporal Stationary Blur in Route Panoramas Jiang Yu Zheng and Min Shi Indiana University Purdue University Indianapolis jzheng@cs.iupui.edu Abstract The Route Panorama is a continuous, compact

Chapter 3 Image Enhancement in the Spatial Domain. Chapter 3 Image Enhancement in the Spatial Domain

It makes all the difference whether one sees darkness through the light or brightness through the shadows. - David Lindsay 3.1 Background 76 3.2 Some Basic Gray Level Transformations 78 3.3 Histogram Processing

OFFSET AND NOISE COMPENSATION

OFFSET AND NOISE COMPENSATION AO 10V 8.1 Offset and fixed pattern noise reduction Offset variation - shading AO 10V 8.2 Row Noise AO 10V 8.3 Offset compensation Global offset calibration Dark level is

CAP 5415 Computer Vision. Marshall Tappen Fall Lecture 1

CAP 5415 Computer Vision Marshall Tappen Fall 21 Lecture 1 Welcome! About Me Interested in Machine Vision and Machine Learning Happy to chat with you at almost any time May want to e-mail me first Office

Digital Image Processing

Digital Image Processing Part : Image Enhancement in the Spatial Domain AASS Learning Systems Lab, Dep. Teknik Room T9 (Fr, - o'clock) achim.lilienthal@oru.se Course Book Chapter 3-4- Contents. Image Enhancement

MATLAB 6.5 Image Processing Toolbox Tutorial

MATLAB 6.5 Image Processing Toolbox Tutorial The purpose of this tutorial is to gain familiarity with MATLAB s Image Processing Toolbox. This tutorial does not contain all of the functions available in

Introduction Approach Work Performed and Results

Algorithm for Morphological Cancer Detection Carmalyn Lubawy Melissa Skala ECE 533 Fall 2004 Project Introduction Over half of all human cancers occur in stratified squamous epithelia. Approximately one

Digital Image Processing COSC 6380/4393

Digital Image Processing COSC 638/4393 Lecture 9 Sept 26 th, 217 Pranav Mantini Slides from Dr. Shishir K Shah and Frank (Qingzhong) Liu, S. Narasimhan HISTOGRAM SHAPING We now describe methods for histogram

Implementation of Band Pass Filter for Homomorphic Filtering Technique

INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND MOBILE APPLICATIONS Implementation of Band Pass Filter for Homomorphic Filtering Technique Pin Yang Tan 1, Haidi Ibrahim 2 1 School of Electrical & Electronic

Image filtering, image operations. Jana Kosecka

Image filtering, image operations Jana Kosecka - photometric aspects of image formation - gray level images - point-wise operations - linear filtering Image Brightness values I(x,y) Images Images contain

Subband coring for image noise reduction. Edward H. Adelson Internal Report, RCA David Sarnoff Research Center, Nov

Subband coring for image noise reduction. dward H. Adelson Internal Report, RCA David Sarnoff Research Center, Nov. 26 1986. Let an image consisting of the array of pixels, (x,y), be denoted (the boldface

Digital Signal Processing

Digital Signal Processing System Analysis and Design Paulo S. R. Diniz Eduardo A. B. da Silva and Sergio L. Netto Federal University of Rio de Janeiro CAMBRIDGE UNIVERSITY PRESS Preface page xv Introduction

Introduction. Computer Vision. CSc I6716 Fall Part I. Image Enhancement. Zhigang Zhu, City College of New York

CSc I6716 Fall 21 Introduction Part I Feature Extraction ti (1) Zhigang Zhu, City College of New York zhu@cs.ccny.cuny.edu Image Enhancement What are Image Features? Local, meaningful, detectable parts

Introduction to Wavelet Transform. Chapter 7 Instructor: Hossein Pourghassem

Introduction to Wavelet Transform Chapter 7 Instructor: Hossein Pourghassem Introduction Most of the signals in practice, are TIME-DOMAIN signals in their raw format. It means that measured signal is a

An Efficient Color Image Segmentation using Edge Detection and Thresholding Methods

19 An Efficient Color Image Segmentation using Edge Detection and Thresholding Methods T.Arunachalam* Post Graduate Student, P.G. Dept. of Computer Science, Govt Arts College, Melur - 625 106 Email-Arunac682@gmail.com

Contrast Image Correction Method

Contrast Image Correction Method Journal of Electronic Imaging, Vol. 19, No. 2, 2010 Raimondo Schettini, Francesca Gasparini, Silvia Corchs, Fabrizio Marini, Alessandro Capra, and Alfio Castorina Presented

On Contrast Sensitivity in an Image Difference Model

On Contrast Sensitivity in an Image Difference Model Garrett M. Johnson and Mark D. Fairchild Munsell Color Science Laboratory, Center for Imaging Science Rochester Institute of Technology, Rochester New

On Filter Techniques for Generating Blue Noise Mask

On Filter Techniques for Generating Blue Noise Mask Kevin J. Parker and Qing Yu Dept. of Electrical Engineering, University of Rochester, New York Meng Yao, Color Print and Image Division Tektronix Inc.,

EEL 6562 Image Processing and Computer Vision Box Filter and Laplacian Filter Implementation

DEPARTMENT OF ELECTRICAL & COMPUTER ENGINEERING EEL 6562 Image Processing and Computer Vision Box Filter and Laplacian Filter Implementation Rajesh Pydipati Introduction Image Processing is defined as

December 28, Dr. Praveen Sankaran (Department of ECE NIT Calicut DIP)

Dr. Praveen Sankaran Department of ECE NIT Calicut December 28, 2012 Winter 2013 December 28, 2012 1 / 18 Outline 1 Piecewise-Linear Functions Review 2 Histogram Processing Winter 2013 December 28, 2012

UNIT IV FIR FILTER DESIGN 1. How phase distortion and delay distortion are introduced? The phase distortion is introduced when the phase characteristics of a filter is nonlinear within the desired frequency

Survey on Image Contrast Enhancement Techniques

Survey on Image Contrast Enhancement Techniques Rashmi Choudhary, Sushopti Gawade Department of Computer Engineering PIIT, Mumbai University, India Abstract: Image enhancement is a processing on an image

Speckle disturbance limit in laserbased cinema projection systems

Speckle disturbance limit in laserbased cinema projection systems Guy Verschaffelt 1,*, Stijn Roelandt 2, Youri Meuret 2,3, Wendy Van den Broeck 4, Katriina Kilpi 4, Bram Lievens 4, An Jacobs 4, Peter

Piecewise Linear Circuits

Kenneth A. Kuhn March 24, 2004 Introduction Piecewise linear circuits are used to approximate non-linear functions such as sine, square-root, logarithmic, exponential, etc. The quality of the approximation

14.2 Limits and Continuity

14 Partial Derivatives 14.2 Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Let s compare the behavior of the functions Tables 1 2 show values of f(x,

Image and Video Processing

Image and Video Processing () Image Representation Dr. Miles Hansard miles.hansard@qmul.ac.uk Segmentation 2 Today s agenda Digital image representation Sampling Quantization Sub-sampling Pixel interpolation

Motivation: Image denoising. How can we reduce noise in a photograph?

Linear filtering Motivation: Image denoising How can we reduce noise in a photograph? Moving average Let s replace each pixel with a weighted average of its neighborhood The weights are called the filter

Image Processing COS 426

Image Processing COS 426 What is a Digital Image? A digital image is a discrete array of samples representing a continuous 2D function Continuous function Discrete samples Limitations on Digital Images

Templates and Image Pyramids

Templates and Image Pyramids 09/07/17 Computational Photography Derek Hoiem, University of Illinois Why does a lower resolution image still make sense to us? What do we lose? Image: http://www.flickr.com/photos/igorms/136916757/

CS 4501: Introduction to Computer Vision. Filtering and Edge Detection

CS 451: Introduction to Computer Vision Filtering and Edge Detection Connelly Barnes Slides from Jason Lawrence, Fei Fei Li, Juan Carlos Niebles, Misha Kazhdan, Allison Klein, Tom Funkhouser, Adam Finkelstein,

Intrinsic Camera Resolution Measurement Peter D. Burns a and Judit Martinez Bauza b a Burns Digital Imaging LLC, b Qualcomm Technologies Inc.

Copyright SPIE Intrinsic Camera Resolution Measurement Peter D. Burns a and Judit Martinez Bauza b a Burns Digital Imaging LLC, b Qualcomm Technologies Inc. ABSTRACT Objective evaluation of digital image

Review and Analysis of Image Enhancement Techniques

International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 4, Number 6 (2014), pp. 583-590 International Research Publications House http://www. irphouse.com Review and Analysis

02/02/10. Image Filtering. Computer Vision CS 543 / ECE 549 University of Illinois. Derek Hoiem

2/2/ Image Filtering Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem Questions about HW? Questions about class? Room change starting thursday: Everitt 63, same time Key ideas from last

Reference Manual SPECTRUM. Signal Processing for Experimental Chemistry Teaching and Research / University of Maryland

Reference Manual SPECTRUM Signal Processing for Experimental Chemistry Teaching and Research / University of Maryland Version 1.1, Dec, 1990. 1988, 1989 T. C. O Haver The File Menu New Generates synthetic

Digital Image Processing

Digital Image Processing 1 Patrick Olomoshola, 2 Taiwo Samuel Afolayan 1,2 Surveying & Geoinformatic Department, Faculty of Environmental Sciences, Rufus Giwa Polytechnic, Owo. Nigeria Abstract: This paper

Digital Image Processing Chapter 3: Image Enhancement in the Spatial Domain

Digital Image Processing Chapter 3: Image Enhancement in the Spatial Domain Principle Objective o Enhancement Process an image so that the result will be more suitable than the original image or a speciic

On Contrast Sensitivity in an Image Difference Model

On Contrast Sensitivity in an Image Difference Model Garrett M. Johnson and Mark D. Fairchild Munsell Color Science Laboratory, Center for Imaging Science Rochester Institute of Technology, Rochester New

IMAGE PROCESSING Vedat Tavşanoğlu

Vedat Tavşano anoğlu Image Processing A Revision of Basic Concepts An image is mathematically represented by: where I( x, y) x y is the vertical spatial distance; is the horizontal spatial distance, both

Image Filtering and Gaussian Pyramids

Image Filtering and Gaussian Pyramids CS94: Image Manipulation & Computational Photography Alexei Efros, UC Berkeley, Fall 27 Limitations of Point Processing Q: What happens if I reshuffle all pixels within

Agilent Time Domain Analysis Using a Network Analyzer

Agilent Time Domain Analysis Using a Network Analyzer Application Note 1287-12 0.0 0.045 0.6 0.035 Cable S(1,1) 0.4 0.2 Cable S(1,1) 0.025 0.015 0.005 0.0 1.0 1.5 2.0 2.5 3.0 3.5 4.0 Frequency (GHz) 0.005

5.4 Transformations and Composition of Functions

5.4 Transformations and Composition of Functions 1. Vertical Shifts: Suppose we are given y = f(x) and c > 0. (a) To graph y = f(x)+c, shift the graph of y = f(x) up by c. (b) To graph y = f(x) c, shift

PREREQUISITE/PRE-CALCULUS REVIEW

PREREQUISITE/PRE-CALCULUS REVIEW Introduction This review sheet is a summary of most of the main topics that you should already be familiar with from your pre-calculus and trigonometry course(s), and which

Motivation: Image denoising. How can we reduce noise in a photograph?

Linear filtering Motivation: Image denoising How can we reduce noise in a photograph? Moving average Let s replace each pixel with a weighted average of its neighborhood The weights are called the filter

Various Image Enhancement Techniques for Skin Cancer Detection Using Mobile App

Various Image Enhancement Techniques for Skin Cancer Detection Using Mobile App Manasvi Kalra Genesis Futuristic Technologies Ltd. Noida-201307, India manasvi.k@genesis-in.com Abstract This paper aims

2.1 Partial Derivatives

.1 Partial Derivatives.1.1 Functions of several variables Up until now, we have only met functions of single variables. From now on we will meet functions such as z = f(x, y) and w = f(x, y, z), which