Learning-Based Compressive MRI
read the original abstract
In the area of magnetic resonance imaging (MRI), an extensive range of non-linear reconstruction algorithms have been proposed that can be used with general Fourier subsampling patterns. However, the design of these subsampling patterns has typically been considered in isolation from the reconstruction rule and the anatomy under consideration. In this paper, we propose a learning-based framework for optimizing MRI subsampling patterns for a specific reconstruction rule and anatomy, considering both the noiseless and noisy settings. Our learning algorithm has access to a representative set of training signals, and searches for a sampling pattern that performs well on average for the signals in this set. We present a novel parameter-free greedy mask selection method, and show it to be effective for a variety of reconstruction rules and performance metrics. Moreover we also support our numerical findings by providing a rigorous justification of our framework via statistical learning theory.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Optimized Multi-Contrast Self-Supervised MRI Reconstruction using Learned k-space Partitioning
A multi-contrast self-supervised MRI reconstruction framework with end-to-end learned k-space partitioning produces higher-fidelity images than single-contrast self-supervised baselines on two public datasets.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.