11 research outputs found
Probabilistic 3D surface reconstruction from sparse MRI information
Surface reconstruction from magnetic resonance (MR) imaging data is
indispensable in medical image analysis and clinical research. A reliable and
effective reconstruction tool should: be fast in prediction of accurate well
localised and high resolution models, evaluate prediction uncertainty, work
with as little input data as possible. Current deep learning state of the art
(SOTA) 3D reconstruction methods, however, often only produce shapes of limited
variability positioned in a canonical position or lack uncertainty evaluation.
In this paper, we present a novel probabilistic deep learning approach for
concurrent 3D surface reconstruction from sparse 2D MR image data and aleatoric
uncertainty prediction. Our method is capable of reconstructing large surface
meshes from three quasi-orthogonal MR imaging slices from limited training sets
whilst modelling the location of each mesh vertex through a Gaussian
distribution. Prior shape information is encoded using a built-in linear
principal component analysis (PCA) model. Extensive experiments on cardiac MR
data show that our probabilistic approach successfully assesses prediction
uncertainty while at the same time qualitatively and quantitatively outperforms
SOTA methods in shape prediction. Compared to SOTA, we are capable of properly
localising and orientating the prediction via the use of a spatially aware
neural network.Comment: MICCAI 202
Bayesian Spatial Binary Regression for Label Fusion in Structural Neuroimaging
Many analyses of neuroimaging data involve studying one or more regions of
interest (ROIs) in a brain image. In order to do so, each ROI must first be
identified. Since every brain is unique, the location, size, and shape of each
ROI varies across subjects. Thus, each ROI in a brain image must either be
manually identified or (semi-) automatically delineated, a task referred to as
segmentation. Automatic segmentation often involves mapping a previously
manually segmented image to a new brain image and propagating the labels to
obtain an estimate of where each ROI is located in the new image. A more recent
approach to this problem is to propagate labels from multiple manually
segmented atlases and combine the results using a process known as label
fusion. To date, most label fusion algorithms either employ voting procedures
or impose prior structure and subsequently find the maximum a posteriori
estimator (i.e., the posterior mode) through optimization. We propose using a
fully Bayesian spatial regression model for label fusion that facilitates
direct incorporation of covariate information while making accessible the
entire posterior distribution. We discuss the implementation of our model via
Markov chain Monte Carlo and illustrate the procedure through both simulation
and application to segmentation of the hippocampus, an anatomical structure
known to be associated with Alzheimer's disease.Comment: 24 pages, 10 figure
Etude d’applications émergentes en HPC et leurs impacts sur des stratégies d’ordonnancement
With the expected convergence between HPC, BigData and AI, newapplications with different profiles are coming to HPC infrastructures.We aim at better understanding the features and needs of theseapplications in order to be able to run them efficiently on HPC platforms.The approach followed is bottom-up: we study thoroughly an emergingapplication, Spatially Localized Atlas Network (SLANT, originating from the neuroscience community) to understand its behavior.Based on these observations, we derive a generic, yet simple, application model (namely, a linear sequence of stochastic jobs). We expect this model to be representative for a large set of upcoming applicationsthat require the computational power of HPC clusters without fitting the typical behavior oflarge-scale traditional applications.In a second step, we show how one can manipulate this generic model in a scheduling framework. Specifically we consider the problem of making reservations (both time andmemory) for an execution on an HPC platform.We derive solutions using the model of the first step of this work.We experimentally show the robustness of the model, even with very few data or with another application, to generate themodel, and provide performance gainsLa convergence entre les domaines du calcul haute-performance, du BigData et de l'intelligence artificiellefait émerger de nouveaux profils d'application sur les infrastructures HPC.Dans ce travail, nous proposons une étude de ces nouvelles applications afin de mieux comprendre leurs caractériques et besoinsdans le but d'optimiser leur exécution sur des plateformes HPC.Pour ce faire, nous adoptons une démarche ascendante. Premièrement, nous étudions en détail une application émergente, SLANT, provenant du domaine des neurosciences. Par un profilage détaillé de l'application, nous exposons ses principales caractéristiques ainsi que ses besoins en terme de ressources de calcul.A partir de ces observations, nous proposons un modèle d'application générique, pour le moment simple, composé d'une séquence linéaire de tâches stochastiques. Ce modèle devrait, selon nous, être adapté à une grande variété de ces applications émergentes qui requièrent la puissance de calcul des clusters HPC sans présenter le comportement typique des applications qui s'exécutent sur des machines à grande-échelle.Deuxièmement, nous montrons comment utiliser le modèle d'application générique dans le cadre du développement de stratégies d'ordonnancement. Plus précisément, nous nous intéressons à la conception de stratégies de réservations (à la fois en terme de temps de calcul et de mémoire).Nous proposons de telles solutions utilisant le modèle d'application générique exprimé dans la première étape de ce travail.Enfin, nous montrons la robustesse du modèle d'application et de nos stratégies d'ordonnancement au travers d'évaluations expérimentales de nos stratégies.Notamment, nous démontrons que nos solutions surpassent les approches standards de la communauté des neurosciences, même en cas de donnéespartielles ou d'extension à d'autres applications que SLANT
Synthesis-Based Harmonization of Multi-Contrast Structural MRI
Magnetic resonance imaging (MRI) is a flexible, noninvasive medical imaging modality that uses magnetic fields and radiofrequency (RF) pulses to produce images. MRI is especially useful in diagnosing and monitoring disorders of the central nervous system such as multiple sclerosis (MS). The flexible design of the MRI system allows for the collection of multiple images with different acquisition parameters in a single scanning session. This flexibility also poses challenges when pooling data collected on multiple scanners or at different sites. Since MRI does not have consistent standards that regulate image acquisition, differences in acquisition lead to variability in images that can cause problems in analysis. This problem sets the stage for harmonization.
This dissertation describes developments in harmonization strategies for structural MRI of the brain. These strategies allow us to create similar harmonized images from varying source images. Harmonized images can then be used in automated analysis pipelines where image variability can cause inconsistent results. In this work, we make a number of contributions to research in harmonization of MRI.
In our first contribution, we acquired a cross-domain dataset to provide training and validation data for our harmonization methods. These data were acquired on two different scanners with different acquisition protocols in a short time frame, providing examples of the same subjects under two different acquisition environments. Since the imaged object is the same between the two, this can be used as training and validation data in harmonization experiments.
In our second contribution, we used this dataset to develop a supervised method of harmonization, called DeepHarmony, which uses state-of-the-art deep learning architecture and training strategies to provide improved image harmonization. This method provides a baseline for image harmonization, but the requirement for cross-domain training data is a major limitation. In our third contribution, we proposed an unsupervised harmonization framework. We used multi-contrast MRI images from the same scanning session to encourage a disentangled latent representation and we demonstrated that this regularization was able to generate disentanglement and allow for harmonization.
In our final contribution, we extended our unsupervised work for a more diverse clinical trial dataset, which included T2-FLAIR and PD-weighted images. In this more complex dataset, we included a new adversarial loss to encourage consistency in the anatomy space and a distribution loss to impose a well-defined distribution on the acquisition space