Download presentation
Presentation is loading. Please wait.
Published byEskil Helland Modified over 6 years ago
1
Frequency Domain – Homomorphic Filters & Nyquist
5/28/2019
2
References Gonzales and Wood second edition
Gonzales and Wood first edition Jain 5/28/2019
3
Homomorphic Filtering
Based on illumination – reflectance model f(x,y) = i(x,y) r(x,y) Heuristic used (the following is usually true) Illumination across the scene varies (corresponds to lower frequencies) Reflectance varies more abruptly, e.g. at the junction of 2 dissimilar objects (corresponds to higher frequencies) If the signal can be properly separated we can focus on the reflectance 5/28/2019
4
Homomorphic Filtering – Strategy / Parameters
From [1] 5/28/2019
5
Homomorphic Filtering - Example
From [1] 5/28/2019
6
DFT Periodicity From [1] 5/28/2019
7
Separability From [1] 5/28/2019
8
Need for correct padding
From [1] Compare 5/28/2019 - need more padding
9
Padded inputs From [1] A=period of f B=period of h Padding P>=A+B-1
5/28/2019
10
2-D Padding From [1] 5/28/2019
11
Convolution Theorem Definition
M-1 N-1 f(x,y)*h(x,y) = (1/MN) Σ Σ f(m,n)h(x-m,y-n) m=0 n=0 Transform Pairs f(x,y)*h(x,y) F(u,v)H(u,v) f(x,y)h(x,y) F(u,v)*H(u,v) 5/28/2019
12
Correlation Theorem Definition
M-1 N-1 f(x,y) h(x,y) = (1/MN) Σ Σ f*(m,n)h(x+m,y+n) m=0 n=0 Transform Pairs f(x,y) h(x,y) F*(u,v)H(u,v) f*(x,y)h(x,y) F(u,v) H(u,v) Autocorrelation theorem: Set h(x,y) = f(x,y) f(x,y) f(x,y) |F(u,v)|2 5/28/2019
13
Fourier Properties From [1] 5/28/2019
14
Fourier Properties From [1] 5/28/2019
15
Fourier Properties From [1] 5/28/2019
16
Fourier Properties From [1] 5/28/2019
17
Fourier vs FFT Computational Advantage
From [1] 5/28/2019
18
5/28/2019
19
From [2] 5/28/2019
20
From [2] 5/28/2019
21
5/28/2019
22
From [3] 5/28/2019
Similar presentations
© 2025 SlidePlayer.com Inc.
All rights reserved.