Meeting Banner
Abstract #1068

Efficient Constrained Reconstruction of Non-Cartesian Time-Segmented Data with Implicit GROG and Polynomial Preconditioning

Mark Nishimura1, Daniel Abraham1, Xiaozhi Cao1,2, Congyu Liao1,2, John Pauly1, and Kawin Setsompop1,2
1Electrical Engineering, Stanford University, Stanford, CA, United States, 2Radiology, Stanford University, Stanford, CA, United States

Synopsis

Keywords: Image Reconstruction, MR Fingerprinting

Motivation: Fast, regularized subspace reconstruction would enable the acquisition and synthesis of a standard clinical brain protocol in mere minutes.

Goal(s): Our goal is to make high-resolution, image reconstruction faster and more robust to $$$B_0$$$ inhomogeneities.

Approach: Our reconstruction alternates between data consistency (DC) and spatio-temporal low rank regularization. We leverage coil sensitivities to "snap" non-Cartesian trajectories to the kspace grid, speeding up DC steps and enabling $$$B_0$$$-robust reconstructions with fewer time segments. Polynomial preconditioning enables convergence in up to 2x fewer iterations, reducing expensive proximal updates.

Results: Our method reduces the reconstruction time by an order of magnitude while retaining quality.

Impact: The ability to reconstruct MRF quickly should make integration of MRF into clinical workflows not just possible, but convenient. Additionally, the efficiency gains from this framework can make even the most sophisticated and expensive regularizers computationally feasible.

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