Medical Image Segmentation: Beyond Level Sets (Ismail’s part) 1.

Slides:



Advertisements
Similar presentations
An Active contour Model without Edges
Advertisements

Image Segmentation with Level Sets Group reading
Active Contours without Edges
Total Variation and Geometric Regularization for Inverse Problems
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.
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
Lena Gorelick Joint work with Frank Schmidt and Yuri Boykov Rochester Institute of Technology, Center of Imaging Science January 2013 TexPoint fonts used.
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
3D Segmentation Using Level Set Methods. Heriot-Watt University, Edinburgh, Scotland Zsolt Husz Mokhled Al-TarawnehÍzzet Canarslan University of Newcastle.
Snakes, Strings, Balloons and Other Active Contour Models.
CS 4487/9587 Algorithms for Image Analysis
C. Olsson Higher-order and/or non-submodular optimization: Yuri Boykov jointly with Western University Canada O. Veksler Andrew Delong L. Gorelick C. NieuwenhuisE.
Chapter 4: Linear Models for Classification
Image Segmentation some examples Zhiqiang wang
Image Segmentation and Active Contour
Active Contour Models (Snakes) 건국대학교 전산수학과 김 창 호.
Snakes with Some Math.
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.
On Constrained Optimization Approach To Object Segmentation Chia Han, Xun Wang, Feng Gao, Zhigang Peng, Xiaokun Li, Lei He, William Wee Artificial Intelligence.
Contour evolution scheme for variational image segmentation and smoothing S. Mahmoodi and B.S. Sharif.
1 Lecture #5 Variational Approaches and Image Segmentation Lecture #5 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Active Contour Models (Snakes)
Deformable Contours Dr. E. Ribeiro.
1 Hierarchical Image-Motion Segmentation using Swendsen-Wang Cuts Adrian Barbu Siemens Corporate Research Princeton, NJ Acknowledgements: S.C. Zhu, Y.N.
1cs533d-term Notes  Required reading: Baraff & Witkin, “Large steps in cloth animation”, SIGGRAPH’98 Grinspun et al., “Discrete shells”, SCA’03.
Front propagation in inverse problems and imaging Martin Burger Institute for Computational and Applied Mathematics European Institute for Molecular Imaging.
Level Set Formulation for Curve Evolution Ron Kimmel Computer Science Department Technion-Israel Institute of Technology Geometric.
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.
Preconditioned Level Set Flows Martin Burger Institute for Computational and Applied Mathematics European Institute for Molecular Imaging (EIMI) Center.
Network and Grid Computing –Modeling, Algorithms, and Software Mo Mu Joint work with Xiao Hong Zhu, Falcon Siu.
1cs533d-winter-2005 Notes  More reading on web site Baraff & Witkin’s classic cloth paper Grinspun et al. on bending Optional: Teran et al. on FVM in.
Interpolation Snakes Work by Silviu Minut. Ultrasound image has noisy and broken boundaries Left ventricle of dog heart Geodesic contour moves to smoothly.
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.
Active Contour Models (Snakes) Yujun Guo.
Martin Burger Total Variation 1 Cetraro, September 2008 Numerical Schemes Wrap up approximate formulations of subgradient relation.
MUSCLE-WP5&7 meeting Priors, Syntax and Semantics in Variational Level-Set Approachs TAU-VISUAL: Nir Sochen & Nahum Kiryati Based on works with.
1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing.
A Numerical Technique for Building a Solution to a DE or system of DE’s.
Tutorial 5: Numerical methods - buildings Q1. Identify three principal differences between a response function method and a numerical method when both.
Hyperbolic PDEs Numerical Methods for PDEs Spring 2007 Jim E. Jones.
Inverse problems in earth observation and cartography Shape modelling via higher-order active contours and phase fields Ian Jermyn Josiane Zerubia Marie.
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:
Lecture 6 : Level Set Method
5. SUMMARY & CONCLUSIONS We have presented a coarse to fine minimization framework using a coupled dual ellipse model to form a subspace constraint that.
1 Lecture #6 Variational Approaches and Image Segmentation Lecture #6 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Introduction to Level Set Methods: Part II
Auxiliary Cuts for General Classes of Higher-Order Functionals 1 Ismail Ben Ayed, Lena Gorelick and Yuri Boykov.
Stochastic Systems Group Curve Sampling and Conditional Simulation Ayres Fan John W. Fisher III Alan S. Willsky MIT Stochastic Systems Group.
CS 641 Term project Level-set based segmentation algorithms Presented by- Karthik Alavala (under the guidance of Dr. Jundong Liu)
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 Level Set Segmentation with Shape Priors Jue Wang and Jiun-Hung Chen CSE/EE 577 Spring 2004.
Variational methods in image processing Level Sets and Geodesic Active Contours Variational methods in image processing Level Sets and Geodesic Active.
Level Set Segmentation ~ 9.37 Ki-Chang Kwak.
Deformable Models Ye Duan. Outline Overview Deformable Surface – Geometry Representation – Evolution Law – Topology State-of-art deformable models Applications.
Level set method and image segmentation
ベーテ自由エネルギーに対するCCCPアルゴリズムの拡張
PDE Methods for Image Restoration
Dynamical Statistical Shape Priors for Level Set Based Tracking
Interpolation Snakes Work by Silviu Minut.
Snakes, Shapes, and Gradient Vector Flow
Active Contours (“Snakes”)
Muazzam Shehzad Quratulain Muazzam
Presentation transcript:

Medical Image Segmentation: Beyond Level Sets (Ismail’s part) 1

Basics of Level Sets (Ismail) 14

Active Curves 1

1 S S

Gradient Descent (1) 2 Functional derivative Regional terms of the form

Gradient Descent (2) 3  E S E S -  S = tt  E S E S

Gradient Descent (2) 3  E S E S -  E S E S -  S = tt  E S E S

Gradient Descent (2) 3  E S E S -  E S E S -  S = tt  E S E S

Standard boundary terms: Geodesic Active Contours 4 e.g., Caselles et al., 97

5 Standard boundary terms: General derivative with E-L equations

5 1 Boundary length Standard boundary terms: General derivative with E-L equations

5 Standard boundary terms: General derivative with E-L equations Depends on image gradient Attracts curve to strong edges

5 Standard boundary terms: General derivative with E-L equations Depends on image gradient Attracts curve to strong edges

6 Standard region terms: Piecewise constant case e.g., Chan and et Vese, 01

6 Standard region terms: Piecewise constant case e.g., Chan and et Vese, 01 Alternate minimization (1) Fix parameters and evolve the curve (2) Fix curve, optimize w.r.t parameters

7 Standard region terms: Log-Likelihood

7 Standard region terms: Log-Likelihood Distributions fixed by prior learning e.g., Paragios and Dercihe, 02

7 Standard region terms: Log-Likelihood Distributions updated iteratively e.g., Gaussian: Rousson and Deriche 02 Gamma: Ben Ayed et al., 05

Functional derivatives for region terms (E-L equations and Green’s theorem) 8 See Zhu and Yuille, 96 Mitiche and Ben Ayed, 11

8 Curve flow in the log-likelihood case S Functional derivatives for region terms (E-L equations and Green’s theorem) See Zhu and Yuille, 96 Mitiche and Ben Ayed, 11

8 >0 Curve flow in the log-likelihood case S Functional derivatives for region terms (E-L equations and Green’s theorem)

8 <0 Curve flow in the log-likelihood case S Functional derivatives for region terms (E-L equations and Green’s theorem)

Level set representation of the curve 9

9 We can replace everything

Level set representation of the curve 9 Easy to show from the facts that on the curve: See Mitiche and Ben Ayed, 11

Alternatively, we can embed the level set function in the energy directly 10 Region terms: e.g., Chan and Vese, 01 Li et al., 2005

Alternatively, we can embed the level set function in the energy directly 10 Length term: e.g., Chan and Vese, 01 Li et al., 2005

Alternatively, we can embed the level set function in the energy directly 10 e.g., Chan and Vese, 01 Li et al., 2005 Region terms: Length term: Compute E-L equations directly w.r.t the level set function

Pros of level sets (1) 11 Applicable to any differentiable functional:

Pros of level sets (1) 11 Applicable to any differentiable functional:

Pros of level sets (2) 12 Direct extension to higher dimensions

Small moves + Fixed and small time step + Can be slow in practice: Cons of level sets (1) 13  S = tt  E S E S Courant-Friedrichs-Lewy (CFL) conditions for evolution stability  t < cst See, for example, Estellers et al., IEEE TIP 12

Sometimes very weak local optima Cons of level sets (2) 14 = 0  E S E S

Dependence on the choice of an approximate numerical scheme (for stable evolution) Cons of level sets (3) 15  e.g., Complex upwind schemes for PDE discretization See, for example, Sethian 99 See, for example, S. Osher and R. Fedkiw 2002  Keep a distance function by ad hoc re-initialization procedures