Semi-convergence and relaxation parameters for a class of SIRT algorithms

This paper is concerned with the Simultaneous Iterative Reconstruction Technique (SIRT) class of iterative methods for solving inverse problems. Based on a careful analysis of the semi-convergence behavior of these methods, we propose two new techniques to specify the relaxation parameters adaptively during the iterations, so as to control the propagated noise component of the error. The advantage of using this strategy for the choice of relaxation parameters on noisy and ill-conditioned problems is demonstrated with an example from tomography

[1]  H. V. D. Vorst,et al.  SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems , 1990 .

[2]  José María Carazo,et al.  3-D reconstruction of 2-D crystals in real space , 2004, IEEE Transactions on Image Processing.

[3]  Ming Jiang,et al.  Convergence Studies on Iterative Algorithms for Image Reconstruction , 2003, IEEE Trans. Medical Imaging.

[4]  Achiya Dax,et al.  Line search acceleration of iterative methods , 1990 .

[5]  Yair Censor,et al.  Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem , 2002, SIAM J. Matrix Anal. Appl..

[6]  Lúcio T. Santos,et al.  A parallel subgradient projections method for the convex feasibility problem , 1987 .

[7]  Gabor T. Herman,et al.  Fundamentals of Computerized Tomography: Image Reconstruction from Projections , 2009, Advances in Pattern Recognition.

[8]  Yair Censor,et al.  Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems , 2001, Parallel Comput..

[9]  Claudio Estatico,et al.  Improvement of Space-Invariant Image Deblurring by Preconditioned Landweber Iterations , 2008, SIAM J. Sci. Comput..

[10]  Patrick L. Combettes,et al.  Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections , 1997, IEEE Trans. Image Process..

[11]  Dennis C. Smolarski,et al.  A linear acceleration row action method for projecting onto subspaces. , 2005 .

[12]  L. Landweber.  An iteration formula for Fredholm integral equations of the first kind , 1951 .

[13]  Mario Bertero,et al.  Introduction to Inverse Problems in Imaging , 1998 .

[14]  Yair Censor,et al.  On Diagonally Relaxed Orthogonal Projection Methods , 2007, SIAM J. Sci. Comput..

[15]  Misha Elena Kilmer,et al.  Iterative Regularization and MINRES , 1999, SIAM J. Matrix Anal. Appl..

[16]  M. Bertero,et al.  Projected Landweber method and preconditioning , 1997 .

[17]  F. Natterer.  The Mathematics of Computerized Tomography , 1986 .

[18]  G T Herman,et al.  Image reconstruction from a small number of projections , 2008, Inverse problems.

[19]  Per Christian Hansen,et al.  Rank-Deficient and Discrete Ill-Posed Problems , 1996 .