1 level sets for inverse problems and optimization i martin burger johannes kepler university linz...

42
1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing Radon Institute for Computational & Applied Mathematics

Post on 22-Dec-2015

221 views

Category:

Documents


1 download

TRANSCRIPT

Page 1: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

1

Level Sets for Inverse Problems and Optimization I

Martin Burger

Johannes Kepler University LinzSFB Numerical-Symbolic-Geometric Scientific ComputingRadon Institute for Computational & Applied Mathematics

Page 2: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 2

Collaborations

Benjamin Hackl (Linz)

Wolfgang Ring, Michael Hintermüller (Graz)

Page 3: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 3

Outline Introduction

Shape Gradient Methods

Framework for Level Set Methods

Examples

Levenberg-Marquardt Methods

Page 4: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 4

IntroductionMany applications deal with the reconstruction and optimization of geometries (shapes, topologies), e.g.:

Identification of piecewise constant parameters in PDEs Inverse obstacle scattering Inclusion / cavity detection Topology optimization Image segmentation

Page 5: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 5

Introduction In such applications, there is no natural a-

priori information on shapes or topological structures of the solution (number of connected components, star-shapedness, convexity, ...)

Flexible representations of the shapes needed!

Page 6: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 6

Level Set Methods Osher & Sethian, JCP 1987 Sethian, Cambridge Univ. Press 1999 Osher & Fedkiw, Springer, 2002

Based on dynamic implicit shape representation

with continuous level-set function

Page 7: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 7

Level Set Methods Change of the front is translated to a change of the level set function

Automated treatment of topology change

Page 8: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 8

Level Set Flows

Geometric flow of the level sets of can be translated into nonlinear differential equation for („level set equation“)

Appropriate solution concept: Viscosity solutions (Crandall, Lions 1981-83,Crandall-Ishii-Lions 1991)

Page 9: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 9

Level Set Methods

Geometric primitives can expressed via derivatives of the level set function

Normal

Mean curvature

Page 10: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 10

Shape Optimization The typical setup in shape optimization

and reconstruction is given by

where is a class of shapes (eventually with additional constraints).

For formulation of optimality conditons and solution, derivatives are needed

Page 11: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 11

Shape Optimization Calculus on shapes by the speed method: Natural variations are normal velocities

Page 12: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 12

Shape Derivatives Derivatives can be computed by the level set

methodExample:

Formal computation:

Page 13: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 13

Shape Derivatives Formal application of co-area formula

Page 14: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 14

Shape Optimization Framework to construct gradient-based methods for shape design problems (MB, Interfaces and Free Boundaries 2004)

After choice of Hilbert space norm for normal velocities, solve variational problem

Page 15: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 15

Shape Optimization

Equivalent equation for velocity Vn

Update by motion of shape in normal direction for a small time , new shape

Expansion

Page 16: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 16

Shape Optimization From definition (with )

Descent method, time step can be chosen by standard optimization rules (Armijo-Goldstein)

Gradient method independent of parametrization, can change topology, but but only by splitting Level set method used to perform update step

Page 17: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 17

Inverse Obstacle Problem Identify obstacle from partial measurements f

of solution on

Page 18: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 18

Inverse Obstacle Problem Shape derivative

Adjoint method

Page 19: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 19

Inverse Obstacle Problem Shape derivative

Simplest choice of velocity space

Velocity

Page 20: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 20

Example: 5% noise

- Norm - Norm

Page 21: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 21

Example: 5% noise

Residual

Page 22: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 22

Example: 5% noise

- error

Page 23: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 23

Inverse Obstacle Problem Weaker Sobolev space norm H-1/2 for velocity

yields faster method

Easy to realize (Neumann traces, DtN map)

For a related obstacle problem (different energy functional), complete convergence analysis of level set method with H-1/2 norm (MB-Matevosyan 2006)

Page 24: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 24

Tomography-Type Problem Identify obstacle from boundary

measurements z of solution on

Page 25: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 25

Tomography, Single Measurement

- Norm - Norm

Page 26: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 26

Tomography

Residual

Page 27: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 27

Tomography

- error

Page 28: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 28

Fast Methods Framework can also be used to construct Newton-type methods for shape design problems (Hintermüller-Ring 2004, MB 2004)

If shape Hessian is positive definite, choose

For inverse obstacle problems, Levenberg- Marquardt level set methods can be constructed in the same way

Page 29: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 29

Levenberg-Marquardt Method Inverse problems with least-squares functional

Choose variable scalar product

Variational characterization

Page 30: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 30

Levenberg-Marquardt Method Example 1:

where , and denotes the indicator function of .

Page 31: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 31

Levenberg-Marquardt Method 1% noise, =10-7, Iterations 10 and 15

Page 32: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 32

Levenberg-Marquardt Method 1% noise, =10-7, Iterations 20 and 25

Page 33: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 33

Levenberg-Marquardt Method 4% noise, =10-7, Iterations 10 and 20

Page 34: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 34

Levenberg-Marquardt Method 4% noise, =10-7, Iterations 30 and 40

Page 35: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 35

Levenberg-Marquardt Method Residual and L1-error

Page 36: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 36

Levenberg-Marquardt Method Example 2:

where and denotes the indicator function of .

Page 37: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 37

Levenberg-Marquardt Method No noise

Iterations2,4,6,8

Page 38: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 38

Levenberg-Marquardt Method Residual and L1-error

Page 39: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 39

Levenberg-Marquardt Method Residual and L1-error

Page 40: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 40

Levenberg-Marquardt Method 0.1 % noise

Iterations

5,10,20,25

Page 41: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 41

Levenberg-Marquardt Method 1% noise 2% noise

3% noise 4% noise

Page 42: 1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing

Level Set Methods for Inverse Problems

San Antonio, January 2005 42

Download and Contact

Papers and Talks:

www.indmath.uni-linz.ac.at/people/burger

e-mail: [email protected]