Sampling possible reconstructions of undersampled acquisitions in MR imaging

• URL: http://arxiv.org/abs/2010.00042v3
• Date: Wed, 9 Feb 2022 10:10:22 GMT
• Title: Sampling possible reconstructions of undersampled acquisitions in MR imaging
• Authors: Kerem C. Tezcan, Neerav Karani, Christian F. Baumgartner, Ender Konukoglu
• Abstract summary: Undersampling the k-space during MR saves time, however results in an ill-posed inversion problem, leading to an infinite set of images as possible solutions. Traditionally, this is tackled as a reconstruction problem by searching for a single "best" image out of this solution set according to some chosen regularization or prior. We propose a method that instead returns multiple images which are possible under the acquisition model and the chosen prior to capture the uncertainty in the inversion process.
• Score: 9.75702493778194
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Undersampling the k-space during MR acquisitions saves time, however results in an ill-posed inversion problem, leading to an infinite set of images as possible solutions. Traditionally, this is tackled as a reconstruction problem by searching for a single "best" image out of this solution set according to some chosen regularization or prior. This approach, however, misses the possibility of other solutions and hence ignores the uncertainty in the inversion process. In this paper, we propose a method that instead returns multiple images which are possible under the acquisition model and the chosen prior to capture the uncertainty in the inversion process. To this end, we introduce a low dimensional latent space and model the posterior distribution of the latent vectors given the acquisition data in k-space, from which we can sample in the latent space and obtain the corresponding images. We use a variational autoencoder for the latent model and the Metropolis adjusted Langevin algorithm for the sampling. We evaluate our method on two datasets; with images from the Human Connectome Project and in-house measured multi-coil images. We compare to five alternative methods. Results indicate that the proposed method produces images that match the measured k-space data better than the alternatives, while showing realistic structural variability. Furthermore, in contrast to the compared methods, the proposed method yields higher uncertainty in the undersampled phase encoding direction, as expected. Keywords: Magnetic Resonance image reconstruction, uncertainty estimation, inverse problems, sampling, MCMC, deep learning, unsupervised learning.

Related papers

• Total Uncertainty Quantification in Inverse PDE Solutions Obtained with Reduced-Order Deep Learning Surrogate Models [50.90868087591973]
  We propose an approximate Bayesian method for quantifying the total uncertainty in inverse PDE solutions obtained with machine learning surrogate models. We test the proposed framework by comparing it with the iterative ensemble smoother and deep ensembling methods for a non-linear diffusion equation.
  arXiv  Detail & Related papers  (2024-08-20T19:06:02Z)
• MOSAIC: Masked Optimisation with Selective Attention for Image Reconstruction [0.5541644538483947]
  We propose a novel compressive sensing framework to reconstruct images given any random selection of measurements. MOSAIC incorporates an embedding technique to efficiently apply attention mechanisms on an encoded sequence of measurements. A range of experiments validate our proposed architecture as a promising alternative for existing CS reconstruction methods.
  arXiv  Detail & Related papers  (2023-06-01T17:05:02Z)
• A Variational Perspective on Solving Inverse Problems with Diffusion Models [101.831766524264]
  Inverse tasks can be formulated as inferring a posterior distribution over data. This is however challenging in diffusion models since the nonlinear and iterative nature of the diffusion process renders the posterior intractable. We propose a variational approach that by design seeks to approximate the true posterior distribution.
  arXiv  Detail & Related papers  (2023-05-07T23:00:47Z)
• Improving Diffusion Models for Inverse Problems using Manifold Constraints [55.91148172752894]
  We show that current solvers throw the sample path off the data manifold, and hence the error accumulates. To address this, we propose an additional correction term inspired by the manifold constraint. We show that our method is superior to the previous methods both theoretically and empirically.
  arXiv  Detail & Related papers  (2022-06-02T09:06:10Z)
• Mining the manifolds of deep generative models for multiple data-consistent solutions of ill-posed tomographic imaging problems [10.115302976900445]
  Tomographic imaging is in general an ill-posed inverse problem. We propose a new empirical sampling method that computes multiple solutions of a tomographic inverse problem.
  arXiv  Detail & Related papers  (2022-02-10T20:27:31Z)
• Denoising Diffusion Restoration Models [110.1244240726802]
  Denoising Diffusion Restoration Models (DDRM) is an efficient, unsupervised posterior sampling method. We demonstrate DDRM's versatility on several image datasets for super-resolution, deblurring, inpainting, and colorization.
  arXiv  Detail & Related papers  (2022-01-27T20:19:07Z)
• Deblurring via Stochastic Refinement [85.42730934561101]
  We present an alternative framework for blind deblurring based on conditional diffusion models. Our method is competitive in terms of distortion metrics such as PSNR.
  arXiv  Detail & Related papers  (2021-12-05T04:36:09Z)
• Fast Scalable Image Restoration using Total Variation Priors and Expectation Propagation [7.7731951589289565]
  This paper presents a scalable approximate Bayesian method for image restoration using total variation (TV) priors. We use the expectation propagation (EP) framework to approximate minimum mean squared error (MMSE) estimators and marginal (pixel-wise) variances.
  arXiv  Detail & Related papers  (2021-10-04T17:28:41Z)
• Non-Iterative Phase Retrieval With Cascaded Neural Networks [0.966840768820136]
  We present a deep neural network cascade that reconstructs an image successively on different resolutions from its non-oversampled Fourier magnitude. We evaluate our method on four different datasets.
  arXiv  Detail & Related papers  (2021-06-18T15:52:12Z)
• 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)
• Distributed optimization for nonrigid nano-tomography [0.40631409309544836]
  We propose a joint solver for imaging samples at the nanoscale with projection alignment, unwarping and regularization. Projection data consistency is regulated by dense optical flow estimated by Farneback's algorithm, leading to sharp sample reconstructions with less artifacts.
  arXiv  Detail & Related papers  (2020-07-11T19:22:43Z)

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.