On-the-fly Adaptive $k$-Space Sampling for Linear MRI Reconstruction Using Moment-Based Spectral Analysis
Evan Levine, Brian Hargreaves

TL;DR
This paper presents a spectral analysis-based framework for efficiently designing adaptive $k$-space sampling patterns in MRI, reducing noise amplification and enabling on-the-fly optimization without image reconstruction.
Contribution
It introduces a novel spectral moment-based criterion that guides automatic, adaptive sampling pattern design in multidimensional MRI, bypassing costly image-based evaluations.
Findings
Strong correlation with traditional metrics in experiments
Efficient optimization without image reconstruction
Potential for real-time adaptive sampling
Abstract
In high-dimensional magnetic resonance imaging applications, time-consuming, sequential acquisition of data samples in the spatial frequency domain (-space) can often be accelerated by accounting for dependencies along imaging dimensions other than space in linear reconstruction, at the cost of noise amplification that depends on the sampling pattern. Examples are support-constrained, parallel, and dynamic MRI, and -space sampling strategies are primarily driven by image-domain metrics that are expensive to compute for arbitrary sampling patterns. It remains challenging to provide systematic and computationally efficient automatic designs of arbitrary multidimensional Cartesian sampling patterns that mitigate noise amplification, given the subspace to which the object is confined. To address this problem, this work introduces a theoretical framework that describes local geometric…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
