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.

This abstract and the presentation materials are available to members only; a login is required.

Join Here