Brain MRI Segmentation with Multiphase Minimal Partitioning: A Comparative Study

This paper presents the implementation and quantitative evaluation of a multiphase three-dimensional deformable model in a level set framework for automated segmentation of brain MRIs. The segmentation algorithm performs an optimal partitioning of three-dimensional data based on homogeneity measures that naturally evolves to the extraction of different tissue types in the brain. Random seed initialization was used to minimize the sensitivity of the method to initial conditions while avoiding the need for a priori information. This random initialization ensures robustness of the method with respect to the initialization and the minimization set up. Postprocessing corrections with morphological operators were applied to refine the details of the global segmentation method. A clinical study was performed on a database of 10 adult brain MRI volumes to compare the level set segmentation to three other methods: “idealized” intensity thresholding, fuzzy connectedness, and an expectation maximization classification using hidden Markov random fields. Quantitative evaluation of segmentation accuracy was performed with comparison to manual segmentation computing true positive and false positive volume fractions. A statistical comparison of the segmentation methods was performed through a Wilcoxon analysis of these error rates and results showed very high quality and stability of the multiphase three-dimensional level set method

A Variational Model for Object Segmentation Using Boundary Information and Shape Prior Driven by the Mumford-Shah Functional

In this paper, we propose a new variational model to segment an object belonging to a given shape space using the active contour method, a geometric shape prior and the Mumford-Shah functional. The core of our model is an energy functional composed by three complementary terms. The first one is based on a shape model which constrains the active contour to get a shape of interest. The second term detects object boundaries from image gradients. And the third term drives globally the shape prior and the active contour towards a homogeneous intensity region. The segmentation of the object of interest is given by the minimum of our energy functional. This minimum is computed with the calculus of variations and the gradient descent method that provide a system of evolution equations solved with the well-known level set method. We also prove the existence of this minimum in the space of functions with bounded variation. Applications of the proposed model are presented on synthetic and medical image

Image segmentation with variational active contours

An important branch of computer vision is image segmentation. Image segmentation aims at extracting meaningful objects lying in images either by dividing images into contiguous semantic regions, or by extracting one or more specific objects in images such as medical structures. The image segmentation task is in general very difficult to achieve since natural images are diverse, complex and the way we perceive them vary according to individuals. For more than a decade, a promising mathematical framework, based on variational models and partial differential equations, have been investigated to solve the image segmentation problem. This new approach benefits from well-established mathematical theories that allow people to analyze, understand and extend segmentation methods. Moreover, this framework is defined in a continuous setting which makes the proposed models independent with respect to the grid of digital images. This thesis proposes four new image segmentation models based on variational models and the active contours method. The active contours or snakes model is more and more used in image segmentation because it relies on solid mathematical properties and its numerical implementation uses the efficient level set method to track evolving contours. The first model defined in this dissertation proposes to determine global minimizers of the active contour/snake model. Despite of great theoretic properties, the active contours model suffers from the existence of local minima which makes the initial guess critical to get satisfactory results. We propose to couple the geodesic/geometric active contours model with the total variation functional and the Mumford-Shah functional to determine global minimizers of the snake model. It is interesting to notice that the merging of two well-known and "opposite" models of geodesic/geometric active contours, based on the detection of edges, and active contours without edges provides a global minimum to the image segmentation algorithm. The second model introduces a method that combines at the same time deterministic and statistical concepts. We define a non-parametric and non-supervised image classification model based on information theory and the shape gradient method. We show that this new segmentation model generalizes, in a conceptual way, many existing models based on active contours, statistical and information theoretic concepts such as mutual information. The third model defined in this thesis is a variational model that extracts in images objects of interest which geometric shape is given by the principal components analysis. The main interest of the proposed model is to combine the three families of active contours, based on the detection of edges, the segmentation of homogeneous regions and the integration of geometric shape prior, in order to use simultaneously the advantages of each family. Finally, the last model presents a generalization of the active contours model in scale spaces in order to extract structures at different scales of observation. The mathematical framework which allows us to define an evolution equation for active contours in scale spaces comes from string theory. This theory introduces a mathematical setting to process a manifold such as an active contour embedded in higher dimensional Riemannian spaces such as scale spaces. We thus define the energy functional and the evolution equation of the multiscale active contours model which can evolve in the most well-known scale spaces such as the linear or the curvature scale space

Detection of multiple innervation zones from multi-channel surface EMG recordings with low signal-to-noise ratio using graph-cut segmentation

Knowledge of the location of muscle Innervation Zones (IZs) is important in many applications, e.g. for minimizing the quantity of injected botulinum toxin for the treatment of spasticity or for deciding on the type of episiotomy during child delivery. Surface EMG (sEMG) can be noninvasively recorded to assess physiological and morphological characteristics of contracting muscles. However, it is not often possible to record signals of high quality. Moreover, muscles could have multiple IZs, which should all be identified. We designed a fully-automatic algorithm based on the enhanced image Graph-Cut segmentation and morphological image processing methods to identify up to five IZs in 60-ms intervals of very-low to moderate quality sEMG signal detected with multi-channel electrodes (20 bipolar channels with Inter Electrode Distance (IED) of 5 mm). An anisotropic multilayered cylinder model was used to simulate 750 sEMG signals with signal-to-noise ratio ranging from -5 to 15 dB (using Gaussian noise) and in each 60-ms signal frame, 1 to 5 IZs were included. The micro- and macro- averaged performance indices were then reported for the proposed IZ detection algorithm. In the micro-averaging procedure, the number of True Positives, False Positives and False Negatives in each frame were summed up to generate cumulative measures. In the macro-averaging, on the other hand, precision and recall were calculated for each frame and their averages are used to determine F1-score. Overall, the micro (macro)-averaged sensitivity, precision and F1-score of the algorithm for IZ channel identification were 82.7% (87.5%), 92.9% (94.0%) and 87.5% (90.6%), respectively. For the correctly identified IZ locations, the average bias error was of 0.02±0.10 IED ratio. Also, the average absolute conduction velocity estimation error was 0.41±0.40 m/s for such frames. The sensitivity analysis including increasing IED and reducing interpolation coefficient for time samples was performed. Meanwhile, the effect of adding power-line interference and using other image interpolation methods on the deterioration of the performance of the proposed algorithm was investigated. The average running time of the proposed algorithm on each 60-ms sEMG frame was 25.5±8.9 (s) on an Intel dual-core 1.83 GHz CPU with 2 GB of RAM. The proposed algorithm correctly and precisely identified multiple IZs in each signal epoch in a wide range of signal quality and is thus a promising new offline tool for electrophysiological studies.The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the Seventh Framework Programme of the European Union (FP7/2007-2013) under REA grant agreement no. 600388 (TECNIOspring programme), from the Agency for Business Competitiveness of the Government of Catalonia, ACCIÓ, and from Spanish Ministry of Economy and Competitiveness- Spain (project DPI2014-59049-R).Peer ReviewedPostprint (published version