Zhang Hanming, Wang Linyuan, Yan Bin, Li Lei, Cai Ailong, Hu Guoen
National Digital Switching System Engineering and Technological Research Center, Zhengzhou, 450002, China.
PLoS One. 2016 Feb 22;11(2):e0149899. doi: 10.1371/journal.pone.0149899. eCollection 2016.
Total generalized variation (TGV)-based computed tomography (CT) image reconstruction, which utilizes high-order image derivatives, is superior to total variation-based methods in terms of the preservation of edge information and the suppression of unfavorable staircase effects. However, conventional TGV regularization employs l1-based form, which is not the most direct method for maximizing sparsity prior. In this study, we propose a total generalized p-variation (TGpV) regularization model to improve the sparsity exploitation of TGV and offer efficient solutions to few-view CT image reconstruction problems. To solve the nonconvex optimization problem of the TGpV minimization model, we then present an efficient iterative algorithm based on the alternating minimization of augmented Lagrangian function. All of the resulting subproblems decoupled by variable splitting admit explicit solutions by applying alternating minimization method and generalized p-shrinkage mapping. In addition, approximate solutions that can be easily performed and quickly calculated through fast Fourier transform are derived using the proximal point method to reduce the cost of inner subproblems. The accuracy and efficiency of the simulated and real data are qualitatively and quantitatively evaluated to validate the efficiency and feasibility of the proposed method. Overall, the proposed method exhibits reasonable performance and outperforms the original TGV-based method when applied to few-view problems.
基于全广义变分(TGV)的计算机断层扫描(CT)图像重建利用高阶图像导数,在边缘信息保留和不良阶梯效应抑制方面优于基于总变分的方法。然而,传统的TGV正则化采用基于l1的形式,这不是最大化稀疏先验的最直接方法。在本研究中,我们提出了一种全广义p-变分(TGpV)正则化模型,以提高TGV的稀疏性利用,并为少视图CT图像重建问题提供有效的解决方案。为了解决TGpV最小化模型的非凸优化问题,我们随后提出了一种基于增广拉格朗日函数交替最小化的高效迭代算法。通过变量分裂解耦的所有子问题通过应用交替最小化方法和广义p-收缩映射允许显式解。此外,使用近端点法导出了可以通过快速傅里叶变换轻松执行和快速计算的近似解,以降低内部子问题的成本。对模拟数据和真实数据的准确性和效率进行了定性和定量评估,以验证所提方法的有效性和可行性。总体而言,所提方法表现出合理的性能,并且在应用于少视图问题时优于原始的基于TGV的方法。