Scribd
Upload
298 views

Fourier Transform Applications

The Fourier transform converts a function from the time or spatial domain to the frequency domain. It allows switching between these domains, which is useful for applications like signal analysis, sound filtering, data compression, and solving partial differential equations. The discrete Fourier transform is more practical for computer applications and the fast Fourier transform further improves computational efficiency.

Uploaded by

Anonymous DBq6p69tA
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
298 views

Fourier Transform Applications

The Fourier transform converts a function from the time or spatial domain to the frequency domain. It allows switching between these domains, which is useful for applications like signal analysis, sound filtering, data compression, and solving partial differential equations. The discrete Fourier transform is more practical for computer applications and the fast Fourier transform further improves computational efficiency.

Uploaded by

Anonymous DBq6p69tA
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 29

Fourier Transform and

Applications
Transforms

Transform:
In mathematics, a function that results when a
given function is multiplied by a so-called kernel
function, and the product is integrated between
suitable limits. (Britannica)

Can be thought of as a substitution


Fourier Transform

Property of transforms:
They convert a function from one domain to
another with no loss of information
Fourier Transform:

converts a function from the time (or spatial)


domain to the frequency domain
Time Domain and Frequency
Domain
Time Domain:
Tells us how properties (air pressure in a sound function,
for example) change over time:

Amplitude = 100
Frequency = number of cycles in one second = 200 Hz
Time Domain and Frequency
Domain
Frequency domain:
Tells us how properties (amplitudes) change over
frequencies:
Time Domain and Frequency
Domain
In 1807, Jean Baptiste Joseph Fourier
showed that any periodic signal could be
represented by a series of sinusoidal
functions

In picture: the composition of the first two functions gives the bottom one
Time Domain and Frequency
Domain
Fourier Transform
Because of the
property:

Fourier Transform takes us to the frequency


domain:
Discrete Fourier Transform

In practice, we often deal with discrete


functions (digital signals, for example)
Discrete version of the Fourier Transform is
much more useful in computer science:
Discrete Fourier Transform
Discrete Fourier Transform
Fast Fourier Transform

Many techniques introduced that reduce computing time to


n log n
Most popular one: radix-2 decimation-in-time (DIT) FFT
Cooley-Tukey algorithm:

(Divide and conquer)


Applications

In image processing:
Instead of time domain: spatial domain (normal
image space)
frequency domain: space in which each image
value at image position F represents the amount
that the intensity values in image I vary over a
specific distance related to F
Applications: Frequency
Domain In Images
Spatial frequency of an image refers to the
rate at which the pixel intensities change
In picture on right:
High frequences:
Near center
Low frequences:
Corners
Other Applications of the DFT

Signal analysis
Sound filtering
Data compression
Partial differential equations
Multiplication of large integers
Summary

Transforms:
Useful in mathematics (solving DE)
Fourier Transform:
Lets us easily switch between time-space domain
and frequency domain so applicable in many
other areas
Easy to pick out frequencies
Many applications

You might also like