CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction*
From MaRDI portal
Publication:5210429
DOI10.1088/1361-6420/ab4c9azbMath1485.92061arXiv1810.01967OpenAlexW2979472424MaRDI QIDQ5210429
Y. Wiaux, Zhouye Chen, Mohammad Golbabaee, Michael E. Davies
Publication date: 20 January 2020
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.01967
Related Items
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Iterative hard thresholding for compressed sensing
- Random projections of smooth manifolds
- A simple proof of the restricted isometry property for random matrices
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Multidimensional binary search trees used for associative searching
- Fast Fourier Transforms for Nonequispaced Data
- Multicompartment magnetic resonance fingerprinting
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Inexact Gradient Projection and Fast Data Driven Compressed Sensing
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- A Compressed Sensing Framework for Magnetic Resonance Fingerprinting
- Sampling and Reconstructing Signals From a Union of Linear Subspaces
- Model-Based Compressive Sensing
- Nonuniform fast fourier transforms using min-max interpolation
- Compressive Source Separation: Theory and Methods for Hyperspectral Imaging
- Compressed sensing
- Unnamed Item
- Unnamed Item
