A Parallel Algorithm for Compressed Sensing Dynamic MRI Reconstruction

In this work we present a novel and very general optimization algorithm customized for dynamic MRI reconstruction under the compressed sensing framework. The size of this kind of problems is usually huge: for this reason is compulsory to design algorithms capable to manage a large amount of data in an efficient way. Our approach exploits the benefits of a parallel nature, it relies on a smart decomposition of the original problem and it also possesses the ability of recognizing the elements that will be zero at the solution, taking thus advantage of the sparse structure of the problem itself.

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.