Greedy approximate projection for magnetic resonance fingerprinting with partial volumes

• Published in: Inverse problems 2020-03, Vol.36 (3), p.35015
• Main Authors: Duarte, Roberto, Repetti, Audrey, Gómez, Pedro A, Davies, Mike, Wiaux, Yves
• Format: Article
• Language: English
• Subjects: magnetic resonance fingerprinting; MRI; non-convex optimisation; partial volume
• ISSN: 0266-5611; 1361-6420
• DOI: 10.1088/1361-6420/ab356d

In quantitative magnetic resonance imaging, traditional methods suffer from the so-called partial volume effect (PVE) due to spatial resolution limitations. As a consequence of PVE, the parameters of the voxels containing more than one tissue are not correctly estimated. Magnetic resonance fingerprinting (MRF) is not an exception. The existing methods addressing PVE are neither scalable nor accurate. We propose to formulate the recovery of multiple tissues per voxel as a non-convex constrained least-squares minimisation problem. To solve this problem, we develop a memory efficient, greedy approximate projected gradient descent algorithm, dubbed GAP-MRF. Our method adaptively finds the regions of interest on the manifold of fingerprints defined by the MRF sequence. We generalise our method to compensate for phase errors appearing in the model, using an alternating minimisation approach. We show, through simulations on synthetic data with PVE, that our algorithm outperforms state-of-the-art methods in reconstruction quality. Our approach is validated on the EUROSPIN phantom and on in vivo datasets.