1. András Horváth Segmentation of 3D ultrasound images of the heart Diagnostic ultrasound imaging

2. Image segmentation Determine sets of pixels according tocertain visual characteristics Simplify the representation of an image Separate ‘important’ parts http://www.cs.toronto.edu/~jepson/csc2503/segmentation.pdf http://www.eecs.berkeley.edu/Research/Projects/CS/vision/bsds/

3. 3D cardiac ultrasound Image analysis in cardiac images: Segmentation Motion Analysis. Strain Analysis. Extra spatial information vs Computational complexity (curse of dimensionality) Artifacts: 1. Contrast inhomogeneity and data drop-out. 2. Spurious signal from side lobes. ‘Extra’ goals: Machine/operator independence Handle dropout and inhomogeneity Handle boundary shape Non-local methods Automatic segmentation www.haskins.yale.edu/conferences/UltrafestV/abstracts/tagare_poster.pdf

4. 1980-: Edge Detectors, connected boundaries, local algorithms 1990-: “Snake” + Template matching algorithms Mildly-disconnected boundaries, local algorithms. 1990-00:Probabilistic algorithms (Bayesian) region-based, non-local algorithms. Discriminative machine-learning algorithms. Spatial inhomogeneity, curse of dimensionality, “drag-and-drop” segmentation. Some history G. Stetten, � eal-Time 3D Ultrasound Methods for Shape Analysis and Visualization, � Methods: Special Issue on Real-Time Signal Processing in the Neurosciences (in press, 11/2001). http://www.escardio.org/communities/EAE/3d-echo-box/3d-echo-atlas

5. Edge-based methods Step edge vs focal blur, shading artifacts! Gaussian smoothed edge Simplest, but difficult method even with high resolution(MR,CT) 2D vs 3D edges Fisrt order methods: Gradient operators Higher order methods: Differential edge detection Computationaly expensive (Preprocessing, noise filtering) http://cgv.icu.ac.kr/segmentation Parameter dependent different intensites http://www-sop.inria.fr/epidaure/personnel/malandain/segment/edges.html

6. Snakes, template matching, active-contour techniques G. Hamarneh, J. Hradsky, "DTMRI Segmentation using DT-Snakes and DT- Livewire", The 6th IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), 2006. Keyword(s): Segmentation, Deformable Models, Diffusion Tensor MRI. Online 3-D Reconstruction of the Right Atrium From Echocardiography Data via a Topographic Cellular Contour Extraction Algorithm Daniel Hillier, Zsolt Czeilinger, Andras Vobornik, and Csaba Rekeczky IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, VOL. 57, NO. 2, FEBRUARY 2010 www.haskins.yale.edu/conferences/UltrafestV/abstracts/tagare_poster.pdf

7. Bayesian Approach Advantages: more region-based than edge-based The segmentation is optimal (minimum variance) if the generative model is correct No ad-hoc techniques Canonical introduction of prior shape information (can be weak) Disadvantages: Can get trapped in spurious local maxima Spatially in-homogenous generative models are cumbersome Many extra parameters Optimization is difficult First-order Ultrasound Statistics Determining region from: Mean Std deviation www.haskins.yale.edu/conferences/UltrafestV/abstr acts/tagare_poster.pdf

8. Tracking 4D echocardiorgaphy Pairwise active appearance model and its application to echocardiography tracking S. Kevin Zhou, J. Shao, B. Georgescu, and D. Comaniciu

9. Shape-based Motion Analysis http://www.ncbi.nlm.nih.gov/pubmed/19565138 http://www.maths.leeds.ac.uk/applied/research.dir/Bio/biological.html Works well for left ventricle (simple geometry) Works even with simple mathemathical description More modelbased than observation based Not applicable for other shapes

10. Cooperative methods Self organising maps http://www.viscovery.net/self-organizing-maps Self organizing maps

11. Segmentation results dependend on: - Previous expectations (Blood flow, strain, valves) -Processing time - Cost (architecture) Which one is the best solution? Hybrid methods

12. Biblograpy Apart from the previously mentioned links E Angelini, S Homma, "Segmentation of real-time threedimensional ultrasound for quantication of ventricular function: a clinical study on right and left ventricles," Ultrasound in Medicine and Biology, pp. 1143-1158, 2005. 4.1.5 Danping Peng, Barry Merriman and M. Kang, pde based fast local level set methods. Department of Mathematics, University of California at Los Angeles, Los Angeles, California 90095-1555, 1999. 4.1.3 Ch. Brechbuhler and O. Kubler, "Parametrization of closed surfaces for 3-dshape description," Communication Technology Laboratory Image Science SwissFederal Institute of Technology (ETH), p. 1996. 4.1.3 Albert R, "Topology of evolving networks local events and universality,„ Physical Review Letters, p. 5234, 2000. 4.1.1