Greedy approximate projection for magnetic resonance fingerprinting with partial volumes
From MaRDI portal
Publication:5220316
DOI10.1088/1361-6420/ab356dzbMath1453.92157arXiv1807.06912OpenAlexW2950259172MaRDI QIDQ5220316
Audrey Repetti, Unnamed Author, Y. Wiaux, Pedro Gómez, Michael E. Davies
Publication date: 16 March 2020
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.06912
Related Items
An off-the-grid approach to multi-compartment magnetic resonance fingerprinting, Quantitative Magnetic Resonance Imaging: From Fingerprinting to Integrated Physics-Based Models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Compressed sensing with coherent and redundant dictionaries
- A block coordinate variable metric forward-backward algorithm
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Atomic Decomposition by Basis Pursuit
- Convergence Rates in Forward--Backward Splitting
- Uncertainty principles and ideal atomic decomposition
- Multicompartment magnetic resonance fingerprinting
- Least squares quantization in PCM
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A Compressed Sensing Framework for Magnetic Resonance Fingerprinting
- Sampling and Reconstructing Signals From a Union of Linear Subspaces
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Signal Recovery by Proximal Forward-Backward Splitting
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
- Convergence of a block coordinate descent method for nondifferentiable minimization
