Академический Документы
Профессиональный Документы
Культура Документы
Gordon Wetzstein
Stanford University
Topics
• Fixed pattern noise
• Gaussian noise
• Image reconstruction using MAP
• Poisson noise
• Richardson-Lucy algorithm
• RL + TV prior
• The SNR with three types of noise sources
What’s a Pixel?
wikipedia
What’s a Pixel?
bobatkins.com
Noise
• Noise is (usually) bad!
• Dead or “hot”
pixels, dust, pixel
sensitivity
variations …
• remove with dark
frame calibration:
I captured - I dark
I=
I white - I dark
on RAW image!
not JPEG (nonlinear)
Emil Martinec
Noise
• Other than that, different noise follows different statistical distributions,
these two are crucial:
• Gaussian
• Poisson
Gaussian Noise
• Thermal, read, amplifier
+ =
Gaussian Noise
x ∼~ N ( x,0 )
• With i.i.d. Gaussian noise: b = x +h h ~∼ N ( 0,s 2 )
(independent and identically-distributed)
• We want to find 𝑥
Gaussian Noise
x ∼~ N ( x,0 )
• With i.i.d. Gaussian noise: b = x +h h ~∼ N ( 0,s 2 )
(independent and identically-distributed)
b ∼~ N ( x,s 2 )
-
( b-x )
2
1
p ( b | x,s ) = e 2s 2
2ps 2
Gaussian Noise
x ∼~ N ( x,0 )
• With i.i.d. Gaussian noise: b = x +h h ~∼ N ( 0,s 2 )
(independent and identically-distributed)
• Bayes’ rule:
b ∼~ N ( x,s 2 )
-
( b-x )
2
1
p ( b | x,s ) = e 2s 2
2ps 2
Gaussian Noise - MAP
x ∼~ N ( x,0 )
• With i.i.d. Gaussian noise: b = x +h h ~∼ N ( 0,s 2 )
(independent and identically-distributed)
• Bayes’ rule:
• Maximum-a-posteriori estimation:
b ∼~ N ( x,s 2
)
-
( b-x )
2
1
p ( b | x,s ) = e 2s 2
p( x) = 1
Gaussian Noise – MAP Self Similarity Prior
• We can use self-similarity as general image prior (not just for denoising)
s 2 = l /s
s = l /s
(h parameter in most NLM
implementations is std. dev.)
• Bayes’ rule:
• Maximum-a-posteriori estimation:
b ~∼ N ( Ax,s 2
)
-
( b-Ax )
2
1
p ( b | x,s ) = e 2s 2
k -N
• Poisson distribution N e
f (k; N ) =
k!
Photon Noise - SNR
Signal-to-noise ratio
(mean / 𝜎)
N
SNR =
N
SNR in dB
N photons: s = N
2N photons: s = 2 N 1,000 10,000
N
𝑆𝑁𝑅 is nonlinear!
Photon Noise - SNR
signal-to-noise ratio
N
SNR =
N
N photons: s = N
2N photons: s = 2 N
nonlinear!
wikipedia
Maximum Likelihood Solution for Poisson Noise
• Image formation:
• Probability of measurement 𝑖:
• Gradient:
Maximum Likelihood Solution for Poisson Noise
• Richardson-Lucy algorithm:
iterative approach to ML estimation for Poisson noise
• Simple idea:
1. At solution, gradient will be zero
2. When converged, further iterations will not change, i.e.
Richardson-Lucy Algorithm
• Equate gradient to zero
=0
=0
• Set
Richardson-Lucy Algorithm
• For any multiplicative update rule scheme:
• start with positive initial guess (e.g. random values)
• apply iteration scheme
• future updates are guaranteed to remain positive
• always get smaller residual
• Let’s try to incorporate the one prior we have learned: total variation
Richardson-Lucy Algorithm + TV
• Log-likelihood function:
• Gradient:
𝐷
Richardson-Lucy Algorithm + TV
• Gradient of anisotropic TV term
RL+TV, lambda=0.025
RL+TV, lambda=0.005
RL
PQet
=
PQet + Dt + N r2
P = incident photon flux (photons/pixel/sec)
Q e = quantum efficiency
t = eposure time (sec)
D = dark current (electroncs/pixel/sec), including hot pixels
N r = read noise (rms electrons/pixel), including fixed pattern noise
Signal-to-Noise Ratio (SNR)
mean pixel value m signal
SNR = =
standard deviation of pixel value s noise
PQet
= signal-dependent
PQet + Dt + N 2
r signal-independent
• Please read the lecture notes, especially for the “clean” ADMM derivation for solving the maximum likelihood estimation
of Poisson reconstruction with TV prior!