TL;DR
This paper introduces a low rank ADMM reconstruction method for MR Fingerprinting that improves accuracy, reduces noise propagation, and decreases computation time by leveraging singular value decomposition and an augmented Lagrangian approach.
Contribution
The study presents a novel low rank ADMM framework for MRF reconstruction that enhances image quality and computational efficiency over existing methods.
Findings
Reduced root mean square error compared to traditional methods
Improved noise robustness and artifact reduction
Faster convergence and lower computational cost
Abstract
Purpose The proposed reconstruction framework addresses the reconstruction accuracy, noise propagation and computation time for Magnetic Resonance Fingerprinting (MRF). Methods Based on a singular value decomposition (SVD) of the signal evolution, MRF is formulated as a low rank inverse problem in which one image is reconstructed for each singular value under consideration. This low rank approximation of the signal evolution reduces the computational burden by reducing the number of Fourier transformations. Also, the low rank approximation improves the conditioning of the problem, which is further improved by extending the low rank inverse problem to an augmented Lagrangian that is solved by the alternating direction method of multipliers (ADMM). The root mean square error and the noise propagation are analyzed in simulations. For verification, in vivo examples are provided.…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
