Front propagation in inverse problems and imaging Martin Burger Institute for Computational and Applied Mathematics European Institute for Molecular Imaging.

Slides:



Advertisements
Similar presentations
Image Segmentation with Level Sets Group reading
Advertisements

An Efficient and Fast Active Contour Model for Salient Object Detection Authors: Farnaz Shariat, Riadh Ksantini, Boubakeur Boufama
Various Regularization Methods in Computer Vision Min-Gyu Park Computer Vision Lab. School of Information and Communications GIST.
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
MRI Brain Extraction using a Graph Cut based Active Contour Model Noha Youssry El-Zehiry Noha Youssry El-Zehiry and Adel S. Elmaghraby Computer Engineering.
Level set based Image Segmentation Hang Xiao Jan12, 2013.
Active Contours, Level Sets, and Image Segmentation
Martin Burger Institut für Numerische und Angewandte Mathematik European Institute for Molecular Imaging CeNoS Total Variation and related Methods Segmentation.
Introduction to Variational Methods and Applications
Medical Image Segmentation: Beyond Level Sets (Ismail’s part) 1.
Princeton University Using the computer to select the right variables Rationale: Lake Carnegie, Princeton, NJ Straight Line Distance Actual transition.
July 11, 2006 Comparison of Exact and Approximate Adjoint for Aerodynamic Shape Optimization ICCFD 4 July 10-14, 2006, Ghent Giampietro Carpentieri and.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2011 –47658 Determining ODE from Noisy Data 31 th CIE, Washington.
Image Segmentation some examples Zhiqiang wang
Image Segmentation and Active Contour
Corp. Research Princeton, NJ Computing geodesics and minimal surfaces via graph cuts Yuri Boykov, Siemens Research, Princeton, NJ joint work with Vladimir.
Contours and Optical Flow: Cues for Capturing Human Motion in Videos Thomas Brox Computer Vision and Pattern Recognition Group University of Bonn Research.
Martin Burger Institut für Numerische und Angewandte Mathematik CeNoS Level set methods for imaging and application to MRI segmentation.
Martin Burger Institut für Numerische und Angewandte Mathematik European Institute for Molecular Imaging CeNoS Computing Transmembrane Potentials from.
1 Curvature Driven Flows Allen Tannenbaum. 2 Basic curve evolution: Invariant Flows  Planar curve:  General flow:  General geometric flow:
Martin Burger Institut für Numerische und Angewandte Mathematik European Institute for Molecular Imaging CeNoS Total Variation and related Methods: Error.
Motion Analysis (contd.) Slides are from RPI Registration Class.
Methods For Nonlinear Least-Square Problems
Universidad de La Habana Lectures 5 & 6 : Difference Equations Kurt Helmes 22 nd September - 2nd October, 2008.
Lecture IV – Invariant Correspondence
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.
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.
Summer Project Presentation Presented by:Mehmet Eser Advisors : Dr. Bahram Parvin Associate Prof. George Bebis.
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.
Spectral Processing of Point-sampled Geometry
Martin Burger Total Variation 1 Cetraro, September 2008 Numerical Schemes Wrap up approximate formulations of subgradient relation.
EE565 Advanced Image Processing Copyright Xin Li Different Frameworks for Image Processing Statistical/Stochastic Models: Wiener’s MMSE estimation.
1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing.
1 Chapter 6 Numerical Methods for Ordinary Differential Equations.
Numerical methods for PDEs PDEs are mathematical models for –Physical Phenomena Heat transfer Wave motion.
Optical flow (motion vector) computation Course: Computer Graphics and Image Processing Semester:Fall 2002 Presenter:Nilesh Ghubade
Evolving Curves/Surfaces for Geometric Reconstruction and Image Segmentation Huaiping Yang (Joint work with Bert Juettler) Johannes Kepler University of.
Section 2: Finite Element Analysis Theory
Deformable Models Segmentation methods until now (no knowledge of shape: Thresholding Edge based Region based Deformable models Knowledge of the shape.
Mesh Deformation Based on Discrete Differential Geometry Reporter: Zhongping Ji
Evolution-based least-squares fitting using Pythagorean hodograph spline curves Speaker: Ying.Liu November
1 Numerical Shape Optimisation in Blow Moulding Hans Groot.
Lecture 6 : Level Set Method
Curve-Fitting Regression
5. SUMMARY & CONCLUSIONS We have presented a coarse to fine minimization framework using a coupled dual ellipse model to form a subspace constraint that.
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.
Mathematical Methods for the Segmentation of Medical Images Carsten Wolters Institut für Biomagnetismus und Biosignalanalyse, Westfälische Wilhelms-Universität.
Serge Andrianov Theory of Symplectic Formalism for Spin-Orbit Tracking Institute for Nuclear Physics Forschungszentrum Juelich Saint-Petersburg State University,
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION ASEN 5070 LECTURE 11 9/16,18/09.
Introduction to Level Set Methods: Part II
Overview of Propagating Interfaces Donald Tanguay October 30, 2002.
1 Markov random field: A brief introduction (2) Tzu-Cheng Jen Institute of Electronics, NCTU
David Levin Tel-Aviv University Afrigraph 2009 Shape Preserving Deformation David Levin Tel-Aviv University Afrigraph 2009 Based on joint works with Yaron.
Numerical Analysis. Numerical Analysis or Scientific Computing Concerned with design and analysis of algorithms for solving mathematical problems that.
A Non-iterative Hyperbolic, First-order Conservation Law Approach to Divergence-free Solutions to Maxwell’s Equations Richard J. Thompson 1 and Trevor.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
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.
Energy-minimizing Curve Design Gang Xu Zhejiang University Ouyang Building, 20-December-2006.
Numerical Analysis – Data Fitting Hanyang University Jong-Il Park.
Amir Yavariabdi Introduction to the Calculus of Variations and Optical Flow.
Level set method and image segmentation
Morphing and Shape Processing
Sahar Sargheini, Alberto Paganini, Ralf Hiptmair, Christian Hafner
Dynamical Statistical Shape Priors for Level Set Based Tracking
Snakes, Shapes, and Gradient Vector Flow
Presentation transcript:

Front propagation in inverse problems and imaging Martin Burger Institute for Computational and Applied Mathematics European Institute for Molecular Imaging (EIMI) Center for Nonlinear Science (CeNoS) Westfälische Wilhelms-Universität Münster

Front Propagation ICIAM 07, Zürich, July 07 We often look for geometric objects (with unknown topology) rather than for functions, e.g. in - image segmentation - computer graphics / surface restoration - topology / shape optimization - inverse obstacle scattering - inclusion / cavity / crack detection - detection of hear infarctions - ….. Introduction

Front Propagation ICIAM 07, Zürich, July 07 Because of the desired flexibility you need, you have to use level set methods (or something similar) Osher & Sethian, JCP 1987, Sethian, Cambridge Univ. Press 1999, Osher & Fedkiw, Springer, 2002 Introduction

Front Propagation ICIAM 07, Zürich, July 07 Because of the desired flexibility you need, you have to use level set methods (or something similar) Normal and mean curvature Level Set Methods

Front Propagation ICIAM 07, Zürich, July 07 Shape Optimization Approach In a natural way such problems can be formulated as shape optimization problems where K is a class of admissible shapes (eventually including additional constraints). Mumford-Shah / Chan-Vese functionals in segmentation Least-squares / reciprocity gap in crack / inclusion dectection

Front Propagation ICIAM 07, Zürich, July 07 Level Set Flows Solution by level set flows: find velocities such that resulting evolution of shapes decreases objective functional J Santosa 96, Osher-Santosa 01, Dorn 01/02 Geometric flow of the level sets of  can be translated into nonlinear differential equation for  („level set equation“)

Front Propagation ICIAM 07, Zürich, July 07 Shape Calculus Formulas for the change of the objective functional are obtained by shape calculus Shape sensitivity is a linear functional of the normal velocity on the boundary d d t J ( ­ ( t )) = J 0 ( ­ ( t )) V n V n 7! J 0 ( ­ ) V n

Front Propagation ICIAM 07, Zürich, July 07 Descent Directions Descent directions are obtained by chosing the normal velocity as a representation of the negative shape sensitivity in a Hilbert space Asymptotic expansion for small-time motion with that normal velocity mb 03/04

Front Propagation ICIAM 07, Zürich, July 07 Optimization Viewpoint Descent method, time step  can be chosen by standard optimization rules (Armijo-Goldstein) Descent method independent of parametrization, can change topology by splitting Level set method used to perform update Change of scalar product is effective preconditioning !

Front Propagation ICIAM 07, Zürich, July 07 Differential Geometry Viewpoint Interpretation from global differential geometry: - take manifold of shapes with appropriate metric to obtain Riemannian manifold - tangent spaces of such a manifold can be identified with normal velocities - Riemannian structure induces scalar product on tangent spaces We usually take the other way: „scalar product on tangent spaces induces Riemannian structure“ Michor-Mumford 05

Front Propagation ICIAM 07, Zürich, July 07 De Giorgi Viewpoint Generalized gradient flow structure in a metric space (concept of minimizing movements) DeGiorgi 1974, Ambrosio-Gigli-Savare 2005 Flow obtained as the limit of variational problems (implicit Euler) We can alternatively chose a metric and expand it to second order ! 1 2 ¿ d ( ­ ( V n ; ¿ ) ; ­ ) 2 + J ( ­ ( V n ; ¿ )) ! m i n V n

Front Propagation ICIAM 07, Zürich, July 07 Shape Metrics Class of shape metrics obtained by using Hilbert space norms on signed distance functions Expansion yields Sobolev spaces on normal velocities Natural in level set form d ( ­ 1 ; ­ 2 ) = k ­ 1 ­ 2 k ¡

Front Propagation ICIAM 07, Zürich, July 07 Shape Metrics Simple Example Shape sensitivity Flow in L 2 metric J ( ­ ) = -c Z ­ d x + ­ d ¾ J 0 ( ­ ) V n = ­ ( ·-c ) V n d ¾ ­ V n W n d ¾ = ­ ( c-· ) W n d ¾

Front Propagation ICIAM 07, Zürich, July 07 Shape Metrics Resulting Velocity V n = c-·

Front Propagation ICIAM 07, Zürich, July 07 Shape Metrics Possible alternative: H 1 metric Resulting Velocity Zero-order flow instead of 2nd order parabolic – very weak step size condition ! Sundaramoorthi, Yezzi, Mennucci 06 h V n ; W n i = ­ r ¾ V n ¢ r ¾ W n d ¾ ¢ ¾ V n = ·-c

Front Propagation ICIAM 07, Zürich, July 07 Image Segmentation Active contour model with L 2 and H 1 metric Sundaramoorthi

Front Propagation ICIAM 07, Zürich, July 07 Shape Metrics Other alternatives: H 1/2 and H -1/2 metric Sounds complicated, but can be realized as Dirichlet or Neumann traces of Sobolev functions on domain ! Can take harmonic extensions and their H 1 scalar product in a surrounding domain Automatic extension, ideal for level set flows

Front Propagation ICIAM 07, Zürich, July 07 Shape Metrics H 1/2 used with success in topology optimization Allaire, Jouve et al

Front Propagation ICIAM 07, Zürich, July 07 Example: Obstacle Problem H -1/2 good choice for source reconstructions, obstacle problems Model Example

Front Propagation ICIAM 07, Zürich, July 07 Shape Sensitivities First shape variation given by Second shape variation is coercive at stationary points H -1/2 is the right scalar product !

Front Propagation ICIAM 07, Zürich, July 07 Velocity choice Simple calculation shows that velocity for L 2 metric is given by By equivalent realization of the H -1/2 metric we obtain alternative choice Immediate extension velocity field V n = ¡ u § V n = u n V = ¡ r u §

Front Propagation ICIAM 07, Zürich, July 07 Trajectories Due to existence of a velocity field we can analyze the shape evolution via trajectories Note: from elliptic regularity theory, velocity field is Hölder continuous (existence), but not Lipschitz (no Picard-Lindelöf !!) V = ¡ r u §

Front Propagation ICIAM 07, Zürich, July 07 Trajectories But the velocity field is almost Lipschitz This is enough for uniqueness (Osgood‘s theorem) No stability estimate for ODE ! Thus, topology could change !

Front Propagation ICIAM 07, Zürich, July 07 Complete Analysis Main result: level set flow is well-defined, independent of level set representation, and converges to a minimizer of the functional Well-definedness by approximation argument and trajectory analysis Independence by existence of uniqueness of trajectories Convergence by energy estimates mb-Matevosyan 07 (?)

Front Propagation ICIAM 07, Zürich, July 07 Shape Metrics Shape deformations nicely controlled by Hausdorff-Metric Not differentiable due to max and sup, hence no reasonable expansion Smooth approximations possible Faugeras et al 06 d ( ­ 1 ; ­ 2 ) = max f sup x ­ 1 d i s t ( x ­ 2 ) ; sup x ­ 2 d i s t ( x ­ 1 )g

Front Propagation ICIAM 07, Zürich, July 07 Shape Metrics For fast methods, use variable metrics – based on second derivatives ! Inexact Newton methods: positive definite approximation of second derivative Hintermüller-Ring 04 For least-squares problems natural choice: Gauss-Newton (Levenberg-Marquardt,..) mb 04, Ascher et al 07 h V n ; W N i H ( ­ ) ¼ J 00 ( ­ )( V n ; W n )

Front Propagation ICIAM 07, Zürich, July 07 Levenberg-Marquardt Method Example: cavity detection

Front Propagation ICIAM 07, Zürich, July 07 Levenberg-Marquardt Method No noise Iterations 2,4,6,8

Front Propagation ICIAM 07, Zürich, July 07 Levenberg-Marquardt Method Residual and L 1 -error

Front Propagation ICIAM 07, Zürich, July 07 Levenberg-Marquardt Method Residual and L 1 -error, noisy data

Front Propagation ICIAM 07, Zürich, July 07 Levenberg-Marquardt Method 0.1 % noise Iterations 5,10,20,25

Front Propagation ICIAM 07, Zürich, July 07 Levenberg-Marquardt Method 1% noise 2% noise 3% noise 4% noise

Front Propagation ICIAM 07, Zürich, July 07 Papers and talks at or by Based on joint work with: Norayr Matevosyan, Stan Osher Thanks for input and suggestions to: B.Hackl, W.Ring, M.Hintermüller, U.Ascher Austrian Science Foundation FWF, SFB F 013 Download and Contact