The Frequency Domain Sinusoidal tidal waves Copy of Katsushika Hokusai The Great Wave off Kanagawa at

Slides:



Advertisements
Similar presentations
Computer Vision Lecture 7: The Fourier Transform
Advertisements

Time Series II.
Frequency Domain The frequency domain
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Basis beeldverwerking (8D040) dr. Andrea Fuster Prof.dr. Bart ter Haar Romeny dr. Anna Vilanova Prof.dr.ir. Marcel Breeuwer The Fourier Transform II.
School of Computing Science Simon Fraser University
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Lecture 13 The frequency Domain (1)
Signals Processing Second Meeting. Fourier's theorem: Analysis Fourier analysis is the process of analyzing periodic non-sinusoidal waveforms in order.
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
Signals, Fourier Series
Fourier Analysis D. Gordon E. Robertson, PhD, FCSB School of Human Kinetics University of Ottawa.
SWE 423: Multimedia Systems Chapter 7: Data Compression (5)
Time and Frequency Representation
Unit 7 Fourier, DFT, and FFT 1. Time and Frequency Representation The most common representation of signals and waveforms is in the time domain Most signal.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
CELLULAR COMMUNICATIONS DSP Intro. Signals: quantization and sampling.
CH#3 Fourier Series and Transform
Basics of Signal Processing. frequency = 1/T  speed of sound × T, where T is a period sine wave period (frequency) amplitude phase.
Chapter 25 Nonsinusoidal Waveforms. 2 Waveforms Used in electronics except for sinusoidal Any periodic waveform may be expressed as –Sum of a series of.
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
Frequency Domain Representation of Sinusoids: Continuous Time Consider a sinusoid in continuous time: Frequency Domain Representation: magnitude phase.
Lecture 1 Signals in the Time and Frequency Domains
Motivation Music as a combination of sounds at different frequencies
Image Processing Fourier Transform 1D Efficient Data Representation Discrete Fourier Transform - 1D Continuous Fourier Transform - 1D Examples.
Fourier series. The frequency domain It is sometimes preferable to work in the frequency domain rather than time –Some mathematical operations are easier.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
Wireless and Mobile Computing Transmission Fundamentals Lecture 2.
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Background Any function that periodically repeats itself.
October 29, 2013Computer Vision Lecture 13: Fourier Transform II 1 The Fourier Transform In the previous lecture, we discussed the Hough transform. There.
Spatial Frequencies Spatial Frequencies. Why are Spatial Frequencies important? Efficient data representation Provides a means for modeling and removing.
Discrete Fourier Transform in 2D – Chapter 14. Discrete Fourier Transform – 1D Forward Inverse M is the length (number of discrete samples)
CH#3 Fourier Series and Transform
Dr. Scott Umbaugh, SIUE Discrete Transforms.
Math Review Towards Fourier Transform
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
 Circuits in which the source voltage or current is time-varying (particularly interested in sinusoidally time-varying excitation, or simply, excitation.
Fourier and Wavelet Transformations Michael J. Watts
Chapter 8 Lossy Compression Algorithms. Fundamentals of Multimedia, Chapter Introduction Lossless compression algorithms do not deliver compression.
CS 376b Introduction to Computer Vision 03 / 17 / 2008 Instructor: Michael Eckmann.
Dr. Abdul Basit Siddiqui FUIEMS. QuizTime 30 min. How the coefficents of Laplacian Filter are generated. Show your complete work. Also discuss different.
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
The Spectrum n Jean Baptiste Fourier ( ) discovered a fundamental tenet of wave theory.
Chapter 13 Discrete Image Transforms
Fourier Analyses Time series Sampling interval Total period Question: How perturbations with different frequencies contribute to the turbulent kinetic.
The Frequency Domain Digital Image Processing – Chapter 8.
Fourier transform.
Digital Image Processing Lecture 7: Image Enhancement in Frequency Domain-I Naveed Ejaz.
Frequency Domain Representation of Biomedical Signals.
CH#3 Fourier Series and Transform 1 st semester King Saud University College of Applied studies and Community Service 1301CT By: Nour Alhariqi.
EE422G Signals and Systems Laboratory Fourier Series and the DFT Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Introduction to Transforms
Section II Digital Signal Processing ES & BM.
Neural data-analysis Workshop
Image Enhancement in the
Fourier and Wavelet Transformations
Dr. Nikos Desypris, Oct Lecture 3
Fourier Transform.
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Signals and Systems Networks and Communication Department Chapter (1)
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
2D Fourier transform is separable
Notes Assignments Tutorial problems
Fourier Analyses Time series Sampling interval Total period
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Discrete Fourier Transform
Presentation transcript:

The Frequency Domain Sinusoidal tidal waves Copy of Katsushika Hokusai The Great Wave off Kanagawa at

Domains  Images can be represented in different domains  Spatial domain – the strength of light at points in space  Frequency domain – the strength of patterns within an image  Frequency domain is useful for  Image analysis  Image compression  Efficient processing 2

Frequency Domain  Various frequency domains  Discrete Cosine – used in image analysis and compression  Fourier – used in image analysis and processing  Wavelet – used in image analysis and compression  Haar and others …  Each domain defines a set of patterns from which all images can be composed  The DCT and DFT domains use sinusoidal patterns 3

Sinusoids  A sinusoidal is characterized by the amplitude, frequency, and phase 4

Functions into sinusoids  Any function can be represented as the sum of sinusoids  Consider a one dimensional ‘square wave’.  Can it be represented as the sum of ‘non-square waves’?

6 Decomposing functions into sinusoids Start with a sin wave of the same frequency as the square wave. This is the “base” or “fundamental” frequency.

7 Decomposing functions into sinusoids Add a 3 rd “harmonic” to the fundamental frequency. The amplitude is less than that of the base and the frequency is 3 times that of the base.

8 Decomposing functions into sinusoids Add a 5 th “harmonic” to the fundamental frequency. The amplitude is less than that of the base and the frequency is 5 times that of the base.

9 Decomposing functions into sinusoids Add a 7 th and 9th“harmonic” to the fundamental frequency.

10 Decomposing functions into sinusoids Adding all harmonics up to the 100 th.

Sinusoids (1D)  Consider the following sinusoidal function  f can be understood as a row profile  Amplitude is determined by A  Phase (shift) is given by phi  Frequency is controlled by u  if u = 1 there is one cycle spanning the image  U can be understood as the ‘number of cycles per image width’ 11

Sinusoids (1D) as images 12

Discrete sinusoid  Take the continuous sinusoidal function into the discrete domain via sampling at ½ unit intervals.  One effect is to place an upper limit on the frequencies that can be captured via sampling.  U must be less than N/2 in order to be recoverable by the discrete samples. This is the Shannon-Nyquist limit.  Higher frequencies generate aliases

Aliasing example  Consider a sinusoid such that u=1 over a span of 8 units.  Consider a sinusoid such that u=7 over a span of 8 units.  The resulting samples are identical. The two different signals are indistinguishable after sampling and hence are aliases for each other.

Frequency Domain  The central idea in frequency domain representation is to  Find a set of orthogonal sinusoidal patterns that can be combined to form any image  Any image can be expressed as the weighted sum of these basis images.  The DFT and DCT are ways of decomposing an image into the sum of sinusoidal basis images

How to determine the amplitudes?  The DCT and DFT transformations are ways of decomposing a spatial image into sinusoidal basis images.  The forward DCT goes from spatial to frequency. The inverse DCT goes from frequency to spatial.  The DCT and DFT are invertible – no loss of information either way 16

Notional conventions