Scribd
Upload
75 views21 pages

1-D DFT in As Basis Expansion: Forward Transform

The document discusses the discrete Fourier transform (DFT) and some of its applications. It begins with explanations of 1D and 2D DFT, including how they can be computed via matrix operations or using basis functions. It then discusses how to implement the 2D DFT more efficiently using separability and 1D FFTs. Finally, it provides examples of DFT applications, including fast convolution, feature correlation in images, and different types of image filters defined in the frequency domain.

Uploaded by

Sakthi Velan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
75 views21 pages

1-D DFT in As Basis Expansion: Forward Transform

The document discusses the discrete Fourier transform (DFT) and some of its applications. It begins with explanations of 1D and 2D DFT, including how they can be computed via matrix operations or using basis functions. It then discusses how to implement the 2D DFT more efficiently using separability and 1D FFTs. Finally, it provides examples of DFT applications, including fast convolution, feature correlation in images, and different types of image filters defined in the frequency domain.

Uploaded by

Sakthi Velan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 21

1-D DFT in as basis expansion

Forward
transform

real(A)

imag(A)

u=0

Inverse
transform

basis

u=7

1-D DFT in matrix notations

real(A)

imag(A)

u=0

N=8

u=7

1-D DFT of different lengths

real(A)

imag(A)

N=8

N=16

N=32

N=64

2-D Fourier basis


real

real(

imag

imag(

2-D FT illustrated
real-valued
real

imag

Explaining 2D-DFT
fft2

ifft
2

another example: amplitude vs. phase


A = Aron
FA = fft2(A)

P=
Phyllis
FP
= fft2(P)

log(abs(FA))

angle(FA)

ifft2(abs(FA),
angle(FP))

pated from http://robotics.eecs.berkeley.edu/~sastry/ee20/vision2/vision2.html

log(abs(FP))

angle(FP)

ifft2(abs(FP),
angle(FA))

fast implementation of 2-D DFT


2 Dimensional DFT is separable

1-D DFT
of f(m,n)
w.r.t n

1-D DFT
of F(m,v)
w.r.t m

1D FFT: O(Nlog2N)
2D DFT nave implementation: O(N4)
2D DFT as 1D FFT for each row and then
for each column

Implement IDFT as DFT


DFT2

IDFT2

DFT application #1: fast Convolution

O(N2)
Spatial
filtering
f(x.y)*h(x.y
)

DFT application #1: fast convolution

O(N2log2N
)

O(N2)
Spatial
filtering
f(x.y)*h(x.y
)

O(N4)

O(N2log2N
)

DFT application #2: feature correlation


Find letter a in the following image

bw = imread('text.png'); a = imread(letter_a.png');
% Convolution is equivalent to correlation if you rotate the
convolution kernel by 180deg
C = real(ifft2(fft2(bw) .*fft2(rot90(a,2),256,256)));
% Use a threshold that's a little less than max.
% Display showing pixels over threshold.
thresh = .9*max(C(:));

figure, imshow(C > thresh)

from Matlab image processing demos

DFT application #3: image filters


Zoology of image filters
Smoothing / Sharpening / Others
Support in time vs. support in frequency
c.f. FIR / IIR
Definition: spatial domain/frequency
domain
Separable / Non-separable

smoothing filters: ideal low-pass

butterworth filters

Gaussian filters

You might also like