Level Set Segmentation 9.3.6 ~ 9.37 Ki-Chang Kwak.

Slides:



Advertisements
Similar presentations
Image Segmentation with Level Sets Group reading
Advertisements

Active Appearance Models
Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
Level Set Methods for Shape Recovery Fan Ding and Charles Dyer Computer Sciences Department University of Wisconsin.
CSCE643: Computer Vision Bayesian Tracking & Particle Filtering Jinxiang Chai Some slides from Stephen Roth.
MRI preprocessing and segmentation.
QR Code Recognition Based On Image Processing
電腦視覺 Computer and Robot Vision I
Lecture 23 Exemplary Inverse Problems including Earthquake Location.
Wavefront-based models for inverse electrocardiography Alireza Ghodrati (Draeger Medical) Dana Brooks, Gilead Tadmor (Northeastern University) Rob MacLeod.
電腦視覺 Computer and Robot Vision I Chapter2: Binary Machine Vision: Thresholding and Segmentation Instructor: Shih-Shinh Huang 1.
Image Segmentation some examples Zhiqiang wang
Image Segmentation and Active Contour
1Ellen L. Walker Edges Humans easily understand “line drawings” as pictures.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Deformable Contours Dr. E. Ribeiro.
Thresholding Otsu’s Thresholding Method Threshold Detection Methods Optimal Thresholding Multi-Spectral Thresholding 6.2. Edge-based.
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
EE663 Image Processing Edge Detection 2 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
PhD Thesis. Biometrics Science studying measurements and statistics of biological data Most relevant application: id. recognition 2.
Rician Noise Removal in Diffusion Tensor MRI
Statistical Color Models (SCM) Kyungnam Kim. Contents Introduction Trivariate Gaussian model Chromaticity models –Fixed planar chromaticity models –Zhu.
Simulated Annealing G.Anuradha. What is it? Simulated Annealing is a stochastic optimization method that derives its name from the annealing process used.
Methods in Medical Image Analysis Statistics of Pattern Recognition: Classification and Clustering Some content provided by Milos Hauskrecht, University.
UNIVERSITI MALAYSIA PERLIS
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2014.
Machine Vision for Robots
Multimodal Interaction Dr. Mike Spann
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
Discrete Images (Chapter 7) Fourier Transform on discrete and bounded domains. Given an image: 1.Zero boundary condition 2.Periodic boundary condition.
Edges. Edge detection schemes can be grouped in three classes: –Gradient operators: Robert, Sobel, Prewitt, and Laplacian (3x3 and 5x5 masks) –Surface.
MEDICAL IMAGE ANALYSIS Marek Brejl Vital Images, Inc.
Course 9 Texture. Definition: Texture is repeating patterns of local variations in image intensity, which is too fine to be distinguished. Texture evokes.
Medical Image Analysis Image Registration Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
Feature based deformable registration of neuroimages using interest point and feature selection Leonid Teverovskiy Center for Automated Learning and Discovery.
December 9, 2014Computer Vision Lecture 23: Motion Analysis 1 Now we will talk about… Motion Analysis.
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2013.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Simulated Annealing G.Anuradha.
2006 Mouse AHM Mapping 2D slices to 3D atlases - Application of the Digital Atlas Erh-Fang Lee Laboratory of NeuroImage UCLA.
CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.
3.7 Adaptive filtering Joonas Vanninen Antonio Palomino Alarcos.
Chapter 13 (Prototype Methods and Nearest-Neighbors )
A Tutorial on using SIFT Presented by Jimmy Huff (Slightly modified by Josiah Yoder for Winter )
Visual Tracking by Cluster Analysis Arthur Pece Department of Computer Science University of Copenhagen
Edges and Lines Readings: Chapter 10:
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 Overview representing region in 2 ways in terms of its external characteristics (its boundary)  focus on shape characteristics in terms of its internal.
Statistical Models of Appearance for Computer Vision 主講人:虞台文.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Instructor: Mircea Nicolescu Lecture 7
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
1 Edge Operators a kind of filtering that leads to useful features.
11/25/03 3D Model Acquisition by Tracking 2D Wireframes Presenter: Jing Han Shiau M. Brown, T. Drummond and R. Cipolla Department of Engineering University.
ITK 9.3. Level Set Segmentation Shape Detection Segmentation
CSE 554 Lecture 8: Alignment
SIFT Scale-Invariant Feature Transform David Lowe
CS262: Computer Vision Lect 09: SIFT Descriptors
Chapter 10 Image Segmentation
Interest Points EE/CSE 576 Linda Shapiro.
Scale Invariant Feature Transform (SIFT)
Dynamical Statistical Shape Priors for Level Set Based Tracking
The Brightness Constraint
a kind of filtering that leads to useful features
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
a kind of filtering that leads to useful features
Fast Marching and Level Set for Shape Recovery
Presentation transcript:

Level Set Segmentation ~ 9.37 Ki-Chang Kwak

Laplacian Level Set Segmentation The itk::LaplacianSegmentationLevelSetImageFilter defines a speed term based on second derivative features in the image. The speed term is calculated as the Laplacian of the image values. The goal is to attract the evolving level set surface to local zero-crossings in the Laplacian image. The speed term for the LaplacianSegmentationLevelSetImageFilter is constructed by applying the itk::LaplacianImageFilter to the input feature image. One nice property of using the Laplacian is that there are no free parameters in the calculation.

Laplacian Level Set Segmentation

erf

LaplacianSegmentationLevelSetImageFilter level set equation can be weighted by scalars. For this application we will modify the relative weight of the propagation term. The curvature term is not used in this filter.

Results of applying LaplacianSegmentationLevelSetImageFilter Original imagemodel imageIteration : 10 Iteration : 20 Jagged edges are straightened and the small spur at the right-hand side of the mask has been removed.

Geodesic Active Contours Segmentation With Shape Guidance The source code for this section can be found in the file Examples/segmentation/GeodesicActiveContourShapePrioriLevelSetImageFilter.cxx In medical imaging applications, the general shape, location and orientation of an anatomical structure of interest is typically known a priori. This information can be used to aid the segmentation process especially when image contrast is low or when the object boundary is not distinct.

Geodesic Active Contours Segmentation With Shape Guidance

ShapePriorMAPCostFunction The cost fuunction is composed of composed of Four terms -Contour fit measures the likelihood of seeing the current evolving contour for a given set of shape/pose parameters. This is computed by Counting the number of pixels inside the current Contour but outside the current shape. -Image fit measures the likelihood of seeing Certain image features for a given set of shape/ pose parameters. This is computed by assuming that (1 – edge potential) approximates a zero- mean, unit variance Gaussian along the normal of the evolving contour.

ShapePriorMAPCostFunction Where G is a zero-mean, unit variance Gaussian and g is the edge potential feature image. The pose parameters are assumed to have a uniform distribution and hence do not contribute to the cost function. The shape parameters are assumed to have a Gaussian distribution. Maximum A Posteriori Estimation Goal : knowing a priori estimate p(θ) compute the posterior estimate p(θ|D)

OnePlusOneEvolutionaryOptimizer Strategy that simulates the biological evolution of a set of samples in the search space. This optimizer is mainly used in the process of bias Correction of MRI images.

Euler2DTransform -itk:Euler2DTransform implements a rigid transformation in 2D. It is composed of a plane Rotation and a two-dimensional translation. The first parameter is the angle in radians and the last two parameters are the translation in each dimension.

PCAShapeSignedDistance The itk::PCAShapeSignedDistanceFunction represents a statistical shape model defined by a mean signed distance and the first K principal components modes.

For debugging purposes it is quite helpful to track the evolution of the segmentation as it progresses. The following defines a custom itk::Command class for monitoring the RMS change and shape parameters at each iteration.

The input image to the GeodesicActiveContourShapePrioriLevelSetImageFilter is a Synthesized MR-T1 mid-sagittal slice (217 × 180 pixels, 1 × 1 mm spacing) of the Brain(left) and the initial best-fit shape(right) chosen to roughly overlap the corpus Callosum in the image to be segmented.

It can be observed that without shape guidance (left), segmentation using geodesic active contour leaks in the regions where the corpus callosum blends into the surrounding brain tissues. With shape guidance (center), the segmentation is constrained by the global shape model to prevent leaking.