Fast Data-Driven Learning of MRI Sampling Pattern for Large Scale Problems

• URL: http://arxiv.org/abs/2011.02322v1
• Date: Wed, 4 Nov 2020 14:42:41 GMT
• Title: Fast Data-Driven Learning of MRI Sampling Pattern for Large Scale Problems
• Authors: Marcelo V. W. Zibetti and Gabor T. Herman and Ravinder R. Regatte
• Abstract summary: bias-accelerated subset selection (BASS) is proposed for learning efficacious sampling patterns (SPs) with the purpose of reducing scan time in large-dimensional parallel MRI. BASS was tested with four reconstruction methods for parallel MRI based on low-rankness and sparsity. Results: BASS, with its low computational cost and fast convergence, obtained SPs 100 times faster than the current best greedy approaches.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Purpose: A fast data-driven optimization approach, named bias-accelerated subset selection (BASS), is proposed for learning efficacious sampling patterns (SPs) with the purpose of reducing scan time in large-dimensional parallel MRI. Methods: BASS is applicable when Cartesian fully-sampled k-space data of specific anatomy is available for training and the reconstruction method is specified, learning which k-space points are more relevant for the specific anatomy and reconstruction in recovering the non-sampled points. BASS was tested with four reconstruction methods for parallel MRI based on low-rankness and sparsity that allow a free choice of the SP. Two datasets were tested, one of the brain images for high-resolution imaging and another of knee images for quantitative mapping of the cartilage. Results: BASS, with its low computational cost and fast convergence, obtained SPs 100 times faster than the current best greedy approaches. Reconstruction quality increased up to 45\% with our learned SP over that provided by variable density and Poisson disk SPs, considering the same scan time. Optionally, the scan time can be nearly halved without loss of reconstruction quality. Conclusion: Compared with current approaches, BASS can be used to rapidly learn effective SPs for various reconstruction methods, using larger SP and larger datasets. This enables a better selection of efficacious sampling-reconstruction pairs for specific MRI problems.

Related papers

• Unifying Subsampling Pattern Variations for Compressed Sensing MRI with Neural Operators [72.79532467687427]
  Compressed Sensing MRI reconstructs images of the body's internal anatomy from undersampled and compressed measurements. Deep neural networks have shown great potential for reconstructing high-quality images from highly undersampled measurements. We propose a unified model that is robust to different subsampling patterns and image resolutions in CS-MRI.
  arXiv  Detail & Related papers  (2024-10-05T20:03:57Z)
• 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)
• On Retrospective k-space Subsampling schemes For Deep MRI Reconstruction [2.4934936799100034]
  Non-rectilinear or non-Cartesian trajectories can be implemented in MRI scanners as alternative subsampling options. This work investigates the impact of the $k$-space subsampling scheme on the quality of reconstructed accelerated MRI measurements.
  arXiv  Detail & Related papers  (2023-01-20T00:05:18Z)
• Adaptive Local Neighborhood-based Neural Networks for MR Image Reconstruction from Undersampled Data [7.670270099306413]
  Recent works have shown significant promise for reconstructing MR images from sparsely sampled k-space data using deep learning. In this work, we propose a technique that rapidly estimates deep neural networks directly at reconstruction time by fitting them on small adaptively estimated neighborhoods of a training set. Our results demonstrate that our proposed locally-trained method produces higher-quality reconstructions compared to models trained globally on larger datasets as well as other scan-adaptive methods.
  arXiv  Detail & Related papers  (2022-06-01T21:37:03Z)
• PUERT: Probabilistic Under-sampling and Explicable Reconstruction Network for CS-MRI [47.24613772568027]
  Compressed Sensing MRI aims at reconstructing de-aliased images from sub-Nyquist sampling k-space data to accelerate MR Imaging. We propose a novel end-to-end Probabilistic Under-sampling and Explicable Reconstruction neTwork, dubbed PUERT, to jointly optimize the sampling pattern and the reconstruction network. Experiments on two widely used MRI datasets demonstrate that our proposed PUERT achieves state-of-the-art results in terms of both quantitative metrics and visual quality.
  arXiv  Detail & Related papers  (2022-04-24T04:23:57Z)
• Learning Optimal K-space Acquisition and Reconstruction using Physics-Informed Neural Networks [46.751292014516025]
  Deep neural networks have been applied to reconstruct undersampled k-space data and have shown improved reconstruction performance. This work proposes a novel framework to learn k-space sampling trajectories by considering it as an Ordinary Differential Equation (ODE) problem. Experiments were conducted on different in-viv datasets (textite.g., brain and knee images) acquired with different sequences.
  arXiv  Detail & Related papers  (2022-04-05T20:28:42Z)
• Deep MRI Reconstruction with Radial Subsampling [2.7998963147546148]
  Retrospectively applying a subsampling mask onto the k-space data is a way of simulating the accelerated acquisition of k-space data in real clinical setting. We compare and provide a review for the effect of applying either rectilinear or radial retrospective subsampling on the quality of the reconstructions outputted by trained deep neural networks.
  arXiv  Detail & Related papers  (2021-08-17T17:45:51Z)
• End-to-End Sequential Sampling and Reconstruction for MR Imaging [37.29958197193658]
  We propose a framework that learns a sequential sampling policy simultaneously with a reconstruction strategy. Our proposed method outperforms the current state-of-the-art learned k-space sampling baseline on up to 96.96% of test samples.
  arXiv  Detail & Related papers  (2021-05-13T17:56:18Z)
• Deep Unfolded Recovery of Sub-Nyquist Sampled Ultrasound Image [94.42139459221784]
  We propose a reconstruction method from sub-Nyquist samples in the time and spatial domain, that is based on unfolding the ISTA algorithm. Our method allows reducing the number of array elements, sampling rate, and computational time while ensuring high quality imaging performance.
  arXiv  Detail & Related papers  (2021-03-01T19:19:38Z)
• Unpaired Deep Learning for Accelerated MRI using Optimal Transport Driven CycleGAN [33.68599686848292]
  We propose an unpaired deep learning approach using a optimal transport driven cycle-consistent generative adversarial network (OT-cycleGAN) The proposed OT-cycleGAN architecture is rigorously derived from a dual formulation of the optimal transport formulation using a specially designed penalized least squares cost.
  arXiv  Detail & Related papers  (2020-08-29T12:02:49Z)
• Multifold Acceleration of Diffusion MRI via Slice-Interleaved Diffusion Encoding (SIDE) [50.65891535040752]
  We propose a diffusion encoding scheme, called Slice-Interleaved Diffusion. SIDE, that interleaves each diffusion-weighted (DW) image volume with slices encoded with different diffusion gradients. We also present a method based on deep learning for effective reconstruction of DW images from the highly slice-undersampled data.
  arXiv  Detail & Related papers  (2020-02-25T14:48:17Z)

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.