Segmentation of MR Images of a Beating Heart
|
|
- Claribel Hoover
- 6 years ago
- Views:
Transcription
1 Segmentation of MR Images of a Beating Heart Avinash Ravichandran Abstract Heart Arrhythmia is currently treated using invasive procedures. In order use to non invasive procedures accurate imaging modalities and algorithms are required. Magnetic Resonance Imaging (MRI) gives us the ability to visualize the ablations, while not producing any adverse effects such as radiation on the patients. A vital component of such visualization algorithm based on MR images, is the accurate segmentation of the heart from the chest. Since the segmentation would be repeated during the procedure, unsupervised methods would be preferred to methods that would involve any human intervention. 1. Introduction Given a set of ECG gated MR axial heart images, each image consisting of the heart and the chest of the patient,we want to segment the heart and chest from these images. For this segmentation the dynamics of the heart and the chest are exploited. For a given slice (i.e images containing the temporal evolution of a particular spatial location of the heart) the chest is static while the heart is moving. We try to model the heart as a dynamic texture and considering that a dynamic texture lies in a subspace the problem reduces to a subspace clustering problem. Thus in order to segment the subspaces we need to resort to existing algorithms such as Generalized Principal Component Analysis (GPCA) [3] and K-Subspace clustering. Using these algorithms, with some variations we can obtain the subspaces. 1.1 Contribution of the project The project address the following issues. 1. To determine the performance of the various algorithms namely GPCA, K-subspace and spatial GPCA. 2. For the K-subspace algorithm to determine the effect of the number of iterations and the initialization on the performance of the algorithm. 3. Window size effects on the performance of spatial GPCA also needs to be evaluated 2. Intensity Based Segmentation A MR axial image can be considered to be made up of three components. The heart, the chest and the background (which is predominantly noise). A two step approach is used to segment these three groups. We first use an intensity based segmentation on the images and separate the image into two groups, the background and the other group containing both the heart and the chest. Existing algorithms such Polysegment, K-Means and Expectation Maximization (EM) can be used for this step. We assume that the there exists a constant number of intensity groups n throughout the data set and determine this number through experiments.we choose n such that the lowest intensity group among the n groups must contain most of the background and a very small portion of the heart and the chest. If n is very small then along with the background a large part of the heart and the chest will be removed. If n is too large the background will not get removed completely. 3. Dynamics Based Segmentation We propose to model the heart as a dynamic texture. [2] [1] We know that a dynamic texture will lie in a subspace of dimensions R N where N is the order of the system. For a particular slice of the heart, if one observes the temporal evolution, the chest remains static while the heart beats. Thus there are two dynamic textures one of the heart, and one of the chest. This would imply that every dynamic texture would lie in separate subspace of dimensions R N. Hence if one were to consider the temporal evolution of a point in all the frames of the sequence it would lie in one of the two subspaces. Let us consider the number of frames in the sequence to be F, I(t) be vectorised frame at time t 1... F and P be the number of points in each frame. If we were to consider M = [I(1) I(F )] R P F then each row of this matrix represents the temporal evolution of a point. Thus the problem of separating the heart from the chest reduces to a subspace segmentation problem. To achieve the segmentation in this project we use an algebraic algorithm i.e. GPCA and a iterative algorithm namely K-Subspace. For both the algorithms we preprocess the data first by projecting M R P F onto a lower dimensional subspace R d P. This is done by calculating the SVD of M = USV T and then M p R P d is the first d columns of U. 1
2 3.1 Generalized Principal Component Analysis (GPCA) The following section outlines the application of GPCA to M p to segment the data. 1. Since the temporal evolution of each point belongs to either one of the subspaces S h or S c with normal vectors b h and b c, we get v = (b h T x p )(b c T x p ) = 0 (1) where x p R d is the temporal evolution of a point p. In this case the pth row of M p.we see that v will be a homogenous polynomial of degree 2 in d variables 2. b h and b c can be solved from the derivatives of v at points x c and x h Hence we get b h = Dv(x h) Dv(x h ) ; b c = Dv(x c) Dv(x c ) (2) 3. Once b h and b c are known the points can be classified into those belonging to the heart and those belonging to the chest. We propose a slight modification to the GPCA algorithm to incorporate spatial information. In an image we assume that adjacent pixel usually tend to belong to the same object.thus this would help us overcome the problem of isolated pixels in the heart belonging to the chest and vice versa. The spatial version of the algorithm is listed below 1. The derivatives of every point in a frame is calculated. The derivatives are however not normalized. 2. The derivatives of the points in a window Ω of size τ τ is taken. Since the assumption that the points in this window must belong to the same subspace, we want to smooth the derivatives so that the points belong to the same group.the principal component of these derivatives are taken and the derivatives in the window Ω are replaced by it.this process is repeated by sliding the window 3. Once the derivatives are smoothed. The points are segmented subject to k = arg min j=1,2 {bt j D(x)} (3) One can also choose to fit a window function to the window Ω. A popular choice could be a gaussian window. The segmentation is now also a function of s and the window function. 3.2 K-Subspace The iterative algorithm used for the segmentation is the K- subspace. While implementing the algorithm we make the assumption that the dimensions of the subspaces are the same and they are hyperplanes in the ambient space. K- Subspace is usually not restricted by such assumptions but for comparison with GPCA we have imposed the above structure of the subspaces. The K subspaces algorithm is outlined below. 1. The basis for the subpaces S h and S c namely U h, U c R d (d 1) are randomly initialized such that both the matrices are orthogonal 2. The points are then classified based on k = arg min x i U (m) j=1,2 l (U (m) l ) T x i 2 (4) 3. Once the points are classified, the basis U (m+1) h are calculated U (m+1) c U (m+1) h U c (m+1) and = P CA(X (m) h ) (5) = P CA(X (m) c ) (6) To achieve better convergence one can initialize K- subspace with the normals obtained from GPCA. We then obtain the segmentation from of M p using the algorithm. 4 Experimental Results The data set consisted of axial MR images of 9 unique slices of the heart.at each slice 20 frames represented the temporal evolution of the heart.all the experiments in this project perform the segmentation slice by slice. Each image was down sampled from to to accommodate the memory constraints imposed by K-Subspace 4.1 Intensity based segmentation The results of using polysegment and K-means to remove the background from the heart and the chest is show in figure 1. Both the algorithms perform well and they both are obtained by setting n = 15.The pixels thats belong to the background obtained by intensity segmentation are not used in the second stage of the algorithm namely the dynamic segmentation. 4.2 Dynamics based segmentation We first project the data from a subspace of dimension F = 20 to d = 3 and then use the segmentation algorithms to separate the heart and the chest. 2
3 Figure 1. Intensity based segmentation. The figure in the left is the result of the polysegment algorithm while the figure on the right is using kmeans Figure 3. Segmentation using Spatial GPCA. The figure in the left shows one of the frames of the sequence.the middle figure shows the points segmented as the chest and the right figure shows the points segmented as the heart GPCA and Spatial GPCA Figure 2 shows the segmentation for one slice of the heart. One can notice that there is a lot of misclassifications, and the segmentation is very noisy. It is for this purpose we wish to impose additional spatial constraints. Figure 2. Segmentation using GPCA. The figure in the left shows one of the frames of the sequence.the middle figure shows the points segmented as the chest and the right figure shows the points segmented as the heart. Figure 3 shows the results of using the spatial constraints on the segmentation. When compared to the GPCA results one gets really smooth segmentations and the effect of isolated noise pixels is reduced. The size of the window used for these results is s = 3. Different window types where used namely a rectangular window and a gaussian window to scale the normals in Ω. But however the use of these windows does not vary the segmentation much hence we do not continue to explore this path. The window size however makes a difference in the segmentation. Figure 4 shows the effect when we use s = 3 and s = 9, the effect of using a larger window size gives us a better segmentation when comparing the chest alone but then using a larger window groups a large part of the chest with the heart. This is not desirable. Figure 4. Window Size effects. The figures on the left show the chest and the heart segmentation for s = 3 and those on the right are for s = 9 rithm was tested using synthetic data generated to live in two subspaces, the norm error was reached. Figure 5 shows the segmentation of a particular slice of the heart using the K-Subspace algorithm. In this case the K-subspace is randomly initialized K-Subspace In all the implementations of the K-Subspace algorithm the criterion for convergence was that the maximum number of iterations was less than N 0 or the norm of the error was less than ɛ. When the algorithm was run with the heart images never did the norm error reduce below ɛ. Thus N 0 was the only criteria for the convergence. However when the algo- Figure 5. Segmentation using K-Subspace.The figure in the left shows one of the frames of the sequence.the middle figure shows the points segmented as the chest and the right figure shows the points segmented as the heart. The effect of the number of iterations is shown in Figure 6. Looking at these results one can come to the conclusion 3
4 that lesser the number of iterations the better is the segmentation. However this trend does not hold good in all the slices of the heart and hence nothing conclusive can be said about the effect of the number of iterations on the accuracy of the segmentation. Figure 6. Effect of Iterations on K-Subspace. The left figure is for N 0 = 100, the middle one for N 0 = 400 and the right one for N 0 = 600 We also explore the effect of initialization on the performance of K-Subspace algorithm. The figure 7 shows the effect of initialization using GPCA on K-Subspace. The performance marginally improves if K-subspace is manually initialized with the normals from GPCA. The norm error however is not met and the algorithms still runs up to the maximum number of iterations. Figure 7. Effect of Initializations- The right figure shows the K- subspace algorithm initialized using GPCA Finally we compare all the algorithms in Figure 8. It clearly shows us that Spatial GPCA outperforms the other two cases. Figure 9 shows us the performance of the algorithm for all the slices of the heart. Figure 8. Comparison of the Methods- The performance of the GPCA(left), K-Subspace (middle) and Spatial GPCA(right) for a particular slice Figure 9. Spatial GPCA results for the 9 slices of the heart 4
5 5 Summary and Conclusions The accuracy of the three algorithms were tested and it was found that the K-subspace and GPCA perform with similar accuracy. However K-subspace takes about iterations to get the same results, thus we see it terms of speed, GPCA outperforms K-subspace. The spatial GPCA algorithm performs the best among the three. The window size s is a critical factor in getting good results out of the spatial GPCA. Care must be taken to make s optimal such that smoother segmentation is achieved at the same time large parts of the other group do not become a part of the segmentation. Nothing conclusive can be said about the the advantage of initializing K-Subspace with GPCA. In some cases the results are better than randomly initialized basis, but however there is no definite trend. The number of iterations also do not exhibit a trend to say whether more iterations are better or not. We thus see using spatial GPCA is a definite way to achieve good segmentations at least in the axial images. References [1] G. Doretto, A. Chiuso, Y. Wu, and S. Soatto. Dynamic textures. International Journal of Computer Vision, 51(2):91 109, February [2] S. Soatto, G. Doretto, and Y. Wu. Dynamic textures. In IEEE International Conference on Computer Vision, pages , [3] R. Vidal, Y. Ma, and S. Sastry. Generalized principal component analysis (GPCA). In IEEE Conference on Computer Vision and Pattern Recognition, volume I, pages ,
Generalized Principal Component Analysis CVPR 2007
Generalized Principal Component Analysis Tutorial @ CVPR 2007 Yi Ma ECE Department University of Illinois Urbana Champaign René Vidal Center for Imaging Science Institute for Computational Medicine Johns
More informationSpatial Segmentation of Temporal Texture Using Mixture Linear Models
Spatial Segmentation of Temporal Texture Using Mixture Linear Models Lee Cooper Department of Electrical Engineering Ohio State University Columbus, OH 43210 cooperl@ece.osu.edu Kun Huang Department of
More informationClassification of Subject Motion for Improved Reconstruction of Dynamic Magnetic Resonance Imaging
1 CS 9 Final Project Classification of Subject Motion for Improved Reconstruction of Dynamic Magnetic Resonance Imaging Feiyu Chen Department of Electrical Engineering ABSTRACT Subject motion is a significant
More informationFacial Expression Recognition Using Non-negative Matrix Factorization
Facial Expression Recognition Using Non-negative Matrix Factorization Symeon Nikitidis, Anastasios Tefas and Ioannis Pitas Artificial Intelligence & Information Analysis Lab Department of Informatics Aristotle,
More informationCHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION
CHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION 6.1 INTRODUCTION Fuzzy logic based computational techniques are becoming increasingly important in the medical image analysis arena. The significant
More informationMR IMAGE SEGMENTATION
MR IMAGE SEGMENTATION Prepared by : Monil Shah What is Segmentation? Partitioning a region or regions of interest in images such that each region corresponds to one or more anatomic structures Classification
More informationA Bottom Up Algebraic Approach to Motion Segmentation
A Bottom Up Algebraic Approach to Motion Segmentation Dheeraj Singaraju and RenéVidal Center for Imaging Science, Johns Hopkins University, 301 Clark Hall, 3400 N. Charles St., Baltimore, MD, 21218, USA
More informationCHAPTER 3 TUMOR DETECTION BASED ON NEURO-FUZZY TECHNIQUE
32 CHAPTER 3 TUMOR DETECTION BASED ON NEURO-FUZZY TECHNIQUE 3.1 INTRODUCTION In this chapter we present the real time implementation of an artificial neural network based on fuzzy segmentation process
More informationUnsupervised learning in Vision
Chapter 7 Unsupervised learning in Vision The fields of Computer Vision and Machine Learning complement each other in a very natural way: the aim of the former is to extract useful information from visual
More informationSubspace Clustering with Global Dimension Minimization And Application to Motion Segmentation
Subspace Clustering with Global Dimension Minimization And Application to Motion Segmentation Bryan Poling University of Minnesota Joint work with Gilad Lerman University of Minnesota The Problem of Subspace
More informationFactorization with Missing and Noisy Data
Factorization with Missing and Noisy Data Carme Julià, Angel Sappa, Felipe Lumbreras, Joan Serrat, and Antonio López Computer Vision Center and Computer Science Department, Universitat Autònoma de Barcelona,
More informationAnalysis of Functional MRI Timeseries Data Using Signal Processing Techniques
Analysis of Functional MRI Timeseries Data Using Signal Processing Techniques Sea Chen Department of Biomedical Engineering Advisors: Dr. Charles A. Bouman and Dr. Mark J. Lowe S. Chen Final Exam October
More informationModelling Data Segmentation for Image Retrieval Systems
Modelling Data Segmentation for Image Retrieval Systems Leticia Flores-Pulido 1,2, Oleg Starostenko 1, Gustavo Rodríguez-Gómez 3 and Vicente Alarcón-Aquino 1 1 Universidad de las Américas Puebla, Puebla,
More informationNonparametric estimation of multiple structures with outliers
Nonparametric estimation of multiple structures with outliers Wei Zhang and Jana Kosecka George Mason University, 44 University Dr. Fairfax, VA 223 USA Abstract. Common problem encountered in the analysis
More informationApplications. Foreground / background segmentation Finding skin-colored regions. Finding the moving objects. Intelligent scissors
Segmentation I Goal Separate image into coherent regions Berkeley segmentation database: http://www.eecs.berkeley.edu/research/projects/cs/vision/grouping/segbench/ Slide by L. Lazebnik Applications Intelligent
More informationAn Introduction To Automatic Tissue Classification Of Brain MRI. Colm Elliott Mar 2014
An Introduction To Automatic Tissue Classification Of Brain MRI Colm Elliott Mar 2014 Tissue Classification Tissue classification is part of many processing pipelines. We often want to classify each voxel
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Structure Computation Lecture 18 March 22, 2005 2 3D Reconstruction The goal of 3D reconstruction
More informationParametric Texture Model based on Joint Statistics
Parametric Texture Model based on Joint Statistics Gowtham Bellala, Kumar Sricharan, Jayanth Srinivasa Department of Electrical Engineering, University of Michigan, Ann Arbor 1. INTRODUCTION Texture images
More informationRobust GPCA Algorithm with Applications in Video Segmentation Via Hybrid System Identification
Robust GPCA Algorithm with Applications in Video Segmentation Via Hybrid System Identification Kun Huang and Yi Ma Coordinated Science Laboratory Department of Electrical and Computer Engineering University
More informationNonparametric estimation of multiple structures with outliers
Nonparametric estimation of multiple structures with outliers Wei Zhang and Jana Kosecka Department of Computer Science, George Mason University, 44 University Dr. Fairfax, VA 223 USA {wzhang2,kosecka}@cs.gmu.edu
More informationINF 4300 Classification III Anne Solberg The agenda today:
INF 4300 Classification III Anne Solberg 28.10.15 The agenda today: More on estimating classifier accuracy Curse of dimensionality and simple feature selection knn-classification K-means clustering 28.10.15
More informationNorbert Schuff VA Medical Center and UCSF
Norbert Schuff Medical Center and UCSF Norbert.schuff@ucsf.edu Medical Imaging Informatics N.Schuff Course # 170.03 Slide 1/67 Objective Learn the principle segmentation techniques Understand the role
More informationMarkov Networks in Computer Vision
Markov Networks in Computer Vision Sargur Srihari srihari@cedar.buffalo.edu 1 Markov Networks for Computer Vision Some applications: 1. Image segmentation 2. Removal of blur/noise 3. Stereo reconstruction
More informationComputer Vision 6 Segmentation by Fitting
Computer Vision 6 Segmentation by Fitting MAP-I Doctoral Programme Miguel Tavares Coimbra Outline The Hough Transform Fitting Lines Fitting Curves Fitting as a Probabilistic Inference Problem Acknowledgements:
More informationMarkov Networks in Computer Vision. Sargur Srihari
Markov Networks in Computer Vision Sargur srihari@cedar.buffalo.edu 1 Markov Networks for Computer Vision Important application area for MNs 1. Image segmentation 2. Removal of blur/noise 3. Stereo reconstruction
More informationCombined Central and Subspace Clustering for Computer Vision Applications
for Computer Vision Applications Le Lu Department of Computer Science, Johns Hopkins University, Baltimore, MD 21218, USA LELU@CS.JHU.EDU René Vidal RVIDAL@CIS.JHU.EDU Center for Imaging Science, Biomedical
More informationDynamic Texture with Fourier Descriptors
B. Abraham, O. Camps and M. Sznaier: Dynamic texture with Fourier descriptors. In Texture 2005: Proceedings of the 4th International Workshop on Texture Analysis and Synthesis, pp. 53 58, 2005. Dynamic
More informationSCIENCE & TECHNOLOGY
Pertanika J. Sci. & Technol. 26 (1): 309-316 (2018) SCIENCE & TECHNOLOGY Journal homepage: http://www.pertanika.upm.edu.my/ Application of Active Contours Driven by Local Gaussian Distribution Fitting
More informationRandom projection for non-gaussian mixture models
Random projection for non-gaussian mixture models Győző Gidófalvi Department of Computer Science and Engineering University of California, San Diego La Jolla, CA 92037 gyozo@cs.ucsd.edu Abstract Recently,
More informationFunction approximation using RBF network. 10 basis functions and 25 data points.
1 Function approximation using RBF network F (x j ) = m 1 w i ϕ( x j t i ) i=1 j = 1... N, m 1 = 10, N = 25 10 basis functions and 25 data points. Basis function centers are plotted with circles and data
More informationFACE RECOGNITION USING SUPPORT VECTOR MACHINES
FACE RECOGNITION USING SUPPORT VECTOR MACHINES Ashwin Swaminathan ashwins@umd.edu ENEE633: Statistical and Neural Pattern Recognition Instructor : Prof. Rama Chellappa Project 2, Part (b) 1. INTRODUCTION
More informationDimension Reduction CS534
Dimension Reduction CS534 Why dimension reduction? High dimensionality large number of features E.g., documents represented by thousands of words, millions of bigrams Images represented by thousands of
More informationCS 543: Final Project Report Texture Classification using 2-D Noncausal HMMs
CS 543: Final Project Report Texture Classification using 2-D Noncausal HMMs Felix Wang fywang2 John Wieting wieting2 Introduction We implement a texture classification algorithm using 2-D Noncausal Hidden
More informationNormalized Texture Motifs and Their Application to Statistical Object Modeling
Normalized Texture Motifs and Their Application to Statistical Obect Modeling S. D. Newsam B. S. Manunath Center for Applied Scientific Computing Electrical and Computer Engineering Lawrence Livermore
More informationCSSE463: Image Recognition Day 21
CSSE463: Image Recognition Day 21 Sunset detector due. Foundations of Image Recognition completed This wee: K-means: a method of Image segmentation Questions? An image to segment Segmentation The process
More informationSGN (4 cr) Chapter 11
SGN-41006 (4 cr) Chapter 11 Clustering Jussi Tohka & Jari Niemi Department of Signal Processing Tampere University of Technology February 25, 2014 J. Tohka & J. Niemi (TUT-SGN) SGN-41006 (4 cr) Chapter
More informationUsing Subspace Constraints to Improve Feature Tracking Presented by Bryan Poling. Based on work by Bryan Poling, Gilad Lerman, and Arthur Szlam
Presented by Based on work by, Gilad Lerman, and Arthur Szlam What is Tracking? Broad Definition Tracking, or Object tracking, is a general term for following some thing through multiple frames of a video
More informationMachine Learning for Signal Processing Clustering. Bhiksha Raj Class Oct 2016
Machine Learning for Signal Processing Clustering Bhiksha Raj Class 11. 13 Oct 2016 1 Statistical Modelling and Latent Structure Much of statistical modelling attempts to identify latent structure in the
More informationTexture Image Segmentation using FCM
Proceedings of 2012 4th International Conference on Machine Learning and Computing IPCSIT vol. 25 (2012) (2012) IACSIT Press, Singapore Texture Image Segmentation using FCM Kanchan S. Deshmukh + M.G.M
More informationSupervised vs. Unsupervised Learning
Clustering Supervised vs. Unsupervised Learning So far we have assumed that the training samples used to design the classifier were labeled by their class membership (supervised learning) We assume now
More informationImage Segmentation and Registration
Image Segmentation and Registration Dr. Christine Tanner (tanner@vision.ee.ethz.ch) Computer Vision Laboratory, ETH Zürich Dr. Verena Kaynig, Machine Learning Laboratory, ETH Zürich Outline Segmentation
More informationImage Coding with Active Appearance Models
Image Coding with Active Appearance Models Simon Baker, Iain Matthews, and Jeff Schneider CMU-RI-TR-03-13 The Robotics Institute Carnegie Mellon University Abstract Image coding is the task of representing
More informationRecognition, SVD, and PCA
Recognition, SVD, and PCA Recognition Suppose you want to find a face in an image One possibility: look for something that looks sort of like a face (oval, dark band near top, dark band near bottom) Another
More informationParticle Swarm Optimization applied to Pattern Recognition
Particle Swarm Optimization applied to Pattern Recognition by Abel Mengistu Advisor: Dr. Raheel Ahmad CS Senior Research 2011 Manchester College May, 2011-1 - Table of Contents Introduction... - 3 - Objectives...
More informationHand-Eye Calibration from Image Derivatives
Hand-Eye Calibration from Image Derivatives Abstract In this paper it is shown how to perform hand-eye calibration using only the normal flow field and knowledge about the motion of the hand. The proposed
More informationLocally Weighted Least Squares Regression for Image Denoising, Reconstruction and Up-sampling
Locally Weighted Least Squares Regression for Image Denoising, Reconstruction and Up-sampling Moritz Baecher May 15, 29 1 Introduction Edge-preserving smoothing and super-resolution are classic and important
More informationRigid Motion Segmentation using Randomized Voting
Rigid Motion Segmentation using Randomized Voting Heechul Jung Jeongwoo Ju Junmo Kim Statistical Inference and Information Theory Laboratory Korea Advanced Institute of Science and Technology {heechul,
More informationContent-based image and video analysis. Machine learning
Content-based image and video analysis Machine learning for multimedia retrieval 04.05.2009 What is machine learning? Some problems are very hard to solve by writing a computer program by hand Almost all
More informationRECOVERY OF PARTIALLY OBSERVED DATA APPEARING IN CLUSTERS. Sunrita Poddar, Mathews Jacob
RECOVERY OF PARTIALLY OBSERVED DATA APPEARING IN CLUSTERS Sunrita Poddar, Mathews Jacob Department of Electrical and Computer Engineering The University of Iowa, IA, USA ABSTRACT We propose a matrix completion
More informationA Parametric Texture Model based on Joint Statistics of Complex Wavelet Coefficients. Gowtham Bellala Kumar Sricharan Jayanth Srinivasa
A Parametric Texture Model based on Joint Statistics of Complex Wavelet Coefficients Gowtham Bellala Kumar Sricharan Jayanth Srinivasa 1 Texture What is a Texture? Texture Images are spatially homogeneous
More informationComputer Vision 2. SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung. Computer Vision 2 Dr. Benjamin Guthier
Computer Vision 2 SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung Computer Vision 2 Dr. Benjamin Guthier 1. IMAGE PROCESSING Computer Vision 2 Dr. Benjamin Guthier Content of this Chapter Non-linear
More informationEfficient Image Compression of Medical Images Using the Wavelet Transform and Fuzzy c-means Clustering on Regions of Interest.
Efficient Image Compression of Medical Images Using the Wavelet Transform and Fuzzy c-means Clustering on Regions of Interest. D.A. Karras, S.A. Karkanis and D. E. Maroulis University of Piraeus, Dept.
More informationImage Segmentation Via Iterative Geodesic Averaging
Image Segmentation Via Iterative Geodesic Averaging Asmaa Hosni, Michael Bleyer and Margrit Gelautz Institute for Software Technology and Interactive Systems, Vienna University of Technology Favoritenstr.
More informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More informationBioimage Informatics
Bioimage Informatics Lecture 14, Spring 2012 Bioimage Data Analysis (IV) Image Segmentation (part 3) Lecture 14 March 07, 2012 1 Outline Review: intensity thresholding based image segmentation Morphological
More informationAN IMPROVED K-MEANS CLUSTERING ALGORITHM FOR IMAGE SEGMENTATION
AN IMPROVED K-MEANS CLUSTERING ALGORITHM FOR IMAGE SEGMENTATION WILLIAM ROBSON SCHWARTZ University of Maryland, Department of Computer Science College Park, MD, USA, 20742-327, schwartz@cs.umd.edu RICARDO
More informationNorbert Schuff Professor of Radiology VA Medical Center and UCSF
Norbert Schuff Professor of Radiology Medical Center and UCSF Norbert.schuff@ucsf.edu 2010, N.Schuff Slide 1/67 Overview Definitions Role of Segmentation Segmentation methods Intensity based Shape based
More informationNew Approaches for EEG Source Localization and Dipole Moment Estimation. Shun Chi Wu, Yuchen Yao, A. Lee Swindlehurst University of California Irvine
New Approaches for EEG Source Localization and Dipole Moment Estimation Shun Chi Wu, Yuchen Yao, A. Lee Swindlehurst University of California Irvine Outline Motivation why EEG? Mathematical Model equivalent
More informationObject Extraction Using Image Segmentation and Adaptive Constraint Propagation
Object Extraction Using Image Segmentation and Adaptive Constraint Propagation 1 Rajeshwary Patel, 2 Swarndeep Saket 1 Student, 2 Assistant Professor 1 2 Department of Computer Engineering, 1 2 L. J. Institutes
More informationSegmentation of Images
Segmentation of Images SEGMENTATION If an image has been preprocessed appropriately to remove noise and artifacts, segmentation is often the key step in interpreting the image. Image segmentation is a
More informationSegmentation of Distinct Homogeneous Color Regions in Images
Segmentation of Distinct Homogeneous Color Regions in Images Daniel Mohr and Gabriel Zachmann Department of Computer Science, Clausthal University, Germany, {mohr, zach}@in.tu-clausthal.de Abstract. In
More informationProbabilistic Facial Feature Extraction Using Joint Distribution of Location and Texture Information
Probabilistic Facial Feature Extraction Using Joint Distribution of Location and Texture Information Mustafa Berkay Yilmaz, Hakan Erdogan, Mustafa Unel Sabanci University, Faculty of Engineering and Natural
More informationImage Processing. Image Features
Image Processing Image Features Preliminaries 2 What are Image Features? Anything. What they are used for? Some statements about image fragments (patches) recognition Search for similar patches matching
More informationRobotics Programming Laboratory
Chair of Software Engineering Robotics Programming Laboratory Bertrand Meyer Jiwon Shin Lecture 8: Robot Perception Perception http://pascallin.ecs.soton.ac.uk/challenges/voc/databases.html#caltech car
More informationSpatio-Temporal Registration of Biomedical Images by Computational Methods
Spatio-Temporal Registration of Biomedical Images by Computational Methods Francisco P. M. Oliveira, João Manuel R. S. Tavares tavares@fe.up.pt, www.fe.up.pt/~tavares Outline 1. Introduction 2. Spatial
More informationImproved Non-Local Means Algorithm Based on Dimensionality Reduction
Improved Non-Local Means Algorithm Based on Dimensionality Reduction Golam M. Maruf and Mahmoud R. El-Sakka (&) Department of Computer Science, University of Western Ontario, London, Ontario, Canada {gmaruf,melsakka}@uwo.ca
More informationCS 664 Slides #11 Image Segmentation. Prof. Dan Huttenlocher Fall 2003
CS 664 Slides #11 Image Segmentation Prof. Dan Huttenlocher Fall 2003 Image Segmentation Find regions of image that are coherent Dual of edge detection Regions vs. boundaries Related to clustering problems
More informationAlgebraic Iterative Methods for Computed Tomography
Algebraic Iterative Methods for Computed Tomography Per Christian Hansen DTU Compute Department of Applied Mathematics and Computer Science Technical University of Denmark Per Christian Hansen Algebraic
More informationWhole Body MRI Intensity Standardization
Whole Body MRI Intensity Standardization Florian Jäger 1, László Nyúl 1, Bernd Frericks 2, Frank Wacker 2 and Joachim Hornegger 1 1 Institute of Pattern Recognition, University of Erlangen, {jaeger,nyul,hornegger}@informatik.uni-erlangen.de
More informationCS Introduction to Data Mining Instructor: Abdullah Mueen
CS 591.03 Introduction to Data Mining Instructor: Abdullah Mueen LECTURE 8: ADVANCED CLUSTERING (FUZZY AND CO -CLUSTERING) Review: Basic Cluster Analysis Methods (Chap. 10) Cluster Analysis: Basic Concepts
More informationEngineering Problem and Goal
Engineering Problem and Goal Engineering Problem: Traditional active contour models can not detect edges or convex regions in noisy images. Engineering Goal: The goal of this project is to design an algorithm
More informationRobust Face Recognition via Sparse Representation Authors: John Wright, Allen Y. Yang, Arvind Ganesh, S. Shankar Sastry, and Yi Ma
Robust Face Recognition via Sparse Representation Authors: John Wright, Allen Y. Yang, Arvind Ganesh, S. Shankar Sastry, and Yi Ma Presented by Hu Han Jan. 30 2014 For CSE 902 by Prof. Anil K. Jain: Selected
More informationRegion-based Segmentation
Region-based Segmentation Image Segmentation Group similar components (such as, pixels in an image, image frames in a video) to obtain a compact representation. Applications: Finding tumors, veins, etc.
More informationBiometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)
Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong) References: [1] http://homepages.inf.ed.ac.uk/rbf/hipr2/index.htm [2] http://www.cs.wisc.edu/~dyer/cs540/notes/vision.html
More informationBilevel Sparse Coding
Adobe Research 345 Park Ave, San Jose, CA Mar 15, 2013 Outline 1 2 The learning model The learning algorithm 3 4 Sparse Modeling Many types of sensory data, e.g., images and audio, are in high-dimensional
More informationLearning to Identify Fuzzy Regions in Magnetic Resonance Images
Learning to Identify Fuzzy Regions in Magnetic Resonance Images Sarah E. Crane and Lawrence O. Hall Department of Computer Science and Engineering, ENB 118 University of South Florida 4202 E. Fowler Ave.
More informationEE 701 ROBOT VISION. Segmentation
EE 701 ROBOT VISION Regions and Image Segmentation Histogram-based Segmentation Automatic Thresholding K-means Clustering Spatial Coherence Merging and Splitting Graph Theoretic Segmentation Region Growing
More informationLevel-set MCMC Curve Sampling and Geometric Conditional Simulation
Level-set MCMC Curve Sampling and Geometric Conditional Simulation Ayres Fan John W. Fisher III Alan S. Willsky February 16, 2007 Outline 1. Overview 2. Curve evolution 3. Markov chain Monte Carlo 4. Curve
More informationChapter 7: Computation of the Camera Matrix P
Chapter 7: Computation of the Camera Matrix P Arco Nederveen Eagle Vision March 18, 2008 Arco Nederveen (Eagle Vision) The Camera Matrix P March 18, 2008 1 / 25 1 Chapter 7: Computation of the camera Matrix
More informationImage Segmentation Based on Watershed and Edge Detection Techniques
0 The International Arab Journal of Information Technology, Vol., No., April 00 Image Segmentation Based on Watershed and Edge Detection Techniques Nassir Salman Computer Science Department, Zarqa Private
More information6. Linear Discriminant Functions
6. Linear Discriminant Functions Linear Discriminant Functions Assumption: we know the proper forms for the discriminant functions, and use the samples to estimate the values of parameters of the classifier
More informationDimension Reduction of Image Manifolds
Dimension Reduction of Image Manifolds Arian Maleki Department of Electrical Engineering Stanford University Stanford, CA, 9435, USA E-mail: arianm@stanford.edu I. INTRODUCTION Dimension reduction of datasets
More informationLecture 11: E-M and MeanShift. CAP 5415 Fall 2007
Lecture 11: E-M and MeanShift CAP 5415 Fall 2007 Review on Segmentation by Clustering Each Pixel Data Vector Example (From Comanciu and Meer) Review of k-means Let's find three clusters in this data These
More informationNormalized cuts and image segmentation
Normalized cuts and image segmentation Department of EE University of Washington Yeping Su Xiaodan Song Normalized Cuts and Image Segmentation, IEEE Trans. PAMI, August 2000 5/20/2003 1 Outline 1. Image
More informationSubspace Clustering. Weiwei Feng. December 11, 2015
Subspace Clustering Weiwei Feng December 11, 2015 Abstract Data structure analysis is an important basis of machine learning and data science, which is now widely used in computational visualization problems,
More informationA NEURAL NETWORK BASED IMAGING SYSTEM FOR fmri ANALYSIS IMPLEMENTING WAVELET METHOD
6th WSEAS International Conference on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, Dec 29-31, 2007 454 A NEURAL NETWORK BASED IMAGING SYSTEM FOR fmri ANALYSIS IMPLEMENTING
More informationProstate Detection Using Principal Component Analysis
Prostate Detection Using Principal Component Analysis Aamir Virani (avirani@stanford.edu) CS 229 Machine Learning Stanford University 16 December 2005 Introduction During the past two decades, computed
More informationLearning a Manifold as an Atlas Supplementary Material
Learning a Manifold as an Atlas Supplementary Material Nikolaos Pitelis Chris Russell School of EECS, Queen Mary, University of London [nikolaos.pitelis,chrisr,lourdes]@eecs.qmul.ac.uk Lourdes Agapito
More information6. Object Identification L AK S H M O U. E D U
6. Object Identification L AK S H M AN @ O U. E D U Objects Information extracted from spatial grids often need to be associated with objects not just an individual pixel Group of pixels that form a real-world
More informationIterative Methods for Solving Linear Problems
Iterative Methods for Solving Linear Problems When problems become too large (too many data points, too many model parameters), SVD and related approaches become impractical. Iterative Methods for Solving
More informationIterative Signature Algorithm for the Analysis of Large-Scale Gene Expression Data. By S. Bergmann, J. Ihmels, N. Barkai
Iterative Signature Algorithm for the Analysis of Large-Scale Gene Expression Data By S. Bergmann, J. Ihmels, N. Barkai Reasoning Both clustering and Singular Value Decomposition(SVD) are useful tools
More informationCAD SYSTEM FOR AUTOMATIC DETECTION OF BRAIN TUMOR THROUGH MRI BRAIN TUMOR DETECTION USING HPACO CHAPTER V BRAIN TUMOR DETECTION USING HPACO
CHAPTER V BRAIN TUMOR DETECTION USING HPACO 145 CHAPTER 5 DETECTION OF BRAIN TUMOR REGION USING HYBRID PARALLEL ANT COLONY OPTIMIZATION (HPACO) WITH FCM (FUZZY C MEANS) 5.1 PREFACE The Segmentation of
More informationInterferogram Analysis using Active Instance-Based Learning
Interferogram Analysis using Active Instance-Based Learning Olac Fuentes and Thamar Solorio Instituto Nacional de Astrofísica, Óptica y Electrónica Luis Enrique Erro 1 Santa María Tonantzintla, Puebla,
More informationExpectation Maximization!
Expectation Maximization! adapted from: Doug Downey and Bryan Pardo, Northwestern University and http://www.stanford.edu/class/cs276/handouts/lecture17-clustering.ppt Steps in Clustering Select Features
More informationCS 229 Midterm Review
CS 229 Midterm Review Course Staff Fall 2018 11/2/2018 Outline Today: SVMs Kernels Tree Ensembles EM Algorithm / Mixture Models [ Focus on building intuition, less so on solving specific problems. Ask
More informationCluster Analysis. Jia Li Department of Statistics Penn State University. Summer School in Statistics for Astronomers IV June 9-14, 2008
Cluster Analysis Jia Li Department of Statistics Penn State University Summer School in Statistics for Astronomers IV June 9-1, 8 1 Clustering A basic tool in data mining/pattern recognition: Divide a
More informationCamera Registration in a 3D City Model. Min Ding CS294-6 Final Presentation Dec 13, 2006
Camera Registration in a 3D City Model Min Ding CS294-6 Final Presentation Dec 13, 2006 Goal: Reconstruct 3D city model usable for virtual walk- and fly-throughs Virtual reality Urban planning Simulation
More informationCHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES
CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES 6.1 INTRODUCTION The exploration of applications of ANN for image classification has yielded satisfactory results. But, the scope for improving
More informationCHAPTER 6 PERCEPTUAL ORGANIZATION BASED ON TEMPORAL DYNAMICS
CHAPTER 6 PERCEPTUAL ORGANIZATION BASED ON TEMPORAL DYNAMICS This chapter presents a computational model for perceptual organization. A figure-ground segregation network is proposed based on a novel boundary
More informationECLT 5810 Clustering
ECLT 5810 Clustering What is Cluster Analysis? Cluster: a collection of data objects Similar to one another within the same cluster Dissimilar to the objects in other clusters Cluster analysis Grouping
More information