Scribd
Upload
12 views19 pages

Ip 05 Fourier

The document discusses Fourier transforms and how they can be used to decompose functions and images into basis functions. It explains Fourier series and how discrete Fourier transforms can be applied to images, representing them in the frequency domain. The convolution theorem is also covered, showing how convolutions can be performed by multiplication in the frequency domain.

Uploaded by

al.obaidi.m.k.i
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views19 pages

Ip 05 Fourier

The document discusses Fourier transforms and how they can be used to decompose functions and images into basis functions. It explains Fourier series and how discrete Fourier transforms can be applied to images, representing them in the frequency domain. The convolution theorem is also covered, showing how convolutions can be performed by multiplication in the frequency domain.

Uploaded by

al.obaidi.m.k.i
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

Image Processing

Fourier Transform

Slide 1
Function Spaces
Images are not vectors. Images are mappings:
Moreover, images are functions (continuous domain):
However, functions can be seen as vectors as well:

Vector Function

Domain
Mapping
Space
Scalar product
Length

→ Images are not vectors, they are more, but they are vectors too

Image Processing: Fourier Transform 2


Base in vector spaces
Task: decompose a vector into its “components” in a base

with the base vectors and coefficients

Properties of base vectors:


1. Vectors should span the space → decomposition exists for all
2. Vectors should be independent (no vector can be represented
as a linear combination of ) → decomposition is unique

Special case – orthonormal base:


• All are orthogonal to each other, i.e. for all
• All have the same length (=1), i.e.
→
Image Processing: Fourier Transform 3
Base in function spaces
The space has infinite dimension →
• Infinite number of base functions , i.e. , replaces
• A continuous function

The task is to decompose a given function into the base ones:

Orthonormal base means:

• orthogonal

• normalized

Then

Image Processing: Fourier Transform 4


Fourier Series
Space:
all periodic functions with the period , i.e.

Base functions: and

Properties:
1. Orthonormal

2. Span the function space (Jean Baptiste Joseph Fourier, 1822)

Image Processing: Fourier Transform 5


Fourier Series
Decomposition:

with

Image Processing: Fourier Transform 6


Fourier Series

Image Processing: Fourier Transform 7


Complex numbers
Euler’s Formula:

Decomposition:

Coefficients:

Image Processing: Fourier Transform 8


General functions
Arbitrary periodic functions – transition

Arbitrary non-periodic functions – limit

1. Coefficients become continuous


2. The sequence becomes a complex function of a real-
valued argument

The summands are “not interesting” by themselves, but rather:


• amplitude-spectrum and

• phase-spectrum

Image Processing: Fourier Transform 9


2D Discrete Fourier Transform
Two primary arguments: and

Two frequencies: horizontal and vertical

Transform:

Inverse:

Image Processing: Fourier Transform 10


2D Discrete Fourier Transform

Convolution masks for different frequencies

Image Processing: Fourier Transform 11


Amplitude-spectrums
Images

Fourier Transforms

Image Processing: Fourier Transform 12


Amplitude vs. Phase

Image Processing: Fourier Transform 13


Example – Directions

Image Processing: Fourier Transform 14


Example – Directions

Image Processing: Fourier Transform 15


Convolution Theorem

: operator (Fourier Transform)


: the image of a function in the frequency space

Proof: … analogously

Image Processing: Fourier Transform 16


Convolution Theorem
Corollary 1:
a convolution can be performed in the frequency space by

Time complexity:
Fourier Transform can be done with
Component-by-component multiplication:
→ all together
instead of by the direct implementation

Corollary 2:
each filter has its spectral characteristics in the frequency space.

1. It is possible to analyze filter characteristics


2. It is possible to design filters with the necessary properties
Image Processing: Fourier Transform 17
Convolution Theorem
Some filters and their spectrums

Image Processing: Fourier Transform 18


Further themes:
Image say “where” but not “what”.
Spectrums say “what” but not “where”.

Windowed Fourier Transform – spectrums for (small) windows at


each position.

Cosine Transform (1D, discrete, DCT-II – JPEG):

Wavelet Transform:

− a “mother function”, e.g. Complex Mexican hat wavelet


Image Processing: Fourier Transform 19

You might also like