ABSTRACT
Recently, to realize low-dose scan in CT imaging, a number of iterative reconstruction methods with Total Variation (TV) regularization have been investigated. In particular, reconstruction methods based on proximal splitting framework have been actively researched thanks to the following two reasons. First, they allow to use the TV regularization term, which is known to be a non-differentiable function that cannot be handled with classical optimization methods. Second, using the proximal splitting leads to a new class of iterative reconstruction methods which cannot be found in the literature. The major drawback of existing research in this direction is that most of them use the proximal splitting which divides the cost function into a sum of only two terms like famous Chambolle-Pock algorithm and FISTA. In this paper, we propose a unified framework to construct a class of row-action-type iterative methods which converge very fast using frameworks of multi proximal splitting which divides the cost function into a sum of arbitrary number of sub-cost functions (more than two). The use of multi proximal splitting naturally allows us to construct row-action-type iterative methods converging to an exact minimizer of the cost function very quickly. In mathematical literature, there exist only three different frameworks of multi proximal splitting, which are the Passty splitting, Dykstra-like splitting, and modified Dykstra-like splitting. We develop three new iterative methods, i.e. the Passty iterative method, Dykstra-like iterative method, and modified Dykstra-like iterative method, by using these frameworks, for the case where the cost function is a sum of the standard least-squares data fidelity and the TV regularization term. We have compared the proposed three iterative methods with an empirical standard method using ordered-subset technique called OS-SIRT-TV method. The results demonstrate that the performances of proposed methods significantly outperform OS-SIRT method in terms of image quality with a comparable convergence speed.
- The Japanese Society of Medical Imaging Technology. 2012. Medical Imaging Handbook (in Japanese). 190.Google Scholar
- Herman GT and Meyer LB. 1993. Algebraic Reconstruction Techniques Can Be Made Computationally Efficient. IEEE Trans Med Imaging 12. 600-609.Google ScholarCross Ref
- Gilbert P. 1972. Iterative Methods for the Three-Dimensional Reconstruction of an Object from Projections. J Theor Biol 36.105-117.Google ScholarCross Ref
- Sidky E, Kao C and Pan X. 2012. Convex Optimization Problem Prototyping for Image Reconstruction in Computed Tomography with the Chambolle-Pock Algorithm. Phys Med Biol 57. 3065-3091.Google ScholarCross Ref
- Dong J. and Kudo H. 2017. Accelerated Algorithm for Compressed Sensing Using Nonlinear Sparsifying Transform in CT Image Reconstruction. Med Imaging Tech 35. 63-73.Google Scholar
- Boyle J. P and Dykstra R. L. 1986. A method for Finding Projections onto the Intersection of Convex Sets in Hillbert Spaces. Lecture Notes in Statistics 37. 28-47.Google ScholarCross Ref
- Han S P. 1989. A Decomposition Method and Its Application to Convex Programming. Math Oper Res 14. 237-248.Google ScholarDigital Library
- Combettes P-L and Pesquet J-C. 2011. Proximal Splitting Methods in Signal Processing. In Bauschke HH. Burachik RS. Combettes PL. eds. Fixed-Point Algorithms for Inverse Problems in Science and Engineering. Springer. New York. 185-212.Google Scholar
Index Terms
- Unified Framework to Construct Fast Row-Action-Type Iterative CT Reconstruction Methods with Total Variation Using Multi Proximal Splitting
Recommendations
Fast nonconvex nonsmooth minimization methods for image restoration and reconstruction
Nonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficulty of the computational stage which requires a nonconvex nonsmooth ...
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum $f(\mathbf{x})+\psi(\mathbf{x})$, where $f$ is smooth and $\psi$ is convex, but possibly nonsmooth. It is shown that if $f$ ...
Unified Framework of Extragradient-Type Methods for Pseudomonotone Variational Inequalities
In this paper, we propose a unified framework of extragradient-type methods for solving pseudomonotone variational inequalities, which allows one to take different stepsize rules and requires the computation of only two projections at each iteration. It ...
Comments