Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
-
Upload
corinne-tatum -
Category
Documents
-
view
251 -
download
9
Transcript of Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
![Page 1: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/1.jpg)
Fourier Transform (Chapter 4)
CS474/674 – Prof. Bebis
![Page 2: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/2.jpg)
Mathematical Background:Complex Numbers
• A complex number x is of the form:
α: real part, b: imaginary part
• Addition:
• Multiplication:
![Page 3: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/3.jpg)
Mathematical Background:Complex Numbers (cont’d)
• Magnitude-Phase (i.e.,vector) representation
Magnitude:
Phase:
φMagnitude-Phase notation:
![Page 4: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/4.jpg)
Mathematical Background:Complex Numbers (cont’d)
• Multiplication using magnitude-phase representation
• Complex conjugate
• Properties
![Page 5: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/5.jpg)
Mathematical Background:Complex Numbers (cont’d)
• Euler’s formula
• Propertiesj
![Page 6: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/6.jpg)
Mathematical Background:Sine and Cosine Functions
• Periodic functions
• General form of sine and cosine functions:
![Page 7: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/7.jpg)
Mathematical Background:Sine and Cosine Functions
Special case: A=1, b=0, α=1
π
ππ/2
π/2
3π/2
3π/2
![Page 8: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/8.jpg)
Mathematical Background:Sine and Cosine Functions (cont’d)
Note: cosine is a shifted sine function:
• Shifting or translating the sine function by a const b
cos( ) sin( )2
t t
![Page 9: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/9.jpg)
Mathematical Background:Sine and Cosine Functions (cont’d)
• Changing the amplitude A
![Page 10: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/10.jpg)
Mathematical Background:Sine and Cosine Functions (cont’d)
• Changing the period T=2π/|α| consider A=1, b=0: y=cos(αt)
period 2π/4=π/2
shorter period higher frequency(i.e., oscillates faster)
α =4
Frequency is defined as f=1/T
Alternative notation: cos(αt)=cos(2πt/T)=cos(2πft)
![Page 11: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/11.jpg)
Basis Functions
• Given a vector space of functions, S, then if any f(t) ϵ S can be expressed as
the set of functions φk(t) are called the expansion set of S.
• If the expansion is unique, the set φk(t) is a basis.
( ) ( )k kk
f t a t
![Page 12: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/12.jpg)
Image Transforms
• Many times, image processing tasks are best performed in a domain other than the spatial domain.
• Key steps:(1) Transform the image
(2) Carry the task(s) in the transformed domain.
(3) Apply inverse transform to return to the spatial domain.
![Page 13: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/13.jpg)
Transformation Kernels
• Forward Transformation
• Inverse Transformation
1
0
1
0
1,...,1,0,1,...,1,0),,,(),(),(M
x
N
y
NvMuvuyxryxfvuT
1
0
1
0
1,...,1,0,1,...,1,0),,,(),(),(M
u
N
v
NyMxvuyxsvuTyxf
inverse transformation kernel
forward transformation kernel
![Page 14: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/14.jpg)
Kernel Properties
• A kernel is said to be separable if:
• A kernel is said to be symmetric if:
),(),(),,,( 21 vyruxrvuyxr
),(),(),,,( 11 vyruxrvuyxr
![Page 15: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/15.jpg)
Notation
• Continuous Fourier Transform (FT)
• Discrete Fourier Transform (DFT)
• Fast Fourier Transform (FFT)
![Page 16: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/16.jpg)
Fourier Series Theorem
• Any periodic function f(t) can be expressed as a weighted sum (infinite) of sine and cosine functions of varying frequency:
is called the “fundamental frequency”
![Page 17: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/17.jpg)
Fourier Series (cont’d)
α1
α2
α3
![Page 18: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/18.jpg)
Continuous Fourier Transform (FT)
• Transforms a signal (i.e., function) from the spatial (x) domain to the frequency (u) domain.
where
![Page 19: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/19.jpg)
Why is FT Useful?
• Easier to remove undesirable frequencies.
• Faster perform certain operations in the frequency domain than in the spatial domain.
![Page 20: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/20.jpg)
Example: Removing undesirable frequencies
remove highfrequencies
reconstructedsignal
frequenciesnoisy signal
To remove certainfrequencies, set theircorresponding F(u)coefficients to zero!
![Page 21: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/21.jpg)
How do frequencies show up in an image?
• Low frequencies correspond to slowly varying information (e.g., continuous surface).
• High frequencies correspond to quickly varying information (e.g., edges)
Original Image Low-passed
![Page 22: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/22.jpg)
Example of noise reduction using FT
Input image
Output image
Spectrum
Band-pass filter
![Page 23: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/23.jpg)
Frequency Filtering Steps
1. Take the FT of f(x):
2. Remove undesired frequencies:
3. Convert back to a signal:
We’ll talk more about these steps later .....
![Page 24: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/24.jpg)
Definitions
• F(u) is a complex function:
• Magnitude of FT (spectrum):
• Phase of FT:
• Magnitude-Phase representation:
• Power of f(x): P(u)=|F(u)|2=
![Page 25: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/25.jpg)
Example: rectangular pulse
rect(x) function sinc(x)=sin(x)/x
magnitude
![Page 26: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/26.jpg)
Example: impulse or “delta” function
• Definition of delta function:
• Properties:
![Page 27: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/27.jpg)
Example: impulse or “delta” function (cont’d)
• FT of delta function:
1
ux
![Page 28: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/28.jpg)
Example: spatial/frequency shifts
)()()2(
)()()1(
),()(
02
20
0
0
uuFexf
uFexxf
thenuFxf
xuj
uxj
Special Cases:
020 )( uxjexx
)( 02 0 uue xuj
![Page 29: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/29.jpg)
Example: sine and cosine functions
• FT of the cosine function
cos(2πu0x)
1/2
F(u)
![Page 30: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/30.jpg)
Example: sine and cosine functions (cont’d)
• FT of the sine function
sin(2πu0x)-jF(u)
![Page 31: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/31.jpg)
Extending FT in 2D
• Forward FT
• Inverse FT
![Page 32: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/32.jpg)
Example: 2D rectangle function
• FT of 2D rectangle function
2D sinc()
![Page 33: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/33.jpg)
Discrete Fourier Transform (DFT)
![Page 34: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/34.jpg)
Discrete Fourier Transform (DFT) (cont’d)
• Forward DFT
• Inverse DFT
1/NΔx
![Page 35: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/35.jpg)
Example
![Page 36: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/36.jpg)
Extending DFT to 2D
• Assume that f(x,y) is M x N.
• Forward DFT
• Inverse DFT:
![Page 37: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/37.jpg)
Extending DFT to 2D (cont’d)
• Special case: f(x,y) is N x N.
• Forward DFT
• Inverse DFT
u,v = 0,1,2, …, N-1
x,y = 0,1,2, …, N-1
![Page 38: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/38.jpg)
Extending DFT to 2D (cont’d)
2D cos/sin functions
![Page 39: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/39.jpg)
Visualizing DFT
• Typically, we visualize |F(u,v)|
• The dynamic range of |F(u,v)| is typically very large
• Apply streching: (c is const)
before stretching after stretchingoriginal image
|F(u,v)| |D(u,v)|
![Page 40: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/40.jpg)
DFT Properties: (1) Separability
• The 2D DFT can be computed using 1D transforms only:
Forward DFT:
2 ( ) 2 ( ) 2 ( )ux vy ux vy
j j jN N Ne e e
kernel isseparable:
![Page 41: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/41.jpg)
DFT Properties: (1) Separability (cont’d)
• Rewrite F(u,v) as follows:
• Let’s set:
• Then:
![Page 42: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/42.jpg)
• How can we compute F(x,v)?
• How can we compute F(u,v)?
DFT Properties: (1) Separability (cont’d)
)
N x DFT of rows of f(x,y)
DFT of cols of F(x,v)
![Page 43: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/43.jpg)
DFT Properties: (1) Separability (cont’d)
![Page 44: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/44.jpg)
DFT Properties: (2) Periodicity
• The DFT and its inverse are periodic with period N
![Page 45: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/45.jpg)
Symmetry Properties
![Page 46: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/46.jpg)
DFT Properties: (4) Translation
f(x,y) F(u,v)
) N
• Translation in spatial domain:
• Translation in frequency domain:
![Page 47: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/47.jpg)
DFT Properties: (4) Translation (cont’d)
• Warning: to show a full period, we need to translate the origin of the transform at u=N/2 (or at (N/2,N/2) in 2D)
|F(u-N/2)|
|F(u)|
![Page 48: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/48.jpg)
DFT Properties: (4) Translation (cont’d)
• To move F(u,v) at (N/2, N/2), take
) N
) N
![Page 49: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/49.jpg)
DFT Properties: (4) Translation (cont’d)
no translation after translation
![Page 50: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/50.jpg)
DFT Properties: (5) Rotation
• Rotating f(x,y) by θ rotates F(u,v) by θ
![Page 51: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/51.jpg)
DFT Properties: (6) Addition/Multiplication
but …
![Page 52: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/52.jpg)
DFT Properties: (7) Scale
![Page 53: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/53.jpg)
DFT Properties: (8) Average value
So:
Average:
F(u,v) at u=0, v=0:
![Page 54: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/54.jpg)
Magnitude and Phase of DFT
• What is more important?
• Hint: use the inverse DFT to reconstruct the input image using magnitude or phase only information
magnitude phase
![Page 55: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/55.jpg)
Magnitude and Phase of DFT (cont’d)
Reconstructed image using
magnitude only
(i.e., magnitude determines the
strength of each component!)
Reconstructed image using
phase only
(i.e., phase determines
the phase of each component!)
![Page 56: Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.](https://reader035.fdocument.pub/reader035/viewer/2022081418/56649cc15503460f94988497/html5/thumbnails/56.jpg)
Magnitude and Phase of DFT (cont’d)