5. SUMMARY & CONCLUSIONS We have presented a coarse to fine minimization framework using a coupled dual ellipse model to form a subspace constraint that.

Slides:



Advertisements
Similar presentations
Coherent Laplacian 3D protrusion segmentation Oxford Brookes Vision Group Queen Mary, University of London, 11/12/2009 Fabio Cuzzolin.
Advertisements

Image Segmentation with Level Sets Group reading
Active Contours without Edges
A Graph based Geometric Approach to Contour Extraction from Noisy Binary Images Amal Dev Parakkat, Jiju Peethambaran, Philumon Joseph and Ramanathan Muthuganapathy.
Image Repairing: Robust Image Synthesis by Adaptive ND Tensor Voting IEEE Computer Society Conference on Computer Vision and Pattern Recognition Jiaya.
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
IIIT Hyderabad ROBUST OPTIC DISK SEGMENTATION FROM COLOUR RETINAL IMAGES Gopal Datt Joshi, Rohit Gautam, Jayanthi Sivaswamy CVIT, IIIT Hyderabad, Hyderabad,
3D Segmentation Using Level Set Methods. Heriot-Watt University, Edinburgh, Scotland Zsolt Husz Mokhled Al-TarawnehÍzzet Canarslan University of Newcastle.
Hongliang Li, Senior Member, IEEE, Linfeng Xu, Member, IEEE, and Guanghui Liu Face Hallucination via Similarity Constraints.
Results The algorithm is validated using artificial images of fibres. Statistical analysis showed no significant difference between the ground truth and.
Uncertainty Representation. Gaussian Distribution variance Standard deviation.
Image Segmentation some examples Zhiqiang wang
Image Segmentation and Active Contour
On Constrained Optimization Approach To Object Segmentation Chia Han, Xun Wang, Feng Gao, Zhigang Peng, Xiaokun Li, Lei He, William Wee Artificial Intelligence.
1 Lecture #5 Variational Approaches and Image Segmentation Lecture #5 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Snakes - Active Contour Lecturer: Hagit Hel-Or
Deformable Contours Dr. E. Ribeiro.
Oklahoma State University Generative Graphical Models for Maneuvering Object Tracking and Dynamics Analysis Xin Fan and Guoliang Fan Visual Computing and.
Martin Burger Institut für Numerische und Angewandte Mathematik CeNoS Level set methods for imaging and application to MRI segmentation.
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes (CVPR’10) Shengcai Liao, Guoying Zhao, Vili Kellokumpu,
Locally Constraint Support Vector Clustering
Detecting Image Region Duplication Using SIFT Features March 16, ICASSP 2010 Dallas, TX Xunyu Pan and Siwei Lyu Computer Science Department University.
Incremental Learning of Temporally-Coherent Gaussian Mixture Models Ognjen Arandjelović, Roberto Cipolla Engineering Department, University of Cambridge.
Curve Analogies Aaron Hertzmann Nuria Oliver Brain Curless Steven M. Seitz University of Washington Microsoft Research Thirteenth Eurographics.
Comp 775: Deformable models: snakes and active contours Marc Niethammer, Stephen Pizer Department of Computer Science University of North Carolina, Chapel.
Effective Gaussian mixture learning for video background subtraction Dar-Shyang Lee, Member, IEEE.
In Vivo Snapshot Hyper Spectral Image Analysis of Age-Related Macular Degeneration (AMD) The 32 nd Annual International Conference of the IEEE EMBS August.
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 ,
Stereo Matching Information Permeability For Stereo Matching – Cevahir Cigla and A.Aydın Alatan – Signal Processing: Image Communication, 2013 Radiometric.
Parameter selection in prostate IMRT Renzhi Lu, Richard J. Radke 1, Andrew Jackson 2 Rensselaer Polytechnic Institute 1,Memorial Sloan-Kettering Cancer.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Mutual Information-based Stereo Matching Combined with SIFT Descriptor in Log-chromaticity Color Space Yong Seok Heo, Kyoung Mu Lee, and Sang Uk Lee.
Multimodal Interaction Dr. Mike Spann
Techniques for Estimating Layers from Polar Radar Imagery Jerome E. Mitchell, Geoffrey C. Fox, and David J. Crandall :: CReSIS NSF Site Visit :: School.
Mining Discriminative Components With Low-Rank and Sparsity Constraints for Face Recognition Qiang Zhang, Baoxin Li Computer Science and Engineering Arizona.
Mean Shift Theory and Applications Reporter: Zhongping Ji.
Introduction to Visible Watermarking IPR Course: TA Lecture 2002/12/18 NTU CSIE R105.
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
報告人:張景舜 P.H. Wu, C.C. Chen, J.J. Ding, C.Y. Hsu, and Y.W. Huang IEEE Transactions on Image Processing, Vol. 22, No. 9, September 2013 Salient Region Detection.
OPTIMIZATION OF FUNCTIONAL BRAIN ROIS VIA MAXIMIZATION OF CONSISTENCY OF STRUCTURAL CONNECTIVITY PROFILES Dajiang Zhu Computer Science Department The University.
Combined Central and Subspace Clustering for Computer Vision Applications Le Lu 1 René Vidal 2 1 Computer Science Department, Johns Hopkins University,
Introduction EE 520: Image Analysis & Computer Vision.
Lecture 6 : Level Set Method
R-snakes Lyubomir Zagorchev, Ardeshir Goshtasby, Martin Satter Speaker: HongxingShi Image and Vision Computing 25 (2007) 945–959.
Experiments Test different parking lot images captured in different luminance conditions The test samples include 1300 available parking spaces and 1500.
A Two-level Pose Estimation Framework Using Majority Voting of Gabor Wavelets and Bunch Graph Analysis J. Wu, J. M. Pedersen, D. Putthividhya, D. Norgaard,
Stress constrained optimization using X-FEM and Level Set Description
Sparse Bayesian Learning for Efficient Visual Tracking O. Williams, A. Blake & R. Cipolloa PAMI, Aug Presented by Yuting Qi Machine Learning Reading.
1 Lecture #8 Variational Approaches and Image Segmentation Lecture #8 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Sponsored by Deformation-Driven Topology-Varying 3D Shape Correspondence Ibraheem Alhashim Kai Xu Yixin Zhuang Junjie Cao Patricio Simari Hao Zhang Presenter:
Non-Ideal Iris Segmentation Using Graph Cuts
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.
Occlusion Tracking Using Logical Models Summary. A Variational Partial Differential Equations based model is used for tracking objects under occlusions.
Level Set Segmentation ~ 9.37 Ki-Chang Kwak.
IIIT Hyderabad A NOVEL APPROACH TO SEGMENTATION AND REGISTRATION OF ECHO-CARDIOGRAPHIC IMAGES Vidhyadhari Gondle Supervisor: Jayanthi Sivaswamy CVIT, IIIT.
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Registration of Pathological Images
Introduction Results Material & Methods Conclusions
Dynamical Statistical Shape Priors for Level Set Based Tracking
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
A Latent Space Approach to Dynamic Embedding of Co-occurrence Data
Tobias Heimann - DKFZ Ipek Oguz - UNC Ivo Wolf - DKFZ
PRAKASH CHOCKALINGAM, NALIN PRADEEP, AND STAN BIRCHFIELD
Background extraction with a coarse to fine approach
Paper Reading Dalong Du April.08, 2011.
Presentation transcript:

5. SUMMARY & CONCLUSIONS We have presented a coarse to fine minimization framework using a coupled dual ellipse model to form a subspace constraint that is used as a shape prior for fine model refinement. Our experiments show promising results. Future work is devoted towards extension of our framework to deal with other ring like disease phenotypes. 1 Columbia University, Department of Biomedical Engineering, New York, NY, U.S.A. 2 Columbia University, Department of Ophthalmology, New York, NY, U.S.A. Coarse to Fine Segmentation of Stargardt Rings using an Expert Guided Dual Ellipse Model 1 Noah Lee, 1 Andrew F. Laine, and 2 R. Theodore Smith 1. INTRODUCTION Computer aided diagnosis (CAD) in the medical image domain requires adaptive knowledge-based models to handle uncertainty, ambiguity, and noise. We propose an expert guided coupled dual ellipse model in a coarse to fine energy minimization framework. Quantitative evaluations on synthetic and real data sets show the performance of our framework. Experimental results demonstrate that our framework performs well with an area under the ROC curve of ACKNOWLEDGEMENTS This work was supported by the Imaging and Visualization Department at Siemens Corporate Research.DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD REFERENCES 1.S. J. Osher and J. A. Sethian: Fronts propagation with curvature dependent speed: Algorithms based on Hamilton Jacobi formulations. J. of Comp. Phys., 79:12, D. Cremers, S. Soatto: A pseudo-distance for shape priors in level set segmentation. IEEE 2nd Int. Workshop on Variational, Geometric and Level Set Methods Nice, , MATERIALS & METHODOLOGY 2.1 Input Data Retinal fundus images showing bright Stargardt ring structures. The bright ring is an abnormal accumulation of lipofuscin surrounding the dark macular center region and can manifest itself in a variety of disease phenotypes. 2.3 Coarse Level Model Minimization 3. RESULTS AND DISCUSSION When observing the Az value the performance of the coarse and the fine segmentation results are comparable with a slightly better performance of the fine segmentation of 2.7%. We observer similar performance on the synthetic noise dataset. For the real data experiment the coarse results show slightly higher variations of the mean sensitivity and specificity. 2. MATERIALS & METHODOLOGY The energy functional for the coarse level: To model the fine detail level we transform the coarse level subspace constraint into an implicit representation suitable for shape matching to constrain the fine detail model. Optimization happens in the level set framework proposed by Osher and Sethian [1]. 2.4 Fine Level Model Minimization The expert provides two seed locations placing a prior constraint on the approximate location of the inner and outer ellipse model. We evolve the coupled parametric model towards each other by minimizing for the ring area. We drop an explicit smoothness constraint due to the implicit representation of the coupled dual ellipse model. The data term is a variant of the Mumford –Shah functional minimizing the within class variance of the intensity distribution. The shape term acts as a deflating force. We evaluate our method on synthetic and 10 real datasets to measure noise sensitivity and the ROC performance. We measure the performance of the coarse and fine segmentation step and obtain the following ROC statistics for the synthetic and the retinal Stargardt test cases. Our approach follows the spirit of multi-stage decomposition when analyzing a signal. Prior information from the coarse level guides as a modeling constraint the finer successive detail level when facing data ambiguities. We use Euclidean parametric ellipse models to model a closed ring topology representing the Stargardt ring structure yet constraint in the space of elliptical shapes. The model is flexible in a sense that the expert is able to partially provide model information within the parameter space for minimal expert intervention. 2.2 The Coupled Dual Ellipse Model Coarse level minimization of the ring happens through optimization for three energy terms. In the context of the joint minimization problem the prior term is borrowed invisibly from the coarse level model through transformation to a higher dimensional embedding function. For the fine level model we minimize an energy functional composed of a data term and expert guided shape constraint. We keep the intensity mean values within the intensity mean of the subspace constraint and its background mean. The shape terms is modeled through a shape distance in L 2 with a normalization factor as proposed in Cremers et al [2]. (Top Left) Segmentation results on 4 synthetic images using Gaussian noise of 25%, 50%, and 100%. The middle row shows fitted coupled dual ellipse model in red/green. Bottom row shows the final segmentation result. (Top Right, Bottom Left/Right) Qualitative segmentation results on 12 retinal Stargardt images comprised of different levels of segmentation complexity. The red/green contours denote the shape prior computed in Section 2.3. The yellow/green contours show the final segmentation result. Ground Truth Labelings from Expert