You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
3 October 2016A very fast iterative algorithm for TV-regularized image reconstruction with applications to low-dose and few-view CT
This paper concerns iterative reconstruction for low-dose and few-view CT by minimizing a data-fidelity term regularized with the Total Variation (TV) penalty. We propose a very fast iterative algorithm to solve this problem. The algorithm derivation is outlined as follows. First, the original minimization problem is reformulated into the saddle point (primal-dual) problem by using the Lagrangian duality, to which we apply the first-order primal-dual iterative methods. Second, we precondition the iteration formula using the ramp filter of Filtered Backprojection (FBP) reconstruction algorithm in such a way that the problem solution is not altered. The resulting algorithm resembles the structure of so-called iterative FBP algorithm, and it converges to the exact minimizer of cost function very fast.
The alert did not successfully save. Please try again later.
Hiroyuki Kudo, Fukashi Yamazaki, Takuya Nemoto, Keita Takaki, "A very fast iterative algorithm for TV-regularized image reconstruction with applications to low-dose and few-view CT," Proc. SPIE 9967, Developments in X-Ray Tomography X, 996711 (3 October 2016); https://doi.org/10.1117/12.2236788