Meeting Banner
Abstract #0819

Attention mechanisms for sharing low-rank, image and k-space information during MR image reconstruction

Siying Xu1, Kerstin Hammernik2,3, Patrick Krumm1, Sergios Gatidis1,4, and Thomas Küstner1
1Medical Image and Data Analysis (MIDAS.lab), Department of Diagnostic and Interventional Radiology, University Hospital of Tuebingen, Tuebingen, Germany, 2Lab for AI in Medcine, Technical University of Munich, Munich, Germany, 3Department of Computing, Imperial College London, London, United Kingdom, 4Max Planck Institute for Intelligent Systems, Tuebingen, Germany

Synopsis

Keywords: Image Reconstruction, Machine Learning/Artificial Intelligence, Image Reconstruction, HeartCardiac CINE MR imaging requires long acquisitions under multiple breath-holds. With the development of deep learning-based reconstruction methods, the acceleration rate and reconstructed image quality have been increased. However, existing methods face several shortcomings, such as limited information-sharing across domains and generalizability which may restrict their clinical adoption. To address these issues, we propose A-LIKNet which incorporates attention mechanisms and maximizes information sharing between low-rank, image, and k-space in an interleaved architecture. Results indicate that the proposed A-LIKNet outperforms other methods for up to 24x accelerated acquisitions within a single breath-hold.

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