Medial-based deformable models in nonconvex shape-spaces for medical image segmentation

A Survey on Computer-Aided Diagnosis of Brain Disorders through MRI Based on Machine Learning and Data Mining Methodologies with an Emphasis on Alzheimer Disease Diagnosis and the Contribution of the Multimodal Fusion

Computer-aided diagnostic (CAD) systems use machine learning methods that provide a synergistic effect between the neuroradiologist and the computer, enabling an efficient and rapid diagnosis of the patient’s condition. As part of the early diagnosis of Alzheimer’s disease (AD), which is a major public health problem, the CAD system provides a neuropsychological assessment that helps mitigate its effects. The use of data fusion techniques by CAD systems has proven to be useful, they allow for the merging of information relating to the brain and its tissues from MRI, with that of other types of modalities. This multimodal fusion refines the quality of brain images by reducing redundancy and randomness, which contributes to improving the clinical reliability of the diagnosis compared to the use of a single modality. The purpose of this article is first to determine the main steps of the CAD system for brain magnetic resonance imaging (MRI). Then to bring together some research work related to the diagnosis of brain disorders, emphasizing AD. Thus the most used methods in the stages of classification and brain regions segmentation are described, highlighting their advantages and disadvantages. Secondly, on the basis of the raised problem, we propose a solution within the framework of multimodal fusion. In this context, based on quantitative measurement parameters, a performance study of multimodal CAD systems is proposed by comparing their effectiveness with those exploiting a single MRI modality. In this case, advances in information fusion techniques in medical imagery are accentuated, highlighting their advantages and disadvantages. The contribution of multimodal fusion and the interest of hybrid models are finally addressed, as well as the main scientific assertions made, in the field of brain disease diagnosis.

Computational methods for corpus callosum segmentation on MRI: A systematic literature review

BACKGROUND AND OBJECTIVE

The corpus callosum (CC) is the largest white matter structure in the brain and has a significant role in central nervous system diseases. Its volume correlates with the severity and/or extent of neurodegenerative disease. Even though the CC's role has been extensively studied over the last decades, and different algorithms and methods have been published regarding CC segmentation and parcellation, no reviews or surveys covering such developments have been reported so far. To bridge this gap, this paper presents a systematic literature review of computational methods focusing on CC segmentation and parcellation acquired on magnetic resonance imaging.

METHODS

IEEExplore, PubMed, EBSCO Host, and Scopus database were searched with the following search terms: ((Segmentation OR Parcellation) AND (Corpus Callosum) AND (DTI OR MRI OR Diffusion Tensor Imag* OR Diffusion Tractography OR Magnetic Resonance Imag*)), resulting in 802 publications. Two reviewers independently evaluated all articles and 36 studies were selected through the systematic literature review process.

RESULTS

This work reviewed four main segmentation methods groups: model-based, region-based, thresholding, and machine learning; 32 different validity metrics were reported. Even though model-based techniques are the most recurrently used for the segmentation task (13 articles), machine learning approaches achieved better outcomes of 95% when analyzing mean values for segmentation and classification metrics results. Moreover, CC segmentation is better established in T₁-weighted images, having more methods implemented and also being tested in larger datasets, compared with diffusion tensor images.

CONCLUSIONS

The analyzed computational methods used to perform CC segmentation on magnetic resonance imaging have not yet overcome all presented challenges owing to metrics variability and lack of traceable materials.

Energy minimization in medical image analysis: Methodologies and applications

Energy minimization is of particular interest in medical image analysis. In the past two decades, a variety of optimization schemes have been developed. In this paper, we present a comprehensive survey of the state-of-the-art optimization approaches. These algorithms are mainly classified into two categories: continuous method and discrete method. The former includes Newton-Raphson method, gradient descent method, conjugate gradient method, proximal gradient method, coordinate descent method, and genetic algorithm-based method, while the latter covers graph cuts method, belief propagation method, tree-reweighted message passing method, linear programming method, maximum margin learning method, simulated annealing method, and iterated conditional modes method. We also discuss the minimal surface method, primal-dual method, and the multi-objective optimization method. In addition, we review several comparative studies that evaluate the performance of different minimization techniques in terms of accuracy, efficiency, or complexity. These optimization techniques are widely used in many medical applications, for example, image segmentation, registration, reconstruction, motion tracking, and compressed sensing. We thus give an overview on those applications as well.

Research on a pulmonary nodule segmentation method combining fast self-adaptive FCM and classification

The key problem of computer-aided diagnosis (CAD) of lung cancer is to segment pathologically changed tissues fast and accurately. As pulmonary nodules are potential manifestation of lung cancer, we propose a fast and self-adaptive pulmonary nodules segmentation method based on a combination of FCM clustering and classification learning. The enhanced spatial function considers contributions to fuzzy membership from both the grayscale similarity between central pixels and single neighboring pixels and the spatial similarity between central pixels and neighborhood and improves effectively the convergence rate and self-adaptivity of the algorithm. Experimental results show that the proposed method can achieve more accurate segmentation of vascular adhesion, pleural adhesion, and ground glass opacity (GGO) pulmonary nodules than other typical algorithms.

Local optimization based segmentation of spatially-recurring, multi-region objects with part configuration constraints

Incorporating prior knowledge into image segmentation algorithms has proven useful for obtaining more accurate and plausible results. Two important constraints, containment and exclusion of regions, have gained attention in recent years mainly due to their descriptive power. In this paper, we augment the level set framework with the ability to handle these two intuitive geometric relationships, containment and exclusion, along with a distance constraint between boundaries of multi-region objects. Level set's important property of automatically handling topological changes of evolving contours/surfaces enables us to segment spatially-recurring objects (e.g., multiple instances of multi-region cells in a large microscopy image) while satisfying the two aforementioned constraints. In addition, the level set approach gives us a very simple and natural way to compute the distance between contours/surfaces and impose constraints on it. The downside, however, is a local optimization framework in which the final segmentation solution depends on the initialization. In fact, here, we sacrifice the optimizability (local instead of global solution) in exchange for lower space complexity (less memory usage) and faster runtime (especially for large microscopic images) as well as no grid artifacts. Nevertheless, the result from validating our method on several biomedical applications showed the utility and advantages of this augmented level set framework (even with rough initialization that is distant from the desired boundaries). We also compared our framework with its counterpart methods in the discrete domain and reported the pros and cons of each of these methods in terms of metrication error and efficiency in memory usage and runtime.

An effective method for segmentation of MR brain images using the ant colony optimization algorithm

Since segmentation of magnetic resonance images is one of the most important initial steps in brain magnetic resonance image processing, success in this part has a great influence on the quality of outcomes of subsequent steps. In the past few decades, numerous methods have been introduced for classification of such images, but typically they perform well only on a specific subset of images, do not generalize well to other image sets, and have poor computational performance. In this study, we provided a method for segmentation of magnetic resonance images of the brain that despite its simplicity has a high accuracy. We compare the performance of our proposed algorithm with similar evolutionary algorithms on a pixel-by-pixel basis. Our algorithm is tested across varying sets of magnetic resonance images and demonstrates high speed and accuracy. It should be noted that in initial steps, the algorithm is computationally intensive requiring a large number of calculations; however, in subsequent steps of the search process, the number is reduced with the segmentation focused only in the target area.

An efficient optimization framework for multi-region segmentation based on Lagrangian duality

We introduce a multi-region model for simultaneous segmentation of medical images. In contrast to many other models, geometric constraints such as inclusion and exclusion between the regions are enforced, which makes it possible to correctly segment different regions even if the intensity distributions are identical. We efficiently optimize the model using a combination of graph cuts and Lagrangian duality which is faster and more memory efficient than current state of the art. As the method is based on global optimization techniques, the resulting segmentations are independent of initialization. We apply our framework to the segmentation of the left and right ventricles, myocardium and the left ventricular papillary muscles in magnetic resonance imaging and to lung segmentation in full-body X-ray computed tomography. We evaluate our approach on a publicly available benchmark with competitive results.

Automated detection, 3D segmentation and analysis of high resolution spine MR images using statistical shape models

Recent advances in high resolution magnetic resonance (MR) imaging of the spine provide a basis for the automated assessment of intervertebral disc (IVD) and vertebral body (VB) anatomy. High resolution three-dimensional (3D) morphological information contained in these images may be useful for early detection and monitoring of common spine disorders, such as disc degeneration. This work proposes an automated approach to extract the 3D segmentations of lumbar and thoracic IVDs and VBs from MR images using statistical shape analysis and registration of grey level intensity profiles. The algorithm was validated on a dataset of volumetric scans of the thoracolumbar spine of asymptomatic volunteers obtained on a 3T scanner using the relatively new 3D T2-weighted SPACE pulse sequence. Manual segmentations and expert radiological findings of early signs of disc degeneration were used in the validation. There was good agreement between manual and automated segmentation of the IVD and VB volumes with the mean Dice scores of 0.89 ± 0.04 and 0.91 ± 0.02 and mean absolute surface distances of 0.55 ± 0.18 mm and 0.67 ± 0.17 mm respectively. The method compares favourably to existing 3D MR segmentation techniques for VBs. This is the first time IVDs have been automatically segmented from 3D volumetric scans and shape parameters obtained were used in preliminary analyses to accurately classify (100% sensitivity, 98.3% specificity) disc abnormalities associated with early degenerative changes.