Abstract
The low-rank plus sparse (L+S) decomposition model enables the reconstruction of undersampled dynamic magnetic resonance imaging (MRI) data. Solving for the L and S components is anonsmooth composite convex minimization problem. While current techniques for this model are based on the classical iterative soft thresholding algorithm (ISTA), accelerated methods can be applied to obtain faster rate of convergence of the algorithm. This paper proposes two alternative methods for solving the L+S problem, one based on the fast iterative shrinkage-thresholding algorithm (FISTA), and the other based on the recent proximal optimized gradient method (POGM). Numerical results suggest faster convergence than the traditional ISTA, while preserving its computational simplicity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
