1,214 research outputs found

    Tubular Surface Evolution for Segmentation of the Cingulum Bundle From DW-MRI

    Get PDF
    Presented at the 2nd MICCAI Workshop on Mathematical Foundations of Computational Anatomy: Geometrical and Statistical Methods for Biological Shape Variability Modeling, September 6th, 2008, Kimmel Center, New York, USA.This work provides a framework for modeling and extracting the Cingulum Bundle (CB) from Diffusion-Weighted Imagery (DW-MRI) of the brain. The CB is a tube-like structure in the brain that is of potentially of tremendous importance to clinicians since it may be helpful in diagnosing Schizophrenia. This structure consists of a collection of fibers in the brain that have locally similar diffusion patterns, but vary globally. Standard region-based segmentation techniques adapted to DW-MRI are not suitable here because the diffusion pattern of the CB cannot be described by a global set of simple statistics. Active surface models extended to DW-MRI are not suitable since they allow for arbitrary deformations that give rise to unlikely shapes, which do not respect the tubular geometry of the CB. In this work, we explicitly model the CB as a tube-like surface and construct a general class of energies defined on tube-like surfaces. An example energy of our framework is optimized by a tube that encloses a region that has locally similar diffusion patterns, which differ from the diffusion patterns immediately outside. Modeling the CB as a tube-like surface is a natural shape prior. Since a tube is characterized by a center-line and a radius function, the method is reduced to a 4D (center-line plus radius) curve evolution that is computationally much less costly than an arbitrary surface evolution. The method also provides the center-line of CB, which is potentially of clinical significance

    Geodesic tractography segmentation for directional medical image analysis

    Get PDF
    Acknowledgements page removed per author's request, 01/06/2014.Geodesic Tractography Segmentation is the two component approach presented in this thesis for the analysis of imagery in oriented domains, with emphasis on the application to diffusion-weighted magnetic resonance imagery (DW-MRI). The computeraided analysis of DW-MRI data presents a new set of problems and opportunities for the application of mathematical and computer vision techniques. The goal is to develop a set of tools that enable clinicians to better understand DW-MRI data and ultimately shed new light on biological processes. This thesis presents a few techniques and tools which may be used to automatically find and segment major neural fiber bundles from DW-MRI data. For each technique, we provide a brief overview of the advantages and limitations of our approach relative to other available approaches.Ph.D.Committee Chair: Tannenbaum, Allen; Committee Member: Barnes, Christopher F.; Committee Member: Niethammer, Marc; Committee Member: Shamma, Jeff; Committee Member: Vela, Patrici

    Knowledge-Guided Robust MRI Brain Extraction for Diverse Large-Scale Neuroimaging Studies on Humans and Non-Human Primates

    Get PDF
    Accurate and robust brain extraction is a critical step in most neuroimaging analysis pipelines. In particular, for the large-scale multi-site neuroimaging studies involving a significant number of subjects with diverse age and diagnostic groups, accurate and robust extraction of the brain automatically and consistently is highly desirable. In this paper, we introduce population-specific probability maps to guide the brain extraction of diverse subject groups, including both healthy and diseased adult human populations, both developing and aging human populations, as well as non-human primates. Specifically, the proposed method combines an atlas-based approach, for coarse skull-stripping, with a deformable-surface-based approach that is guided by local intensity information and population-specific prior information learned from a set of real brain images for more localized refinement. Comprehensive quantitative evaluations were performed on the diverse large-scale populations of ADNI dataset with over 800 subjects (55 approximately 90 years of age, multi-site, various diagnosis groups), OASIS dataset with over 400 subjects (18 approximately 96 years of age, wide age range, various diagnosis groups), and NIH pediatrics dataset with 150 subjects (5 approximately 18 years of age, multi-site, wide age range as a complementary age group to the adult dataset). The results demonstrate that our method consistently yields the best overall results across almost the entire human life span, with only a single set of parameters. To demonstrate its capability to work on non-human primates, the proposed method is further evaluated using a rhesus macaque dataset with 20 subjects. Quantitative comparisons with popularly used state-of-the-art methods, including BET, Two-pass BET, BET-B, BSE, HWA, ROBEX and AFNI, demonstrate that the proposed method performs favorably with superior performance on all testing datasets, indicating its robustness and effectiveness.published_or_final_versio

    Robust Cardiac Motion Estimation using Ultrafast Ultrasound Data: A Low-Rank-Topology-Preserving Approach

    Get PDF
    Cardiac motion estimation is an important diagnostic tool to detect heart diseases and it has been explored with modalities such as MRI and conventional ultrasound (US) sequences. US cardiac motion estimation still presents challenges because of the complex motion patterns and the presence of noise. In this work, we propose a novel approach to estimate the cardiac motion using ultrafast ultrasound data. -- Our solution is based on a variational formulation characterized by the L2-regularized class. The displacement is represented by a lattice of b-splines and we ensure robustness by applying a maximum likelihood type estimator. While this is an important part of our solution, the main highlight of this paper is to combine a low-rank data representation with topology preservation. Low-rank data representation (achieved by finding the k-dominant singular values of a Casorati Matrix arranged from the data sequence) speeds up the global solution and achieves noise reduction. On the other hand, topology preservation (achieved by monitoring the Jacobian determinant) allows to radically rule out distortions while carefully controlling the size of allowed expansions and contractions. Our variational approach is carried out on a realistic dataset as well as on a simulated one. We demonstrate how our proposed variational solution deals with complex deformations through careful numerical experiments. While maintaining the accuracy of the solution, the low-rank preprocessing is shown to speed up the convergence of the variational problem. Beyond cardiac motion estimation, our approach is promising for the analysis of other organs that experience motion.Comment: 15 pages, 10 figures, Physics in Medicine and Biology, 201

    One-shot Joint Extraction, Registration and Segmentation of Neuroimaging Data

    Full text link
    Brain extraction, registration and segmentation are indispensable preprocessing steps in neuroimaging studies. The aim is to extract the brain from raw imaging scans (i.e., extraction step), align it with a target brain image (i.e., registration step) and label the anatomical brain regions (i.e., segmentation step). Conventional studies typically focus on developing separate methods for the extraction, registration and segmentation tasks in a supervised setting. The performance of these methods is largely contingent on the quantity of training samples and the extent of visual inspections carried out by experts for error correction. Nevertheless, collecting voxel-level labels and performing manual quality control on high-dimensional neuroimages (e.g., 3D MRI) are expensive and time-consuming in many medical studies. In this paper, we study the problem of one-shot joint extraction, registration and segmentation in neuroimaging data, which exploits only one labeled template image (a.k.a. atlas) and a few unlabeled raw images for training. We propose a unified end-to-end framework, called JERS, to jointly optimize the extraction, registration and segmentation tasks, allowing feedback among them. Specifically, we use a group of extraction, registration and segmentation modules to learn the extraction mask, transformation and segmentation mask, where modules are interconnected and mutually reinforced by self-supervision. Empirical results on real-world datasets demonstrate that our proposed method performs exceptionally in the extraction, registration and segmentation tasks. Our code and data can be found at https://github.com/Anonymous4545/JERSComment: Published as a research track paper at KDD 2023. Code: https://github.com/Anonymous4545/JER

    Emerging Techniques in Breast MRI

    Get PDF
    As indicated throughout this chapter, there is a constant effort to move to more sensitive, specific, and quantitative methods for characterizing breast tissue via magnetic resonance imaging (MRI). In the present chapter, we focus on six emerging techniques that seek to quantitatively interrogate the physiological and biochemical properties of the breast. At the physiological scale, we present an overview of ultrafast dynamic contrast-enhanced MRI and magnetic resonance elastography which provide remarkable insights into the vascular and mechanical properties of tissue, respectively. Moving to the biochemical scale, magnetization transfer, chemical exchange saturation transfer, and spectroscopy (both “conventional” and hyperpolarized) methods all provide unique, noninvasive, insights into tumor metabolism. Given the breadth and depth of information that can be obtained in a single MRI session, methods of data synthesis and interpretation must also be developed. Thus, we conclude the chapter with an introduction to two very different, though complementary, methods of data analysis: (1) radiomics and habitat imaging, and (2) mechanism-based mathematical modeling

    Sparse feature learning for image analysis in segmentation, classification, and disease diagnosis.

    Get PDF
    The success of machine learning algorithms generally depends on intermediate data representation, called features that disentangle the hidden factors of variation in data. Moreover, machine learning models are required to be generalized, in order to reduce the specificity or bias toward the training dataset. Unsupervised feature learning is useful in taking advantage of large amount of unlabeled data, which is available to capture these variations. However, learned features are required to capture variational patterns in data space. In this dissertation, unsupervised feature learning with sparsity is investigated for sparse and local feature extraction with application to lung segmentation, interpretable deep models, and Alzheimer\u27s disease classification. Nonnegative Matrix Factorization, Autoencoder and 3D Convolutional Autoencoder are used as architectures or models for unsupervised feature learning. They are investigated along with nonnegativity, sparsity and part-based representation constraints for generalized and transferable feature extraction
    • …
    corecore