Multicompartment magnetic resonance fingerprinting

DOI10.1088/1361-6420/aad1c3zbMath1397.78054arXiv1802.10492OpenAlexW2788986896WikidataQ64113283 ScholiaQ64113283MaRDI QIDQ4582674

Carlos Fernandez-Granda, Martijn Cloos, Sunli Tang, Brett Bernstein, Sylvain Lannuzel, Jakob Assländer, Florian Knoll, Riccardo Lattanzi

Publication date: 24 August 2018

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.10492

zbMATH Keywords

sparse recoverymulticompartment modelsquantitative MRIcoherent dictionariesmagnetic resonance fingerprintingreweighted \(\ell_1\)-norm

Mathematics Subject Classification ID

PDEs in connection with optics and electromagnetic theory (35Q60) Biological applications of optics and electromagnetic theory (78A70) Biomedical imaging and signal processing (92C55) Inverse problems for PDEs (35R30) Optimization problems in optics and electromagnetic theory (78M50)

Related Items

An off-the-grid approach to multi-compartment magnetic resonance fingerprinting, CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction*, Preface to special issue on joint reconstruction and multi-modality/multi-spectral imaging, Greedy approximate projection for magnetic resonance fingerprinting with partial volumes

Uses Software

• PDCO
• glmnet
• CoSaMP
• L1-MAGIC
• TFOCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Iterative hard thresholding for compressed sensing
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• The restricted isometry property and its implications for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Templates for convex cone problems with applications to sparse signal recovery
• The convex geometry of linear inverse problems
• Simultaneous analysis of Lasso and Dantzig selector
• Atomic Decomposition by Basis Pursuit
• Sparse Modeling for Image and Vision Processing
• A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
• Graph Implementations for Nonsmooth Convex Programs
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Sparse representations in unions of bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Super-resolution of point sources via convex programming
• Matching pursuits with time-frequency dictionaries
• Compressed Sensing Off the Grid
• Nonuniform fast fourier transforms using min-max interpolation
• Sparse Bayesian Learning for Basis Selection
• A sparse signal reconstruction perspective for source localization with sensor arrays
• Towards a Mathematical Theory of Super‐resolution
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Signal Recovery by Proximal Forward-Backward Splitting
• Compressed sensing
• The elements of statistical learning. Data mining, inference, and prediction