Laboratory of Mathematics in Imaging Harvard Medical School Brigham and Women’s Hospital Fast and Accurate Redistancing for Level Set Methods & Multiscale.

Slides:



Advertisements
Similar presentations
Image Segmentation with Level Sets Group reading
Advertisements

Scale & Affine Invariant Interest Point Detectors Mikolajczyk & Schmid presented by Dustin Lennon.
Image Repairing: Robust Image Synthesis by Adaptive ND Tensor Voting IEEE Computer Society Conference on Computer Vision and Pattern Recognition Jiaya.
Example-Based Fractured Appearance L. Glondu, L. Muguercia, M. Marchal, C. Bosch, H. Rushmeier, G. Dumont and G. Drettakis.
Level set based Image Segmentation Hang Xiao Jan12, 2013.
R. DOSIL, X. M. PARDO, A. MOSQUERA, D. CABELLO Grupo de Visión Artificial Departamento de Electrónica e Computación Universidade de Santiago de Compostela.
Active Contours, Level Sets, and Image Segmentation
Medical Image Segmentation: Beyond Level Sets (Ismail’s part) 1.
3D Segmentation Using Level Set Methods. Heriot-Watt University, Edinburgh, Scotland Zsolt Husz Mokhled Al-TarawnehÍzzet Canarslan University of Newcastle.
CDS 301 Fall, 2009 Image Visualization Chap. 9 November 5, 2009 Jie Zhang Copyright ©
Image Segmentation some examples Zhiqiang wang
Image Segmentation and Active Contour
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.
Overview Introduction Variational Interpolation
Deformable Contours Dr. E. Ribeiro.
Iterative closest point algorithms
1 1 Contour Enhancement and Completion via Left-Invariant Second Order Stochastic Evolution Equations on the 2D-Euclidean Motion Group Erik Franken, Remco.
Perceptual grouping: Curvature enhanced closure of elongated structures By Gijs Huisman Committee: prof. dr. ir. B.M. ter Haar Romeny prof. dr. ir. P.
Yujun Guo Kent State University August PRESENTATION A Binarization Approach for CT-MR Registration Using Normalized Mutual Information.
Quantification of collagen orientation in 3D engineered tissue
J OHNS H OPKINS U NIVERSITY S CHOOL O F M EDICINE Statistically-Based Reorientation of Diffusion Tensor Field XU, D ONGRONG S USUMU M ORI D INGGANG S HEN.
Comp 775: Deformable models: snakes and active contours Marc Niethammer, Stephen Pizer Department of Computer Science University of North Carolina, Chapel.
QSD – Quadratic Shape Descriptors Surface Matching and Molecular Docking Using Quadratic Shape Descriptors Goldman BB, Wipke WT. Quadratic Shape Descriptors.
An Overview of Cores Yoni Fridman The University of North Carolina at Chapel Hill Medical Image Display & Analysis Group Based on work by Fridman, Furst,
Distinctive Image Features from Scale-Invariant Keypoints David G. Lowe – IJCV 2004 Brien Flewelling CPSC 643 Presentation 1.
CSci 6971: Image Registration Lecture 16: View-Based Registration March 16, 2004 Prof. Chuck Stewart, RPI Dr. Luis Ibanez, Kitware Prof. Chuck Stewart,
Overview Introduction to local features
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
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.
Mean Shift Theory and Applications Reporter: Zhongping Ji.
CDS 301 Fall, 2009 Vector Visualization Chap. 6 October 7, 2009 Jie Zhang Copyright ©
Overview Harris interest points Comparing interest points (SSD, ZNCC, SIFT) Scale & affine invariant interest points Evaluation and comparison of different.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Chapter 8: Analysis of Oriented Patterns Tuomas Neuvonen Tommi Tykkälä.
Level Set Methods and Fast Marching Methods Wen Hongwei.
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
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.
The Calculus of Variations! A Primer by Chris Wojtan.
Danny Ruijters 17 April D-3D intra-interventional registration of coronary arteries.
M. Elena Martinez-Perez, Alun D. Hughes, Simon A. Thom, Anil A. Bharath, Kim H. Parker Medical Image Analysis 11 (2007) 47–61 黃銘哲 2010/11/9 1.
A Segmentation Algorithm Using Dyadic Wavelet Transform and the Discrete Dynamic Contour Bernard Chiu University of Waterloo.
Introduction to Level Set Methods: Part II
PRINCIPLES AND APPROACHES 3D Medical Imaging. Introduction (I) – Purpose and Sources of Medical Imaging Purpose  Given a set of multidimensional images,
Local invariant features Cordelia Schmid INRIA, Grenoble.
Introduction: Lattice Boltzmann Method for Non-fluid Applications Ye Zhao.
Blood Vessel Modeling using 2D/3D Level Set Method
CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.
CS 641 Term project Level-set based segmentation algorithms Presented by- Karthik Alavala (under the guidance of Dr. Jundong Liu)
Cores (defined at right) are used to automatically segment, or outline, objects in grayscale images (Fig. 1). A core provides geometric information about.
Diffusion Tensor Analysis in Slicer3
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.
CDS 301 Fall, 2008 Image Visualization Chap. 9 November 11, 2008 Jie Zhang Copyright ©
3D Face Recognition Using Range Images Literature Survey Joonsoo Lee 3/10/05.
Announcements Final is Thursday, March 18, 10:30-12:20 –MGH 287 Sample final out today.
Instructor: Mircea Nicolescu Lecture 10 CS 485 / 685 Computer Vision.
CIVET seminar Presentation day: Presenter : Park, GilSoon.
MATHEMATICS B.A./B.Sc. (GENERAL) FIRST YEAR EXAMINATIONS,2012.
IPMI 2013 Presentation, Asilomar, California
SURF detectors and descriptors
Lecture 5 Image Characterization ch. 4 of Machine Vision by Wesley E
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
Extract Object Boundaries in Noisy Images
Filtering Things to take away from this lecture An image as a function
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Filtering An image as a function Digital vs. continuous images
Presentation transcript:

Laboratory of Mathematics in Imaging Harvard Medical School Brigham and Women’s Hospital Fast and Accurate Redistancing for Level Set Methods & Multiscale Segmentation of the Aorta in 3D Ultrasound Images Karl Krissian

McGill Montreal 2003 I. Level Sets  Introduction Narrow Band –initialization –distancing Experiments –MRA –SPGR white matter –RGB white matter Discussion

McGill Montreal 2003 Level Sets: principle –Implicit representation of the evolving surface. –Natural topology changes.

McGill Montreal 2003 Level Sets: forces 1.Smoothing: – mean curvature [Sethian 96, Caselles 97] – minimal curvature [Ambrioso and Soner 98, Lorigo et al. 00] 2.Advection or Contour attachment. 3.Balloon or expansion: – constant. – based on intensity statistics [Zeng et al. 98,Paragios and Deriche 00, Barillot et al. 00].

McGill Montreal 2003 CURVES Lorigo et al., Medical Image Analysis, Ambrioso, Soner, Journal Differential Geometry, CURve evolution for VESsel segmentation Codimension-2 Active Contours Provided by L. Lorigo MIT AI Lab. v is (positive) distance to curve  (  v,  2 v) is smaller principal curvature of tube d is some vector field in R 3 v t = |  v| (  v,  2 v) +  v · d

McGill Montreal 2003 CURVES Example co-dim 2 co-dim 1 Provided by L. Lorigo MIT AI Lab.

McGill Montreal 2003 Fast implementation Numerical stability and reinitialization: distance map –Fast Marching Method [Sethian, 99], computes geodesic distances with complexity n.log(n). Speed improvement: itkNarrowBandCurvesLevelSetImageFilter  Sub-voxel reinitialization: itkIsoContourDistanceImageFilter  Fast Distance Transform: itkFastChamferDistanceImageFilter

McGill Montreal 2003 I. Level Sets Introduction  Narrow Band  initialization –distancing Experiments –MRA –SPGR white matter –RGB white matter Discussion

McGill Montreal 2003 SubVoxel Reinitialization For the voxels neighbors to the isosurface, keep the same linearly interpolated surface: Remarks: Points with several neighbors crossing the surface. Regions of high curvature.

McGill Montreal 2003 Subvoxel versus Binary binary (+/- 0.5) subvoxel Evolution of a sphere of radius 3 voxels under constant propagation force.

McGill Montreal 2003 binarysub-voxel Sub-Voxel vs Binary

McGill Montreal 2003 I. Level Sets Introduction  Narrow Band initialization  distancing Experiments –MRA –SPGR white matter –RGB white matter Discussion

McGill Montreal 2003 Chamfer Distance Transform = Relative maximal error 7.356% [Borgefors, On Digital Distance Transforms in Three Dimensions, CVIU, 1996]

McGill Montreal 2003 Narrow Banded Fast DT

McGill Montreal 2003 Narrow-Banded Fast DT Main speed improvements: 1.Linear complexity. 2.Don’t compute voxels out of the narrow band. 3.Factorize the additions for each kind of neighbor. 4.Keep track of a bounding box. 5.Get positive and negative distances at the same time.

McGill Montreal 2003 Interpretation BinarySubvoxel

McGill Montreal 2003 I. Level Sets Introduction Narrow Band initialization distancing  Experiments –MRA –SPGR white matter –RGB white matter Discussion

McGill Montreal 2003 Experiments Image 200 3, Euclidian distance up to 5, Pentium III 1.1 GHz. time in seconds radius in voxels Spheres of increasing radii

McGill Montreal 2003 Accuracy experiments Constant evolution Curvature evolution 2D disk radius=30 3D sphere radius=30

McGill Montreal 2003 White matter from SPGR image

McGill Montreal 2003 Fast implementation Computation time (in sec.) for segmenting White Matter on a 256x256x124 Spoiled Gradient Recall MR.

McGill Montreal 2003 Magnetic Resonance Angiography initial iso-surface Fast Marching resultFast Chamfer result Resampling Minimal curvature Speed up: Narrow Band Dist x 7 Total Processing x 2 Multi-Threading x 6

McGill Montreal 2003 Applications MR Angiography Segmentation result Maximum Intensity Projection

McGill Montreal 2003 Applications MR Angiography Segmentation result Iso-surfaces 112, 60 and 40

McGill Montreal 2003 High res. RGB White Matter Color Image: -cropped: 1056x seed points -2D level set data provided by Peter Ratiu

McGill Montreal 2003 High res 3D RGB White Matter 800x1056x1211 sub-volume –Pyramidal multiscale –2 seed points 200x264x302100x132x15150x76x75

McGill Montreal 2003 Interface Integration VTK-tclITK-tclVTK-tcl Generic slicer module (tcl/tk) ConnectVTKToITK ConnectITKToVTK vtkSlicerITK module Input image volume Output image volume

McGill Montreal 2003 Graphical Interface Open Source: Insight Toolkit:

McGill Montreal 2003 Conclusion Exact linear Euclidian Distance [Danielsson, 80] –Propagation, Parallel (multi-threaded) Multi-Channel images (RGB, blood flow, multi- modalities, diffusion tensor) Skeleton Shape constraints Bayesian approach with several level sets.

McGill Montreal 2003 Outline II. Multiscale Segmentation  Introduction  Methodology  Results  Conclusion and future work

McGill Montreal 2003 Introduction Medical Interest 3D Ultrasound for vascular and gastrointestinal surgery. low cost and no radiation exposure. with or without preoperative CT. need of automatic segmentation of the aorta.

McGill Montreal 2003 Introduction non homogeneous intensity close vessels

McGill Montreal 2003 Multiscale methods Linear multiscale analysis –Robustness –Accuracy –Optimization

McGill Montreal 2003 Hessian matrix eigenvalues eigenvectors Hessian matrix and local structure  Linear structures [Lorenz et al.]  VOLUMINAL MODELS Taylor expansion:

McGill Montreal 2003 Cylindrical model Analytic analysis –Radius estimation –Optimization of the response –Behavior of the Hessian matrix

McGill Montreal 2003 cylindrical Cylindrical model toroidal Toroidal model elliptical Elliptical model Hessian matrix

McGill Montreal 2003 Methodology –Hessian Matrix –Structure Tensor –New Second Order Orientation Descriptor –3 parameters Extraction of local orientations

McGill Montreal 2003 Methodology –Properties: zoom invariance. Symmetric positive. Continuity of the eigenvectors. Orientation extraction for both contours (1 st order derivatives) and lines (2 nd order derivatives). Extraction of local orientations

McGill Montreal 2003 Single scale response computation Pre-selection of candidates Plan of the cross-section Response

McGill Montreal 2003 Methodology Homogeneity constraint Eccentricity constraint Tubular constraints

McGill Montreal 2003 Normalization of the response function  = 1.0  = 1.28  =1.65  = 2.12  = 2.72  = 3.5  -normalization [Lindeberg, 96] Estimation of the vessel radius éZoom invariance éMaximization of the maximal response

McGill Montreal 2003 « height ridge » [Furst et al, 97] « marching lines » [Thirion et Gourdon, 97; Fidrich, 97; Lindeberg, 96, Furst et al, 96] is a local maximum Extraction of local maxima

McGill Montreal 2003 Tangent vessels Junctions Curvature Images of variable width Tests on synthetic images

McGill Montreal 2003 Methodology Scales –10 scales, logarithmic discretization Extraction of local maxima Multiscale analysis

McGill Montreal 2003 Methodology Results

McGill Montreal 2003 Outline Results

McGill Montreal 2003 Outline Conclusion and Future Work Conclusion Semi-automatic segmentation of aorta in 3D Ultrasound. Model Based multiscale linear approach. Second Order Orientation Descriptor. Homogeneity and eccentricity constraints. Future work Active contours. Validation.