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

Slides:



Advertisements
Similar presentations
Splines I – Curves and Properties
Advertisements

Various Regularization Methods in Computer Vision Min-Gyu Park Computer Vision Lab. School of Information and Communications GIST.
Level set based Image Segmentation Hang Xiao Jan12, 2013.
Active Contours, Level Sets, and Image Segmentation
FIRST (FP7/Marie-Curie) Fronts and Interfaces in Science & Technlogy Adaptive and directional local processing in image processing Arpan Ghosh Supervisor:
Introduction to Variational Methods and Applications
Medical Image Segmentation: Beyond Level Sets (Ismail’s part) 1.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2013 – 12269: Continuous Solution for Boundary Value Problems.
Optimization of thermal processes
Introduction Nematic liquid crystals are cylindrically rod-like shaped molecules, which can be characterized by the orientations of their directors. Directors.
Nonlinear Regression Ecole Nationale Vétérinaire de Toulouse Didier Concordet ECVPT Workshop April 2011 Can be downloaded at
Inexact SQP Methods for Equality Constrained Optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.
Wangfei Ningbo University A Brief Introduction to Active Appearance Models.
1 Model Hierarchies for Surface Diffusion Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing Radon Institute.
Image Segmentation some examples Zhiqiang wang
Image Segmentation and Active Contour
1 Lecture #5 Variational Approaches and Image Segmentation Lecture #5 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Inverse Problems in Semiconductor Devices Martin Burger Johannes Kepler Universität Linz.
Martin Burger Institut für Numerische und Angewandte Mathematik CeNoS Level set methods for imaging and application to MRI segmentation.
Front propagation in inverse problems and imaging Martin Burger Institute for Computational and Applied Mathematics European Institute for Molecular Imaging.
Numerical Optimization
1 Curvature Driven Flows Allen Tannenbaum. 2 Basic curve evolution: Invariant Flows  Planar curve:  General flow:  General geometric flow:
1 Inverse Problems for Electrodiffusion Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing Radon Institute.
Motion Analysis (contd.) Slides are from RPI Registration Class.
CSci 6971: Image Registration Lecture 4: First Examples January 23, 2004 Prof. Chuck Stewart, RPI Dr. Luis Ibanez, Kitware Prof. Chuck Stewart, RPI Dr.
1 Total variation minimization Numerical Analysis, Error Estimation, and Extensions Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric.
Lecture 2 Linear Variational Problems (Part II). Conjugate Gradient Algorithms for Linear Variational Problems in Hilbert Spaces 1.Introduction. Synopsis.
Preconditioned Level Set Flows Martin Burger Institute for Computational and Applied Mathematics European Institute for Molecular Imaging (EIMI) Center.
Martin Burger Institut für Numerische und Angewandte Mathematik European Institute for Molecular Imaging CeNoS Total Variation and related Methods Numerical.
Curves Locus of a point moving with one degree of freedom
1 Inverse Problems in Ion Channels (ctd.) Martin Burger Bob Eisenberg Heinz Engl Johannes Kepler University Linz, SFB F 013, RICAM.
Error Estimation in TV Imaging Martin Burger Institute for Computational and Applied Mathematics European Institute for Molecular Imaging (EIMI) Center.
Comp 775: Deformable models: snakes and active contours Marc Niethammer, Stephen Pizer Department of Computer Science University of North Carolina, Chapel.
Fast Optimal Design of Semiconductor Devices Martin Burger Institute for Computational and Applied Mathematics European Institute for Molecular Imaging.
Optical Flow Estimation using Variational Techniques Darya Frolova.
Martin Burger Total Variation 1 Cetraro, September 2008 Numerical Schemes Wrap up approximate formulations of subgradient relation.
Numerical Methods for Partial Differential Equations
PHY 042: Electricity and Magnetism
Johann Radon Institute for Computational and Applied Mathematics: Summary and outlook.
Evolving Curves/Surfaces for Geometric Reconstruction and Image Segmentation Huaiping Yang (Joint work with Bert Juettler) Johannes Kepler University of.
Dual Evolution for Geometric Reconstruction Huaiping Yang (FSP Project S09202) Johannes Kepler University of Linz 1 st FSP-Meeting in Graz, Nov ,
1 PDE Methods are Not Necessarily Level Set Methods Allen Tannenbaum Georgia Institute of Technology Emory University.
Deformable Models Segmentation methods until now (no knowledge of shape: Thresholding Edge based Region based Deformable models Knowledge of the shape.
CS 8751 ML & KDDSupport Vector Machines1 Support Vector Machines (SVMs) Learning mechanism based on linear programming Chooses a separating plane based.
Tensor and Emission Tomography Problems on the Plane A. L. Bukhgeim S. G. Kazantsev A. A. Bukhgeim Sobolev Institute of Mathematics Novosibirsk, RUSSIA.
7.1. Mean Shift Segmentation Idea of mean shift:
Evolution-based least-squares fitting using Pythagorean hodograph spline curves Speaker: Ying.Liu November
Lecture 6 : Level Set Method
Discontinuous Galerkin Methods Li, Yang FerienAkademie 2008.
Course 13 Curves and Surfaces. Course 13 Curves and Surface Surface Representation Representation Interpolation Approximation Surface Segmentation.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
Course 11 Optical Flow. 1. Concept Observe the scene by moving viewer Optical flow provides a clue to recover the motion. 2. Constraint equation.
Introduction to Level Set Methods: Part II
Overview of Propagating Interfaces Donald Tanguay October 30, 2002.
Phy 303: Classical Mechanics (2) Chapter 3 Lagrangian and Hamiltonian Mechanics.
Splines I – Curves and Properties based on: Michael Gleicher Curves, chapter 15 in Fundamentals of Computer Graphics, 3 rd ed. (Shirley & Marschner) Slides.
Chapter 2-OPTIMIZATION
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
Implicit Active Shape Models for 3D Segmentation in MR Imaging M. Rousson 1, N. Paragio s 2, R. Deriche 1 1 Odyssée Lab., INRIA Sophia Antipolis, France.
1 Development of a Numerical Optimisation Method for Blowing Glass Parison Shapes Hans Groot.
Amir Yavariabdi Introduction to the Calculus of Variations and Optical Flow.
Fast 3D Least-squares Migration with a Deblurring Filter Wei Dai.
Sahar Sargheini, Alberto Paganini, Ralf Hiptmair, Christian Hafner
Level Set Tree Feature Detection
Non-linear Least-Squares
CSCE 441: Computer Graphics Forward/Inverse kinematics
Computer Animation Algorithms and Techniques
Presentation transcript:

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

Level Set Methods for Inverse Problems San Antonio, January Collaborations Benjamin Hackl (Linz) Wolfgang Ring, Michael Hintermüller (Graz)

Level Set Methods for Inverse Problems San Antonio, January Outline Introduction Shape Gradient Methods Framework for Level Set Methods Examples Levenberg-Marquardt Methods

Level Set Methods for Inverse Problems San Antonio, January Introduction Many 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

Level Set Methods for Inverse Problems San Antonio, January 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!

Level Set Methods for Inverse Problems San Antonio, January 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

Level Set Methods for Inverse Problems San Antonio, January Level Set Methods Change of the front is translated to a change of the level set function Automated treatment of topology change

Level Set Methods for Inverse Problems San Antonio, January 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 ,Crandall- Ishii-Lions 1991)

Level Set Methods for Inverse Problems San Antonio, January Level Set Methods Geometric primitives can expressed via derivatives of the level set function Normal Mean curvature

Level Set Methods for Inverse Problems San Antonio, January 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

Level Set Methods for Inverse Problems San Antonio, January Shape Optimization Calculus on shapes by the speed method: Natural variations are normal velocities

Level Set Methods for Inverse Problems San Antonio, January Shape Derivatives Derivatives can be computed by the level set method Example: Formal computation:

Level Set Methods for Inverse Problems San Antonio, January Shape Derivatives Formal application of co-area formula

Level Set Methods for Inverse Problems San Antonio, January 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

Level Set Methods for Inverse Problems San Antonio, January Shape Optimization Equivalent equation for velocity V n Update by motion of shape in normal direction for a small time , new shape Expansion

Level Set Methods for Inverse Problems San Antonio, January 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

Level Set Methods for Inverse Problems San Antonio, January Inverse Obstacle Problem Identify obstacle from partial measurements f of solution on

Level Set Methods for Inverse Problems San Antonio, January Inverse Obstacle Problem Shape derivative Adjoint method

Level Set Methods for Inverse Problems San Antonio, January Inverse Obstacle Problem Shape derivative Simplest choice of velocity space Velocity

Level Set Methods for Inverse Problems San Antonio, January Example: 5% noise - Norm - Norm

Level Set Methods for Inverse Problems San Antonio, January Example: 5% noise Residual

Level Set Methods for Inverse Problems San Antonio, January Example: 5% noise - error

Level Set Methods for Inverse Problems San Antonio, January 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)

Level Set Methods for Inverse Problems San Antonio, January Tomography-Type Problem Identify obstacle from boundary measurements z of solution on

Level Set Methods for Inverse Problems San Antonio, January Tomography, Single Measurement - Norm - Norm

Level Set Methods for Inverse Problems San Antonio, January Tomography Residual

Level Set Methods for Inverse Problems San Antonio, January Tomography - error

Level Set Methods for Inverse Problems San Antonio, January 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

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method Inverse problems with least-squares functional Choose variable scalar product Variational characterization

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method Example 1: where, and denotes the indicator function of.

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method 1% noise,  =10 -7, Iterations 10 and 15

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method 1% noise,  =10 -7, Iterations 20 and 25

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method 4% noise,  =10 -7, Iterations 10 and 20

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method 4% noise,  =10 -7, Iterations 30 and 40

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method Residual and L 1 -error

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method Example 2: where and denotes the indicator function of.

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method No noise Iterations 2,4,6,8

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method Residual and L 1 -error

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method Residual and L 1 -error

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method 0.1 % noise Iterations 5,10,20,25

Level Set Methods for Inverse Problems San Antonio, January Levenberg-Marquardt Method 1% noise 2% noise 3% noise 4% noise

Level Set Methods for Inverse Problems San Antonio, January Download and Contact Papers and Talks: