Meeting Banner
Abstract #3457

Comparison of fixed vs. low rank reconstruction methods for acceleration of quantitative T2 mapping

Daniel Grzeda1, Meirav Galun2, Noam Omer1, Tamar Blumenfeld-Katzir1, Dvir Radunsky1, Ricardo Otazo3, and Noam Ben-Eliezer1,4,5
1Department of Biomedical Engineering, Tel Aviv University, Tel Aviv, Israel, 2Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel, 3Departments of Medical Physics and Radiology, Memorial Sloan Kettering Cancer Center, New York, NY, United States, 4Center for Advanced Imaging Innovation and Research (CAI2R), New-York University Langone Medical Center, New York, New York, NY, United States, 5Sagol School of Neuroscience, Tel-Aviv University, Tel Aviv, Israel

Quantification of T2 values is valuable for a wide range of research and clinical applications. Multi-echo spin echo protocols allow mapping T2 values, yet, at the cost of strong contamination from stimulated echoes. The echo-modulation-curve algorithm can efficiently overcome these limitations to produce accurate T2 values. Still, integration into clinical routine requires further acceleration in scan time. In this work we present a fixed-rank and sparse algorithm (SPARK) for accelerating the acquisition of T2 values, and compare it against standard L+S and GRAPPA. SPARK was found to improve robustness to reconstruction parameters, and achieve superior accuracy at high acceleration factors.

How to access this content:

For one year after publication, abstracts and videos are only open to registrants of this annual meeting. Registrants should use their existing login information. Non-registrant access can be purchased via the ISMRM E-Library.

After one year, current ISMRM & ISMRT members get free access to both the abstracts and videos. Non-members and non-registrants must purchase access via the ISMRM E-Library.

After two years, the meeting proceedings (abstracts) are opened to the public and require no login information. Videos remain behind password for access by members, registrants and E-Library customers.

Click here for more information on becoming a member.

Keywords