A fast method based on NESTA to accurately reconstruct CT image from highly undersampled projection measurements.

ABSTRACT

BACKGROUND: The CT image reconstruction algorithm based compressed sensing (CS) can be formulated as an optimization problem that minimizes the total-variation (TV) term constrained by the data fidelity and image nonnegativity. There are a lot of solutions to this problem, but the computational efficiency and reconstructed image quality of these methods still need to be improved. OBJECTIVE: To investigate a faster and more accurate mathematical algorithm to settle TV term minimization problem of CT image reconstruction. METHOD: A Nesterov's algorithm (NESTA) is a fast and accurate algorithm for solving TV minimization problem, which can be ascribed to the use of most notably Nesterov's smoothing technique and a subtle averaging of sequences of iterates, which has been shown to improve the convergence properties of standard gradient-descent algorithms. In order to demonstrate the superior performance of NESTA on computational efficiency and image quality, a comparison with Simultaneous Algebraic Reconstruction Technique-TV (SART-TV) and Split-Bregman (SpBr) algorithm is made using a digital phantom study and two physical phantom studies from highly undersampled projection measurements. RESULTS: With only 25% of conventional full-scan dose and, NESTA method reduces the average CT number error from 51.76HU to 9.98HU on Shepp-Logan phantom and reduces the average CT number error from 50.13HU to 0.32HU on Catphan 600 phantom. On an anthropomorphic head phantom, the average CT number error is reduced from 84.21HU to 1.01HU in the central uniform area. CONCLUSIONS: To the best of our knowledge this is the first work that apply the NESTA method into CT reconstruction based CS. Research shows that this method is of great potential, further studies and optimization are necessary.