Author/Authors :
Cai, Nian School of Information Engineering - Guangdong University of Technology - Guangzhou, China , Xie, Weisi Shenzhen Key Laboratory for MRI - Shenzhen - Guangdong, China , Su, Zhenghang Shenzhen Key Laboratory for MRI - Shenzhen - Guangdong, China , Wang, Shanshan Shenzhen Key Laboratory for MRI - Shenzhen - Guangdong, China , Liang, Dong Shenzhen Key Laboratory for MRI - Shenzhen - Guangdong, China
Abstract :
Recently, the sparsity which is implicit in MR images has been successfully exploited for fast MR imaging with incomplete
acquisitions. In this paper, two novel algorithms are proposed to solve the sparse parallel MR imaging problem, which consists
of 𝑙1 regularization and fidelity terms. The two algorithms combine forward-backward operator splitting and Barzilai-Borwein
schemes. Theoretically, the presented algorithms overcome the nondifferentiable property in 𝑙1 regularization term. Meanwhile,
they are able to treat a general matrix operator that may not be diagonalized by fast Fourier transform and to ensure that a wellconditioned optimization system of equations is simply solved. In addition, we build connections between the proposed algorithms
and the state-of-the-art existing methods and prove their convergence with a constant stepsize in Appendix. Numerical results and
comparisons with the advanced methods demonstrate the efficiency of proposed algorithms.