Introduction to Level Set Methods: Part II

Slides:



Advertisements
Similar presentations
An Active contour Model without Edges
Advertisements

Finite Difference Discretization of Hyperbolic Equations: Linear Problems Lectures 8, 9 and 10.
Image Segmentation with Level Sets Group reading
Active Contours without Edges
An Efficient and Fast Active Contour Model for Salient Object Detection Authors: Farnaz Shariat, Riadh Ksantini, Boubakeur Boufama
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
Chapter 8 Elliptic Equation.
1 Lecture #7 Variational Approaches and Image Segmentation Lecture #7 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Introduction to Variational Methods and Applications
Medical Image Segmentation: Beyond Level Sets (Ismail’s part) 1.
Numerical Method for Computing Ground States of Spin-1 Bose-Einstein Condensates Fong Yin Lim Department of Mathematics and Center for Computational Science.
Luiza Bondar Jan ten Thije Boonkkamp Bob Matheij Combustion associated noise in central heating equipment Department of Mechanical Engineering, Combustion.
Image Segmentation some examples Zhiqiang wang
Image Segmentation and Active Contour
Active Contour Models (Snakes) 건국대학교 전산수학과 김 창 호.
1 Lecture #5 Variational Approaches and Image Segmentation Lecture #5 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Active Contour Models (Snakes)
Deformable Contours Dr. E. Ribeiro.
Local or Global Minima: Flexible Dual-Front Active Contours Hua Li Anthony Yezzi.
Level Set Formulation for Curve Evolution Ron Kimmel Computer Science Department Technion-Israel Institute of Technology Geometric.
Comp 775: Deformable models: snakes and active contours Marc Niethammer, Stephen Pizer Department of Computer Science University of North Carolina, Chapel.
Comp 775: Graph Cuts and Continuous Maximal Flows Marc Niethammer, Stephen Pizer Department of Computer Science University of North Carolina, Chapel Hill.
Finite Difference Methods to Solve the Wave Equation To develop the governing equation, Sum the Forces The Wave Equation Equations of Motion.
Error estimates for degenerate parabolic equation Yabin Fan CASA Seminar,
Numerical Schemes for Advection Reaction Equation Ramaz Botchorishvili Faculty of Exact and Natural Sciences Tbilisi State University GGSWBS,Tbilisi, July.
© 2011 Autodesk Freely licensed for use by educational institutions. Reuse and changes require a note indicating that content has been modified from the.
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 ,
Hyperbolic PDEs Numerical Methods for PDEs Spring 2007 Jim E. Jones.
MA/CS471 Lecture 8 Fall 2003 Prof. Tim Warburton
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.
7.1. Mean Shift Segmentation Idea of mean shift:
Level Set Methods and Fast Marching Methods Wen Hongwei.
1 EEE 431 Computational Methods in Electrodynamics Lecture 4 By Dr. Rasime Uyguroglu
Approaching the Challenge of Grid- Enabling Applications Kieran Nolan May 15 th, 2008.
Lecture 6 : Level Set Method
Graph Cuts Marc Niethammer. Segmentation by Graph-Cuts A way to compute solutions to the optimization problems we looked at before. Example: Binary Segmentation.
Discontinuous Galerkin Methods for Solving Euler Equations Andrey Andreyev Advisor: James Baeder Mid.
7. Introduction to the numerical integration of PDE. As an example, we consider the following PDE with one variable; Finite difference method is one of.
1 Lecture #6 Variational Approaches and Image Segmentation Lecture #6 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Overview of Propagating Interfaces Donald Tanguay October 30, 2002.
Introduction: Lattice Boltzmann Method for Non-fluid Applications Ye Zhao.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Optical Flow. Distribution of apparent velocities of movement of brightness pattern in an image.
CS 641 Term project Level-set based segmentation algorithms Presented by- Karthik Alavala (under the guidance of Dr. Jundong Liu)
Discretization for PDEs Chunfang Chen,Danny Thorne Adam Zornes, Deng Li CS 521 Feb., 9,2006.
Electrical Wave Propagation in a Minimally Realistic Fiber Architecture Model of the Left Ventricle Xianfeng Song, Department of Physics, Indiana University.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities May 2, 2005 Prof. Charlene Tsai.
The Backward Error Compensation Method for Level Set Equation Wayne Lawton and Jia Shuo Department of Mathematics National University.
The story so far… ATM 562 Fovell Fall, Convergence We will deploy finite difference (FD) approximations to our model partial differential equations.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 32.
Using Neumann Series to Solve Inverse Problems in Imaging Christopher Kumar Anand.
/14:00 1 Literature Study Jeroen Wille.
Level set method and image segmentation
ITK 9.3. Level Set Segmentation Shape Detection Segmentation
PDE Methods for Image Restoration
Lecture 4: Numerical Stability
Introduction to Numerical Methods I
Convection-Dominated Problems
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Lecture 19 MA471 Fall 2003.
Convergence in Computational Science
Extract Object Boundaries in Noisy Images
3D Image Segmentation and Multigrid Method
Snakes, Shapes, and Gradient Vector Flow
Paper Review Zhiqiang 9/21/12
Presentation transcript:

Introduction to Level Set Methods: Part II Chunming Li Institute of Imaging Science Vanderbilt University URL: www.vuiis.vanderbilt.edu/~licm E-mail: chunming.li@vanderbilt.edu

Outline Numerical issues: Difference scheme: upwind scheme 4/24/2017 Outline Numerical issues: Difference scheme: upwind scheme Velocity extension Reinitialization Variational level set method: Level set evolution without reinitialization. Active contour without edges Multiphase level set methods

Numerical Implementation of Level Set Evolution 4/24/2017 Numerical Implementation of Level Set Evolution

Explicit Euler Scheme Consider general evolution equation: 4/24/2017 Explicit Euler Scheme Consider general evolution equation: Approximate spatial derivatives by certain difference scheme Approximate temporal derivatives by forward difference Update equation at each iteration:

Basic Finite Difference Scheme for Spatial Variable 4/24/2017 Basic Finite Difference Scheme for Spatial Variable Backward difference Forward difference Central difference

Mean Curvature Motion Mean curvature motion Update equation: where 4/24/2017 Mean Curvature Motion Mean curvature motion Update equation: where Mean curvature motion is stable.

Motion in Normal Direction 4/24/2017 Motion in Normal Direction Motion in normal direction: Right hand side is approximated by: where Update equation:

Advection Pure advection equation: , with 4/24/2017 Advection Pure advection equation: , with Right hand side is approximated by: where Update equation:

Geodesic Active Contour 4/24/2017 Geodesic Active Contour Geodesic active contour: Update equation:

General Evolution Equation 4/24/2017 General Evolution Equation Level set evolution:

Time Step Level set evolution: 4/24/2017 Time Step Level set evolution: For stable evolution, the time step and spatial step must satisfy the CFL condition:

Unstable Evolution in Standard Level Set Methods 4/24/2017 Unstable Evolution in Standard Level Set Methods Evolution of level set function Evolution of zero level set Click here to see the movie Click here to see the movie

Reinitialization (Redistance) Reinitialization: periodically stop the evolution and repair the degraded level set function as a signed distance function. Solve to steady state: Reinitialization equation “Steady state” means exists, denoted by . Signed distance function. Use upwind scheme to numerically solve the above reinitialization equation. Other reinitialization methods: direct compute SDF or fast marching.

Velocity Extension In some applications, the speed function is only defined on the zero level set (interface) To extend to the speed function to the entire domain or a narrow band of the zero level set, solve the boundary value problem: or solve to steady state of the initial value problem: with Note: is the directional derivative of along the normal to the interface

Summary of Standard Level Set Methods 4/24/2017 Summary of Standard Level Set Methods Initialization Compute signed distance Complex upwind scheme and small time step Evolve level set function Solve a PDE Velocity extension Solve another PDE! Reinitialization N converge? Y stop

Variational Level Set Formulation 4/24/2017 Variational Level Set Formulation

Drawbacks of Reinitialization 4/24/2017 Drawbacks of Reinitialization Drawbacks of Reinitialization: Still a serious problem: when and how to reinitialize? (no general answer so far) Error in location of the zero level set Computationally expensive

Level Set Evolution without Reinitialization (Li et al, 2005) Goal: Find a level set evolution algorithm that can simultaneously move the zero level set while maintaining the signed distance profile throughout the entire evolution. Characteristics of signed distance function: signed distance function + constant Deviation from a signed distance function:

Variational Level Set Formulation Define an energy functional on level set function: Internal energy: Penalize the deviation from a signed distance function External energy: Drive the motion of the zero level set Gradient flow (or steepest descent): Gateaux derivative:

External Energy for Image Segmentation 4/24/2017 External Energy for Image Segmentation Edge indicator function for image I Define external Energy: Weighted length term: Weighted region term:

Energy Functional and Gradient Flow 4/24/2017 Energy Functional and Gradient Flow Define energy functional: The gradient flow of the functional is:

Mechanism of Maintaining Signed Distance 4/24/2017 Mechanism of Maintaining Signed Distance Rewrite the gradient flow of internal energy: Diffusion rate: Positive diffusion rate Decrease gradient (usual diffusion) Negative diffusion rate Increase gradient (reverse diffusion)

Implementation Use the smoothed Dirac function Discretization of PDE: 4/24/2017 Implementation Use the smoothed Dirac function Discretization of PDE: Forward difference for temporal derivative Can use relatively larger time step Central difference for spatial derivative

Experimental Results Evolution of level set function Evolution of zero level set Click here to see the movie Click here to see the movie

Flexible and Efficient Initialization 4/24/2017 Flexible and Efficient Initialization The initial level set function is no longer required to be a signed distance function in our method A region-based initialization scheme:

Experimental Results Click here to see the movie

Initial level set function Evolution Click here to see the movie

Detect Weak Object Boundaries Microscope image of cells Click here to see the movie

Experimental Results: Initialization from Thresholding 4/24/2017 Experimental Results: Initialization from Thresholding MR image of corpus callosum Initial level set function Image courtesy of Hong Liu, National Institute of Mental Health Evolution Click here to see the movie

Initial level set function Evolution Click here to see the movie

3D Extension The proposed level set formulation Click here to see the movie The proposed level set formulation and implementation can be easily extended to 3D.

Thank you