Total Variation and Geometric Regularization For Inverse Problems
Total Variation and Geometric Regularization For Inverse Problems
Total Variation and Geometric Regularization For Inverse Problems
Inverse Problems
Regularization in Statistics
September 7-11, 2003
BIRS, Banff, Canada
Tony Chan
Department of Mathematics, UCLA
Outline
Image restoration
Image segmentation
Elliptic Inverse problems
Medical tomography: PET, EIT
Statistical:
Data driven priors
Stochastic/probabilistic frameworks
Variational models -> EM, Monte Carlo
Rn
f | u | dx (
f ds)dr
{u r }
Observed image
Related to
True Image
Through
Blur
And
Noise
Initial
z K u n
Blur
Blur+Noise
Regularization:
Variational Model:
1
2
min f (u ) TV (u ) || Ku z ||
u
2
Gradient flow:
u
ut g (u )
( K Ku K * z )
| u |
anisotropic diffusion
u
0
n
data fidelity
Graffiti Removal
J [u ] | u | dxdy | u u 0 |2 dxdy,
2E
E D
u
e (u u 0 ) 0,
| u |
z E;
0 , z D.
TV Inpaintings: disocclusion
Examples of TV Inpaintings
TV Zoom-in
Edge Inpainting
edge tube T
Extensions
Color (S.H. Kang thesis 02)
Eulers Elastica Inpainting (C-Kang-Shen 01)
Minimizing TV + Boundary Curvature
min
u ,S
( | u | dS
2
Geometric Regularization
Minimizing surface area of boundaries and/or
volume of objects
Well-studied in differential geometry: curvaturedriven flows
Crucial: representation of surface & volume
Need to allow merging and pinching-off of
surfaces
Powerful technique: level set methodology
(Osher/Sethian 86)
C ( x, y ) | ( x, y ) 0
Inside C
Outside C
Outside C
Normal n
, Curvature K div
| |
| |
Example: mean curvature motion
* Allows automatic topology changes, cusps, merging and breaking.
Originally developed for tracking fluid interfaces.
Evolutions
Detected Objects
g 0, g , lim g (t ) 0
t
Example: g (| u |)
0
1
p
1 | G u 0 |
Limitations
- detects only objects with sharp edges defined by gradients
- the curve can pass through the edge
- smoothing may miss edges in presence of noise
- not all can handle automatic change of topology
Examples
c
|
dxdy
0
1
inside ( C )
where
Fit > 0
|
u
c
|
dxdy
0
2
outside ( C )
c1 average(u0 ) inside C
c2 average(u0 ) outside C
Fit > 0
Fit > 0
Fit ~ 0
c1 ,c2 ,C
inside ( C )
| u0 c1 | dxdy
2
|
u
c
|
dxdy
0
2
outside ( C )
Mumford-Shah Segmentation 89
min
u ,S
( | u | (u u0 ) ) dS
2
S=edges
C ( x, y ) : ( x, y ) 0
Length | C | | H ( ) |
1, if 0
H ( )
0, if 0
u( x, y ) c1H ( ( x, y )) c2 (1 H ( ( x, y )))
The level set formulation of the active contour model
inf F ( c1 , c2 , )
c1 ,c2 ,
F (c1 , c2 , ) | H ( ) | H ( )dxdy
| u0 ( x, y ) c1 |2 H ( )dxdy | u0 ( x, y ) c2 |2 (1 H ( ))dxdy
c1 ,c2 ,
H ( )dxdy
H ( )dxdy
u (1 H ( ))dxdy
0
, c2 ( )
(1 H ( ))dxdy
Equation for (t , x, y )
2
2
(u0 c1 ) (u0 c2 )
( ) div
t
| |
(0, x, y ) 0 ( x, y )
Experimental Results
Evolution of C Averages (c1 , c2 )
Advantages
Automatically detects
interior contours!
Works very well for
concave objects
Robust w.r.t. noise
Detects blurred contours
The initial curve can be
placed anywhere!
Allows for automatical
change of topolgy
Europe nightlights
4-phase segmentation
2 level set functions
Curves :
{1 0} { 2 0}
Curves :
{ 0}
2-phase segmentation
1 level set function
1 0
1 0
2 0
2 0
1 0
2 0
1 0
2 0
1 0, 2 0,
1 0, 2 0,
(1 , 2 )
1 0, 2 0,
1 0, 2 0
( c , )
| H (1 ) | | H ( 2 ) |
Phase 11
Phase 10
Phase 01
mean(11)=45
mean(10)=159
mean(01)=9
Phase 00
mean(00)=103
min
u ,S
( | u |2 (u f ) 2 ) dS
S