Cai Nian, Xie Weisi, Su Zhenghang, Wang Shanshan, Liang Dong
School of Information Engineering, Guangdong University of Technology, Guangzhou 510006, China.
Paul C. Lauterbur Research Centre for Biomedical Imaging, Shenzhen Institutes of Advanced Technology, Shenzhen, China; Shenzhen Key Laboratory for MRI, Shenzhen, Guangdong, China.
Comput Math Methods Med. 2016;2016:1724630. doi: 10.1155/2016/1724630. Epub 2016 Sep 25.
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 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 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 well-conditioned 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.
最近,磁共振(MR)图像中隐含的稀疏性已成功应用于不完全采集的快速MR成像。本文提出了两种新颖的算法来解决稀疏并行MR成像问题,该问题由正则化项和保真项组成。这两种算法结合了前向-后向算子分裂和Barzilai-Borwein方法。从理论上讲,所提出的算法克服了正则化项中的不可微特性。同时,它们能够处理一般的矩阵算子,该算子可能无法通过快速傅里叶变换进行对角化,并确保简单地求解一个良态的优化方程组。此外,我们在提出的算法与现有先进方法之间建立了联系,并在附录中证明了它们在恒定步长下的收敛性。数值结果以及与先进方法的比较证明了所提出算法的有效性。