# Scalable Learning-Based Sampling Optimization for Compressive Dynamic MRI

arXiv: https://arxiv.org/abs/1902.00386 · HTML: https://mlsanity.com/paper/1902.00386/

## Key facts

- Cited by 9 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 1 Feb 2019.

## Built on by (most cited first, 9 of 9)

- [Learning-Augmented k-means Clustering](https://mlsanity.com/paper/2110.14094/) (2021)
- [Learning Optimal K-space Acquisition and Reconstruction using Physics-Informed Neural Networks](https://mlsanity.com/paper/2204.02480/) (2022)
- [Alternating Learning Approach for Variational Networks and Undersampling Pattern in Parallel MRI Applications](https://mlsanity.com/paper/2110.14703/) (2021)
- [JoJoNet: Joint-contrast and Joint-sampling-and-reconstruction Network for Multi-contrast MRI](https://mlsanity.com/paper/2210.12548/) (2022)
- [On Sensitivity and Robustness of Normalization Schemes to Input Distribution Shifts in Automatic MR Image Diagnosis](https://mlsanity.com/paper/2306.13276/) (2023)
- [Simultaneous q-Space Sampling Optimization and Reconstruction for Fast and High-fidelity Diffusion Magnetic Resonance Imaging](https://mlsanity.com/paper/2401.01662/) (2024)
- [Optimal OnTheFly Feedback Control of Event Sensors](https://mlsanity.com/paper/2408.12976/) (2024)
- [L2SR: Learning to Sample and Reconstruct for Accelerated MRI via Reinforcement Learning](https://mlsanity.com/paper/2212.02190/) (2022)
- [Prior-aware and Context-guided Group Sampling for Active Probabilistic Subsampling](https://mlsanity.com/paper/2607.07083/) (2026)

## Abstract (arXiv)

Compressed sensing applied to magnetic resonance imaging (MRI) allows to reduce the scanning time by enabling images to be reconstructed from highly undersampled data. In this paper, we tackle the problem of designing a sampling mask for an arbitrary reconstruction method and a limited acquisition budget. Namely, we look for an optimal probability distribution from which a mask with a fixed cardinality is drawn. We demonstrate that this problem admits a compactly supported solution, which leads to a deterministic optimal sampling mask. We then propose a stochastic greedy algorithm that (i) provides an approximate solution to this problem, and (ii) resolves the scaling issues of [1,2]. We validate its performance on in vivo dynamic MRI with retrospective undersampling, showing that our method preserves the performance of [1,2] while reducing the computational burden by a factor close to 200.