 # Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.

## Presentation on theme: "Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain."— Presentation transcript:

Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain

Background  The French mathematiian Jean Baptiste Joseph Fourier Born in 1768 Published Fourier series in 1822 Fourier ’ s ideas were met with skepticism  Fourier series Any periodical function can be expressed as the sum of sines and/or cosines of different frequencies, each multiplied by a different coefficient

 Fourier transform Functions can be expressed as the integral of sines and/or cosines multiplied by a weighting function Functions expressed in either a Fourier series or transform can be reconstructed completely via an inverse process with no loss of information

 Applications Heat diffusion Fast Fourier transform (FFT) developed in the late 1950s

Introduction to the Fourier Transform and the Frequency Domain  The one-dimensional Fourier transform and its inverse Fourier transform Inverse Fourier transform

Two variables Fourier transform Inverse Fourier transform

 Discrete Fourier transform (DFT) Original variable Transformed variable

 DFT The discrete Fourier transform and its inverse always exist f(x) is finite in the book

 Sines and cosines

 Time domain  Time components  Frequency domain  Frequency components

 Fourier transform and a glass prism Prism  Separates light into various color components, each depending on its wavelength (or frequency) content Fourier transform  Separates a function into various components, also based on frequency content  Mathematical prism

 Polar coordinates Real part Imaginary part

Magnitude or spectrum Phase angle or phase spectrum Power spectrum or spectral density

 Samples

 Some references http://local.wasp.uwa.edu.au/~pbourk e/other/dft/ http://local.wasp.uwa.edu.au/~pbourk e/other/dft/ http://homepages.inf.ed.ac.uk/rbf/HIP R2/fourier.htm http://homepages.inf.ed.ac.uk/rbf/HIP R2/fourier.htm

 Examples  test_fft.c test_fft.c  fft.h fft.h  fft.c fft.c  Fig4.03(a).bmp Fig4.03(a).bmp  test_fig2.bmp test_fig2.bmp

 The two-dimensional DFT and its inverse

 Spatial, or image variables: x, y  Transform, or frequency variables: u, v

Magnitude or spectrum Phase angle or phase spectrum Power spectrum or spectral density

 Centering  Average gray level F(0,0) is called the dc component of the spectrum

 Conjugate symmetric If f(x,y) is real  Relationships between samples in the spatial and frequency domains

The separation of spectrum zeros in the u-direction is exactly twice the separation of zeros in the v direction

 Filtering in the frequency domain

Strong edges that run approximately at +45 degree, and -45 degree The inclination off horizontal of the long white element is related to a vertical component that is off-axis slightly to the left The zeros in the vertical frequency component correspond to the narrow vertical span of the oxide protrusions

 Basics of filtering in the frequency domain 1. Multiply the input image by to center the transform 2. Compute F(u,v) 3. Multiply F(u,v) by a filter function H(u,v) 4. Compute the inverse DFT 5. Obtain the real part 6. Multiply the result by

 Fourier transform of the output image  zero-phase-shift filter Real H(u,v)

 Inverse Fourier transform of G(u,v)  The imaginary components of the inverse transform should all be zero When the input image and the filter function are real

 Set F(0,0) to be zero, a notch filter

 Lowpass filter Pass low frequencies, attenuate high frequencies Blurring  Highpass filter Pass high frequencies, attenuate low frequencies Edges, noise

 Convolution theorem

 Impulse function of strength A

 Gaussian filter

 Highpass filter

Smoothing Frequency-Domain Filterers  Ideal lowpass filters

Cutoff frequency Total image power Portion of the total power

 Blurring and ringing properties Filter Convolution : Spatial filter  was multiplied by  Then the inverse DFT  The real part of the inverse DFT was multiplied by

 The filter A dominant component at the origin Concentric, circular components about the center component --- ringing The radius of the center component and the number of circles per unit distance from the origin are inversely proportional to the value of the cutoff frequency of the ideal filter.

 Butterworth lowpass filters when

 Butterworth lowpass filters Order 1: No ringing Order 2: Imperceptible ringing Higher order: Ringing becomes a significant factor

 Gaussain lowpass filters When No ringing

 Additional examples of lowpass filters Machine perception Printing and publishing Satellite and aerial images

Sharpening Frequency Domain Filters  Highpass filter Spatial filter:  was multiplied by  Then the inverse DFT  The real part of the inverse DFT was multiplied by

 Ideal highpass filters

 Butterworth highpass filters

 Gaussian highpass filters

 The Laplacian in the frequency domain

After centering

Inverse Fourier transform Fourier-transform pair

Subtracting the Laplacian from the original image

 Unsharp masking, high-boost filtering, and high-frequency emphasis filtering Highpass filtering High-boost filtering

Frequency domain

High-frequency emphasis  where and

Homomorphic Filtering  Illumination and reflectance components  Derivations

Or

 Frequency domain  Spatial domain

Decrease the contribution made by the low frequencies (illumination) Amplify the contribution made by high frequencies (reflectance) Simultaneous dynamic range compression and contrast enhancement

Implementation  Translation When and

 Distributivity and scaling

 Rotation Polar coordinates Rotating by an angle rotates by the same angle

 Periodicity and conjugate symmetry Periodicity property

Conjugate symmetry Symmetry of the spectrum

 Separability

where We can compute the 2-D transform by first computing a 1-D transform along each row of the input image, and then computing a 1-D transform along each column of this intermediate result

 Computing the inverse Fourier transform using a forward transform algorithm

Calculate

Inputting into an algorithm designed to compute the forward transform gives the quantity

2-D

 More on periodicity: the need for padding Convolution: Flip one of the functions and slide it pass the other

Download ppt "Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain."

Similar presentations