










































Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
A part of the 'intro to computer vision' lecture series by greg shakhnarovich. In this lecture, the focus is on filters, specifically 2d cross-correlation filtering and convolution. The lecture covers mean and median filters, denoising using mean and median filters, and the gaussian noise model. The document also discusses the relationship between filter size (k) and standard deviation (σ) in gaussian filters.
Typology: Lecture notes
1 / 50
This page cannot be seen from the preview
Don't miss anything!
Greg Shakhnarovich
April 13, 2010
2D cross-correlation filtering of image I(x, y) with
(2k + 1) × (2k + 1) filter H:
(I ⊗ H)(i, j) =
∑^ k
q=−k
∑k
r=−k
I(x + q, y + r) · H(q, r)
− 2 − (^1 0 1 )
2
1
0
1
− 2
2D cross-correlation filtering of image I(x, y) with (2k + 1) × (2k + 1) filter H:
(I ⊗ H)(i, j) =
∑^ k
q=−k
∑k
r=−k
I(x + q, y + r) · H(q, r)
j
i
− 2 − (^1 0 1 )
2
1
0
1
− 2
2D cross-correlation filtering of image I(x, y) with (2k + 1) × (2k + 1) filter H:
(I ⊗ H)(i, j) =
∑^ k
q=−k
∑k
r=−k
I(x + q, y + r) · H(q, r)
2D convolution:
(I ∗ H)(i, j) =
∑^ k
q=−k
∑k
r=−k
I(x − q, y − r) · H(q, r)
j
i
− 2 − (^1 0 1 )
2
1
0
1
− 2
Additive noise model:
I^ ˜(x, y) = I(x, y) + ν(x, y)
Assumption I: ν(x, y) is a random variable, independent of (x, y)
Assumption II: white noise, i.e., zero mean E[ν(x, y)] = 0
Gaussian noise:
p(ν; σ) =
2 πσ^2
exp
ν 2
2 σ^2
(1D) Gaussian with mean μ and variance σ 2 :
p(x; μ, σ) =
2 πσ^2
exp
2 σ^2
(x − μ) 2
The mean determines location
The variance determines shape
x
p(x)
μ = 0, σ = 1 μ = 2
(1D) Gaussian with mean μ and variance σ 2 :
p(x; μ, σ) =
2 πσ^2
exp
2 σ^2
(x − μ) 2
The mean determines location
The variance determines shape
x
p(x)
μ = − 3 μ = 0, σ = 1 μ = 2
(1D) Gaussian with mean μ and variance σ 2 :
p(x; μ, σ) =
2 πσ^2
exp
2 σ^2
(x − μ) 2
The mean determines location
The variance determines shape
x
p(x)
μ = 0, σ = 1
μ = 2, σ =. 25
σ = 2
(1D) Gaussian with mean μ and variance σ 2 :
p(x; μ, σ) =
2 πσ^2
exp
2 σ^2
(x − μ) 2
The mean determines location
The variance determines shape
x
p(x)
μ = 0, σ = 1
μ = 2, σ =. 25
Extremely widely used. Some reasons:
noisy mean, k = 3 median, k = 3
noisy mean, k = 3 median, k = 3
Gaussian filter, k = 3, σ = 1:
Mean filtering: convolve signal
with
−k 0 k
1 /(2k + 1)
Idea: instead,convolve with a filter shaped like a Gaussian
Mean filtering: convolve signal
with
−k 0 k
1 /(2k + 1)
Idea: instead,convolve with a filter shaped like a Gaussian
Actual digital filter Gσ is an approximation of the Gaussian function
p(x; 0, σ), sampled at integer coordinates x = −k,... , k.