Accelerated barrier optimization compressed sensing (ABOCS) reconstruction for cone-beam CT: phantom studies.

Purpose: Recent advances in compressed sensing (CS) enable accurate CT image reconstruction from highly undersampled and noisy projection measurements, due to the sparsifiable feature of most CT images using total variation (TV). These novel reconstruction methods have demonstrated advantages in clinical applications where radiation dose reduction is critical, such as onboard cone-beam CT (CBCT) imaging in radiation therapy. The image reconstruction using CS is formulated as either a constrained problem to minimize the TV objective within a small and fixed data fidelity error, or an unconstrained problem to minimize the data fidelity error with TV regularization. However, the conventional solutions to the above two formulations are either computationally inefficient or involved with inconsistent regularization parameter tuning, which significantly limit the clinical use of CS-based iterative reconstruction. In this paper, we propose an optimization algorithm for CS reconstruction which overcomes the above two drawbacks. Methods: The data fidelity tolerance of CS reconstruction can be well estimated based on the measured data, as most of the projection errors are from Poisson noise after effective data correction for scatter and beam-hardening effects. We therefore adopt the TV optimization framework with a data fidelity constraint. To accelerate the convergence, we first convert such a constrained optimization using a logarithmic barrier method into a form similar to that of the conventional TV regularization based reconstruction but with an automatically adjusted penalty weight. The problem is then solved efficiently by gradient projection with an adaptive Barzilai–Borwein step-size selection scheme. The proposed algorithm is referred to as accelerated barrier optimization for CS (ABOCS), and evaluated using both digital and physical phantom studies. Results: ABOCS directly estimates the data fidelity tolerance from the raw projection data. Therefore, as demonstrated in both digital Shepp–Logan and physical head phantom studies, consistent reconstruction performances are achieved using the same algorithm parameters on scans with different noise levels and/or on different objects. On the contrary, the penalty weight in a TV regularization based method needs to be fine-tuned in a large range (up to seven times) to maintain the reconstructed image quality. The improvement of ABOCS on computational efficiency is demonstrated in the comparisons with adaptive-steepest-descent-projection-onto-convex-sets (ASD-POCS), an existing CS reconstruction algorithm also using constrained optimization. ASD-POCS alternatively minimizes the TV objective using adaptive steepest descent (ASD) and the data fidelity error using projection onto convex sets (POCS). For similar image qualities of the Shepp–Logan phantom, ABOCS requires less computation time than ASD-POCS in MATLAB by more than one order of magnitude. Conclusions: We propose ABOCS for CBCT reconstruction. As compared to other published CS-based algorithms, our method has attractive features of fast convergence and consistent parameter settings for different datasets. These advantages have been demonstrated on phantom studies.