Share Email Print
cover

Proceedings Paper

Fast ordered subsets Chambolle-Pock algorithm for CT reconstruction
Author(s): Xiaojuan Deng; Wenbin Xu; Hongwei Li
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The Chambolle-Pock (CP) algorithm has been successfully applied for solving optimization problems involving various data fidelity and regularization terms. However, when applied to CT image reconstruction, its efficiency is still far from being satisfactory. Another problem is that unmatched forward and backward operators are commonly used for CT reconstruction, in which case, the CP algorithm might fail to converge well. In this paper, based on a operator-splitting perspective of the simultaneous algebraic reconstruction technique (SART), the CP algorithm is generalized to incorporate the ordered subsets technique for fast convergence. The energy functional associated with the optimization problem is split into multiple terms, and the CP algorithm is employed to minimize each of them in an iterative manner. Numerical experiments show that the proposed algorithm could gain more than ten times faster convergence speed compared to the classical CP algorithm.

Paper Details

Date Published: 28 May 2019
PDF: 5 pages
Proc. SPIE 11072, 15th International Meeting on Fully Three-Dimensional Image Reconstruction in Radiology and Nuclear Medicine, 110722M (28 May 2019);
Show Author Affiliations
Xiaojuan Deng, Capital Normal Univ. (China)
Wenbin Xu, Capital Normal Univ. (China)
Hongwei Li, Capital Normal Univ. (China)


Published in SPIE Proceedings Vol. 11072:
15th International Meeting on Fully Three-Dimensional Image Reconstruction in Radiology and Nuclear Medicine
Samuel Matej; Scott D. Metzler, Editor(s)

© SPIE. Terms of Use
Back to Top
PREMIUM CONTENT
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?
close_icon_gray