Meeting Banner
Abstract #3565

Cluster-Based Low-Rank Regularization for Cardiac Rosette MR Fingerprinting

Evan Cummings1,2, Gastao Cruz1, Sydney Kaplan1,2, Jacob Richardson1, Jesse Hamilton1,2, and Nicole Seiberlich1,2
1Radiology, University of Michigan, Ann Arbor, MI, United States, 2Biomedical Engineering, University of Michigan, Ann Arbor, MI, United States

Synopsis

Keywords: MR Fingerprinting, MR Fingerprinting, Sparse & Low-Rank Models, Heart, Quantitative Imaging

Motivation: Breathholds limit the amount of data which can be acquired in cardiac MRF, which can impact the precision of fat/water separated T1, T2, and T2* maps.

Goal(s): We developed a regularization method to reconstruct accurate maps from multi-echo cMRF data without introducing blurring into the resulting tissue property maps.

Approach: A k-means cluster-based approach is used to group the signal evolutions during reconstruction and a low-rank constraint is applied to each cluster. We compared our method to existing approaches in 23 healthy volunteers.

Results: This approach can be used to generate accurate myocardial T1, T2, and T2* maps using rosette MRF data.

Impact: Traditional cardiac MRF reconstructions can fail when working with multi-echo rosette MRF data due to insufficient sampling. We developed a reconstruction method which enables T1, T2, and T2* maps to be collected in a single breathhold without compromising accuracy.

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