Martin Burger Institut für Numerische und Angewandte Mathematik CeNoS Level set methods for imaging and application to MRI segmentation.

Slides:



Advertisements
Similar presentations
An Active contour Model without Edges
Advertisements

Image Segmentation with Level Sets Group reading
Bayesian Belief Propagation
Istituto per le Applicazioni del Calcolo "M. Picone" Multigrid Computation for Variational Image Segmentation Problems: Euler equations and approximation.
Active Contours without Edges
Total Variation and Geometric Regularization for Inverse Problems
Johann Radon Institute for Computational and Applied Mathematics: 1/25 Signal- und Bildverarbeitung, Image Analysis and Processing.
Level Set Methods for Shape Recovery Fan Ding and Charles Dyer Computer Sciences Department University of Wisconsin.
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
Martin Burger Institut für Numerische und Angewandte Mathematik European Institute for Molecular Imaging CeNoS Total Variation and related Methods Segmentation.
Medical Image Segmentation: Beyond Level Sets (Ismail’s part) 1.
Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction.
Johann Radon Institute for Computational and Applied Mathematics: 1/28 Signal- und Bildverarbeitung, Image Analysis and Processing.
Segmentation (2): edge detection
Image Segmentation some examples Zhiqiang wang
Image Segmentation and Active Contour
Active Contours / Planes Sebastian Thrun, Gary Bradski, Daniel Russakoff Stanford CS223B Computer Vision Some slides.
Snakes with Some Math.
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
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.
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.
Computer Vision Optical Flow
Martin Burger Institut für Numerische und Angewandte Mathematik European Institute for Molecular Imaging CeNoS Convex and Nonconvex Relaxation Approaches.
Front propagation in inverse problems and imaging Martin Burger Institute for Computational and Applied Mathematics European Institute for Molecular Imaging.
Martin Burger Institut für Numerische und Angewandte Mathematik European Institute for Molecular Imaging CeNoS Computing Transmembrane Potentials from.
Martin Burger Institut für Numerische und Angewandte Mathematik European Institute for Molecular Imaging CeNoS Total Variation and related Methods: Error.
Numerical geometry of non-rigid shapes
Motion Analysis (contd.) Slides are from RPI Registration Class.
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.
Optical Flow Estimation using Variational Techniques Darya Frolova.
Active Contour Models (Snakes) Yujun Guo.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
1 Level Sets for Inverse Problems and Optimization I Martin Burger Johannes Kepler University Linz SFB Numerical-Symbolic-Geometric Scientific Computing.
Evolving Curves/Surfaces for Geometric Reconstruction and Image Segmentation Huaiping Yang (Joint work with Bert Juettler) Johannes Kepler University of.
1 Fast Marching Method for generic Shape From Shading E. Prados & S. Soatto RFIA 2006 January 2006, Tours, France.
2008/10/02H704 - DYU1 Active Contours and their Utilization at Image Segmentation Author : Marián Bakoš Source : 5th Slovakian-Hungarian Joint Symposium.
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.
Evolution-based least-squares fitting using Pythagorean hodograph spline curves Speaker: Ying.Liu November
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.
MEDICAL IMAGE ANALYSIS Marek Brejl Vital Images, Inc.
Mathematical Methods for the Segmentation of Medical Images Carsten Wolters Institut für Biomagnetismus und Biosignalanalyse, Westfälische Wilhelms-Universität.
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.
Stress constrained optimization using X-FEM and Level Set Description
Head Segmentation using a finite element approach J.Piovano, T. Papadopoulo Odyssée Laboratory (ENPC, ENS, INRIA), INRIA, Sophia-Antipolis, France I. Introduction.
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.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Robotics Chapter 6 – Machine Vision Dr. Amit Goradia.
Level Set Segmentation ~ 9.37 Ki-Chang Kwak.
Level set method and image segmentation
Dynamical Statistical Shape Priors for Level Set Based Tracking
Extract Object Boundaries in Noisy Images
Snakes, Shapes, and Gradient Vector Flow
Muazzam Shehzad Quratulain Muazzam
Presentation transcript:

Martin Burger Institut für Numerische und Angewandte Mathematik CeNoS Level set methods for imaging and application to MRI segmentation

Martin Burger MRI Segmentation Acknowledgements Based on results by Denis Neiter (Ecole Polytechnique) during internship 2007, partly using results by Simon Huffeteau (Ecole Polytechnique), internship 2006 Using Carsten Wolters‘ MR Data

Martin Burger MRI Segmentation Problem Setting Given MR Image(s), find (in an automated way): -the borders between different head compartments (segmentation) - an appropriate map of the normal directions, in particular of the brain surface (classification) - a representation useful for further finite element modelling

Martin Burger MRI Segmentation Mathematical Issues Segmentation needs - to discriminate noise and textures (small scale structures) - to incorporate prior knowledge - to be flexible with respect to complicated shapes (or even topology) First two issues treated via regularization, third via level set methods

Martin Burger MRI Segmentation Object-Based Segmentation Classical object based segmentation computes curves (2D) or surfaces (3D) marking the object boundary (contour) Traditional approach: start with curve and let it evolve towards the contour by some criteria Velocity of evolving curve determined by two counteracting parts: image-driven part and regularization

Martin Burger MRI Segmentation Active Contours - Snakes Image-driven force related to gradient of the image (local gray-value difference) Regularization force is (mean) curvature

Martin Burger MRI Segmentation Active Contours - Snakes Popular, but various shortcomings: - needs preprocessing of the image (noise removal, intensity map so that edges are in valleys) - local minima - issues with narrow structures: big trouble in brain images

Martin Burger MRI Segmentation Statistical Models K-Means / C-Means: Based on optimization, find a 0-1 function (0 in pixels outside, 1 inside) Optimization goal consists of same parts: image-driven and regularization No useful boundary representation

Martin Burger MRI Segmentation Curve / Surface Representation Level Set Methods yield boundary representation with appropriate curvatures and subpixel resolution

Martin Burger MRI Segmentation Level Set Methods Osher & Sethian, JCP 1987, Sethian, Cambridge Univ. Press 1999, Osher & Fedkiw, Springer, 2002 Basic idea: implicit shape representation with continuous level-set function

Martin Burger MRI Segmentation Level Set Methods Change of front translated to change of function

Martin Burger MRI Segmentation Level Set Methods Implicit representation of dynamic shapes with time-dependent level set function

Martin Burger MRI Segmentation Level Set Methods Evolution of the shape corresponds to evolution of the level set function (and vice versa) Movie by J.Sethian

Martin Burger MRI Segmentation Level Set Methods Topology change is automatic Movie by J.Sethian

Martin Burger MRI Segmentation Geometric Motion Start for simplicity with the evolution of a curve Evolution in a velocity field, each point evolves via ODE

Martin Burger MRI Segmentation Geometric Motion Use any parametric representation Due to definition of the level set function Consequently

Martin Burger MRI Segmentation Geometric Motion By the chain rule Insert ODE for moving points:

Martin Burger MRI Segmentation Geometric Motion For level set function being a solution of each level set of  is moving with velocity V

Martin Burger MRI Segmentation Geometric Motion In most cases, the full velocity field V is unknown, only normal velocity component v known Tangential component of the velocity field is not important anyway, it does not change the motion (only change of parametrization)

Martin Burger MRI Segmentation Geometric Motion Normal can be computed from level set function: By the chain rule

Martin Burger MRI Segmentation Geometric Motion Note that is a tangential direction Hence, is a normal direction, unit normal is given by

Martin Burger MRI Segmentation Geometric Motion Evolution becomes nonlinear Hamilton-Jacobi equation: „Level set equation“

Martin Burger MRI Segmentation Geometric Motion Evolution could be anisotropic, i.e. normal velocity depends on the orientation with one-homogeneous extension H, yields Hamilton- Jacobi equation

Martin Burger MRI Segmentation Geometric Motion Evolution could be of higher order, e.g. normal velocity depends on the mean curvature Level set equation becomes fully nonlinear second- order parabolic PDE

Martin Burger MRI Segmentation Examples Eikonal equation Positive velocity field yield monotone advancement of fronts Arrival time Solves

Martin Burger MRI Segmentation Example: Eikonal Equation

Martin Burger MRI Segmentation Examples Mean curvature flow Classical example of higher-order geometric motion Normal velocity equal to curvature of curve (or mean curvature of surface)

Martin Burger MRI Segmentation Mean Curvature Flow

Martin Burger MRI Segmentation Optimal Geometries Classical problem for optimal geometry: Plateau Problem (Minimal Surface Problem) Minimize area of surface between fixed boundary curves.

Martin Burger MRI Segmentation Optimal Geometries Minimal surface (L.T.Cheng, PhD 2002)

Martin Burger MRI Segmentation Optimal Geometries Wulff-Shapes: Pb[111] in Cu[111] Surnev et al, J.Vacuum Sci. Tech. A, 1998

Martin Burger MRI Segmentation Mumford-Shah Free discontinuity problems: find the set of discontinuity from a noisy observation of a function. Mumford-Shah functional

Martin Burger MRI Segmentation Mumford-Shah Image decomposition

Martin Burger MRI Segmentation Mumford-Shah Limitations

Martin Burger MRI Segmentation Improved Model Decomposition in 3 parts: smooth, oscillating, edges

Martin Burger MRI Segmentation Object-based Mumford-Shah Chan-Vese: Approximate smooth component by its mean value inside and outside object Curve / Surface can be evolved via simple criterion, in each time step mean-value inside and outside need to be computed Via convex relaxation techniques convergence to global minimum can be ensured

Martin Burger MRI Segmentation Level Set Formulation Level set function  and Heaviside function H (= 0 negative, = 1 positive)

Martin Burger MRI Segmentation Reduced Problem: fixed mean value

Martin Burger MRI Segmentation Image Segmentation Noisy Image

Martin Burger MRI Segmentation Image Segmentation Noise level 10%,  =10 3

Martin Burger MRI Segmentation Regularization For skull segmentation (smooth) regularization based on length minimization is perfect For brain structure (sulci) similar issues as for active contours

Martin Burger MRI Segmentation MR Results

Martin Burger MRI Segmentation MR Results

Martin Burger MRI Segmentation Skull Segmentation from MR-PD

Martin Burger MRI Segmentation Head Segmentation

Martin Burger MRI Segmentation Bias of one functional often too strong Better: use a family of functionals parametrized by Example: adaptive anisotropy Adaptive Bias / Parametrization J ( u;® ) ® 2 A

Martin Burger MRI Segmentation In aerial images the typical anisotropy is rectangular, houses have 90° angles But not all of them have the same orientation Adaptive Anisotropy

Martin Burger MRI Segmentation Bias for edges with 90° angles from functional of the form R  is rotation matrix for angle  to capture the orientation Since orientation is not constant over the image,  has to vary and to be found adaptively by minimization Adaptive Anisotropy J ( u;® ) = Z (j v 1 j + j v 2 j) d x ; v = R ® r u

Martin Burger MRI Segmentation To avoid microstructure, variation of  has to be regularized, too Possible regularization functional Adaptive Anisotropy

Martin Burger MRI Segmentation Improves angles, still loses contrast Adaptive Anisotropy

Martin Burger MRI Segmentation Contrast correction by iterative refinement Angle parameter provides classification of orientations in the image Adaptive Anisotropy

Martin Burger MRI Segmentation Cartoon reconstruction and orientational classification of aerial images Berkels, mb, Droske, Nemitz, Rumpf 06 Adaptive Anisotropy

Martin Burger MRI Segmentation Analogous problem in segmentation of MRI brain images for EEG/MEG Adapt anisotropy (locally like sharp ellipse) to find sulci accurately and provide classification of normals (for dipole fitting, source reconstruction) Adaptive Anisotropy

Martin Burger MRI Segmentation Fixed Anisotropy, 45° orientation

Martin Burger MRI Segmentation Adaptive Anisotropy

Martin Burger MRI Segmentation Adaptive Anisotropy

Martin Burger MRI Segmentation Adaptive Anisotropy, 3D