School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541002, PR China; Center for Applied Mathematics of Guangxi (GUET), Guilin 541002, PR China; Guangxi Colleges and Universities, Key Laboratory of Data Analysis and Computation, Guilin 541002, PR China.
School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541002, PR China.
Magn Reson Imaging. 2024 Dec;114:110249. doi: 10.1016/j.mri.2024.110249. Epub 2024 Oct 5.
Compressed Sensing (CS) is important in the field of image processing and signal processing, and CS-Magnetic Resonance Imaging (MRI) is used to reconstruct image from undersampled k-space data. Total Variation (TV) regularisation is a common technique to improve the sparsity of image, and the Alternating Direction Multiplier Method (ADMM) plays a key role in the variational image processing problem. This paper aims to improve the quality of MRI and shorten the reconstruction time. We consider MRI to solve a linear inverse problem, we convert it into a constrained optimization problem based on TV regularisation, then an accelerated ADMM is established. Through a series of theoretical derivations, we verify that the algorithm satisfies the convergence rate of O1/k under the condition that one objective function is quadratically convex and the other is strongly convex. We select five undersampled templates for testing in MRI experiment and compare it with other algorithms, experimental results show that our proposed method not only improves the running speed but also gives better reconstruction results.
压缩感知(CS)在图像处理和信号处理领域中非常重要,CS-Magnetic Resonance Imaging(CS-MRI)用于从欠采样的 k 空间数据中重建图像。全变差(TV)正则化是一种常用的提高图像稀疏度的技术,交替方向乘子法(ADMM)在变分图像处理问题中起着关键作用。本文旨在提高 MRI 的质量并缩短重建时间。我们将 MRI 视为求解线性反问题,将其转化为基于 TV 正则化的约束优化问题,然后建立加速 ADMM。通过一系列理论推导,我们验证了在一个目标函数二次凸和另一个目标函数强凸的条件下,算法满足 O1/k 的收敛速度。我们选择了五个欠采样模板进行 MRI 实验测试,并与其他算法进行比较,实验结果表明,我们提出的方法不仅提高了运行速度,而且给出了更好的重建结果。