MRI Reconstruction via Data Driven Markov Chain with Joint Uncertainty
Estimation
- URL: http://arxiv.org/abs/2202.01479v1
- Date: Thu, 3 Feb 2022 09:13:49 GMT
- Title: MRI Reconstruction via Data Driven Markov Chain with Joint Uncertainty
Estimation
- Authors: Guanxiong Luo, Martin Heide, Martin Uecker
- Abstract summary: We introduce a framework that enables efficient sampling from learned probability distributions for MRI reconstruction.
The data-driven Markov chains are constructed from the generative model learned from a given image database.
The performance of the method is evaluated on an open dataset using 10-fold accelerated acquisition.
- Score: 3.5751623095926806
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: We introduce a framework that enables efficient sampling from learned
probability distributions for MRI reconstruction. Different from conventional
deep learning-based MRI reconstruction techniques, samples are drawn from the
posterior distribution given the measured k-space using the Markov chain Monte
Carlo (MCMC) method. In addition to the maximum a posteriori (MAP) estimate for
the image, which can be obtained with conventional methods, the minimum mean
square error (MMSE) estimate and uncertainty maps can also be computed. The
data-driven Markov chains are constructed from the generative model learned
from a given image database and are independent of the forward operator that is
used to model the k-space measurement. This provides flexibility because the
method can be applied to k-space acquired with different sampling schemes or
receive coils using the same pre-trained models. Furthermore, we use a
framework based on a reverse diffusion process to be able to utilize advanced
generative models. The performance of the method is evaluated on an open
dataset using 10-fold accelerated acquisition.
Related papers
- Posterior Estimation for Dynamic PET imaging using Conditional
Variational Inference [10.206699988915183]
We propose a deep-learning-based framework for efficient posterior estimation.
Specifically, we counteract the information loss in the forward process by introducing latent variables.
arXiv Detail & Related papers (2023-10-24T14:05:30Z) - Optimizing Sampling Patterns for Compressed Sensing MRI with Diffusion
Generative Models [75.52575380824051]
We present a learning method to optimize sub-sampling patterns for compressed sensing multi-coil MRI.
We use a single-step reconstruction based on the posterior mean estimate given by the diffusion model and the MRI measurement process.
Our method requires as few as five training images to learn effective sampling patterns.
arXiv Detail & Related papers (2023-06-05T22:09:06Z) - Stable Deep MRI Reconstruction using Generative Priors [13.400444194036101]
We propose a novel deep neural network based regularizer which is trained in a generative setting on reference magnitude images only.
The results demonstrate competitive performance, on par with state-of-the-art end-to-end deep learning methods.
arXiv Detail & Related papers (2022-10-25T08:34:29Z) - Self-Score: Self-Supervised Learning on Score-Based Models for MRI
Reconstruction [18.264778497591603]
This paper proposes a fully-sampled-data-free score-based diffusion model for MRI reconstruction.
It learns the fully sampled MR image prior in a self-supervised manner on undersampled data.
Experiments on the public dataset show that the proposed method outperforms existing self-supervised MRI reconstruction methods.
arXiv Detail & Related papers (2022-09-02T06:21:42Z) - Reference-based Magnetic Resonance Image Reconstruction Using Texture
Transforme [86.6394254676369]
We propose a novel Texture Transformer Module (TTM) for accelerated MRI reconstruction.
We formulate the under-sampled data and reference data as queries and keys in a transformer.
The proposed TTM can be stacked on prior MRI reconstruction approaches to further improve their performance.
arXiv Detail & Related papers (2021-11-18T03:06:25Z) - Score-based diffusion models for accelerated MRI [35.3148116010546]
We introduce a way to sample data from a conditional distribution given the measurements, such that the model can be readily used for solving inverse problems in imaging.
Our model requires magnitude images only for training, and yet is able to reconstruct complex-valued data, and even extends to parallel imaging.
arXiv Detail & Related papers (2021-10-08T08:42:03Z) - MINIMALIST: Mutual INformatIon Maximization for Amortized Likelihood
Inference from Sampled Trajectories [61.3299263929289]
Simulation-based inference enables learning the parameters of a model even when its likelihood cannot be computed in practice.
One class of methods uses data simulated with different parameters to infer an amortized estimator for the likelihood-to-evidence ratio.
We show that this approach can be formulated in terms of mutual information between model parameters and simulated data.
arXiv Detail & Related papers (2021-06-03T12:59:16Z) - Continual Learning with Fully Probabilistic Models [70.3497683558609]
We present an approach for continual learning based on fully probabilistic (or generative) models of machine learning.
We propose a pseudo-rehearsal approach using a Gaussian Mixture Model (GMM) instance for both generator and classifier functionalities.
We show that GMR achieves state-of-the-art performance on common class-incremental learning problems at very competitive time and memory complexity.
arXiv Detail & Related papers (2021-04-19T12:26:26Z) - Sampling in Combinatorial Spaces with SurVAE Flow Augmented MCMC [83.48593305367523]
Hybrid Monte Carlo is a powerful Markov Chain Monte Carlo method for sampling from complex continuous distributions.
We introduce a new approach based on augmenting Monte Carlo methods with SurVAE Flows to sample from discrete distributions.
We demonstrate the efficacy of our algorithm on a range of examples from statistics, computational physics and machine learning, and observe improvements compared to alternative algorithms.
arXiv Detail & Related papers (2021-02-04T02:21:08Z) - Improved Slice-wise Tumour Detection in Brain MRIs by Computing
Dissimilarities between Latent Representations [68.8204255655161]
Anomaly detection for Magnetic Resonance Images (MRIs) can be solved with unsupervised methods.
We have proposed a slice-wise semi-supervised method for tumour detection based on the computation of a dissimilarity function in the latent space of a Variational AutoEncoder.
We show that by training the models on higher resolution images and by improving the quality of the reconstructions, we obtain results which are comparable with different baselines.
arXiv Detail & Related papers (2020-07-24T14:02:09Z) - Learning Sampling and Model-Based Signal Recovery for Compressed Sensing
MRI [30.838990115880197]
Compressed sensing (CS) MRI relies on adequate undersampling of the k-space to accelerate the acquisition without compromising image quality.
We propose joint learning of both task-adaptive k-space sampling and a subsequent model-based proximal-gradient recovery network.
The proposed combination of a highly flexible sampling model and a model-based (sampling-adaptive) image reconstruction network facilitates exploration and efficient training, yielding improved MR image quality.
arXiv Detail & Related papers (2020-04-22T12:50:03Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.