Abstract

Algorithms with Lipschitz bounds such as ISTA and FISTA are useful for solving optimization problems with sparsity-promoting regularizers. However, they can be slow in applications that involve shift-variant system matrices. One example of such an application is MRI with multiple sensitivity coils. We propose a reconstruction algorithm for wavelet regularized SENSE MR image reconstruction that exploits the spatial localization of the wavelet basis and the shift-variant behavior of the MR system matrix to accelerate algorithm convergence. Our results indicate that the proposed method is faster than state-of-the-art variable splitting algorithms in terms of convergence speed for a SENSE-type reconstruction problem even when the variable splitting methods are tuned carefully. Unlike variable splitting methods, the proposed method requires no convergence parameter tuning.

Full Text
Paper version not known

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 call

Disclaimer: 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.