GMRES methods for tomographic reconstruction with an unmatched back projector
From MaRDI portal
Publication:2146331
DOI10.1016/J.CAM.2022.114352zbMATH Open1489.65060arXiv2110.01481OpenAlexW3203301659MaRDI QIDQ2146331FDOQ2146331
Authors: Per Christian Hansen, Keiichi Morikuni, Ken Hayami 
Publication date: 16 June 2022
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Abstract: Unmatched pairs of forward and back projectors are common in X-ray CT computations for large-scale problems; they are caused by the need for fast algorithms that best utilize the computer hardware, and it is an interesting and challenging task to develop fast and easy-to-use algorithms for these cases. Our approach is to use preconditioned GMRES, in the form of the AB- and BA-GMRES algorithms, to handle the unmatched normal equations associated with an unmatched pair. These algorithms are simple to implement, they rely only on computations with the available forward and back projectors, and they do not require the tuning of any algorithm parameters. We show that these algorithms are equivalent to well-known LSQR and LSMR algorithms in the case of a matched projector. Our numerical experiments demonstrate that AB- and BA-GMRES exhibit a desired semi-convergence behavior that is comparable with LSQR/LSMR and that standard stopping rules work well. Hence, AB- and BA-GMRES are suited for large-scale CT reconstruction problems with noisy data and unmatched projector pairs.
Full work available at URL: https://arxiv.org/abs/2110.01481
Recommendations
- Unmatched projector/backprojector pairs: perturbation and convergence analysis
- Fixing nonconvergence of algebraic iterative reconstruction with an unmatched backprojector
- Projection algorithms with correction
- Scaled projected-directions methods with application to transmission tomography
- Numerical solution of some problems in tomography
Ill-posedness and regularization problems in numerical linear algebra (65F22) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Iterative numerical methods for linear systems (65F10)
Cites Work
- Regularization tools version \(4.0\) for matlab \(7.3\)
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- Title not available (Why is that?)
- Perturbation bounds in connection with singular value decomposition
- The mathematics of computerized tomography
- Title not available (Why is that?)
- Improved image deblurring with anti-reflective boundary conditions and re-blurring
- Old and new parameter choice rules for discrete ill-posed problems
- GMRES methods for least squares problems
- Title not available (Why is that?)
- On the regularizing properties of the GMRES method
- Discrete inverse problems. Insight and algorithms.
- Iterative regularization with minimum-residual methods
- The Moore-Penrose inverse of a partitioned matrix \(M=\begin{pmatrix} D&D\\ B&C\end{pmatrix}\)
- Arnoldi methods for image deblurring with anti-reflective boundary conditions
- Inheritance of the discrete Picard condition in Krylov subspace methods
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- Multicore performance of block algebraic iterative reconstruction methods
- Semi-convergence properties of Kaczmarz's method
- A twin error gauge for Kaczmarz's iterations
- Title not available (Why is that?)
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs
- Fixing nonconvergence of algebraic iterative reconstruction with an unmatched backprojector
- Unmatched projector/backprojector pairs: perturbation and convergence analysis
- Convergence of proximal gradient algorithm in the presence of adjoint mismatch
- Computed tomography. Algorithms, insight, and just enough theory. With contributions by Martin S. Andersen, K. Joost Batenburg, Yiqiu Dond, Eric Todd Quinto and Jan Sijbers
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
Cited In (4)
- Convergence Results for Primal-Dual Algorithms in the Presence of Adjoint Mismatch
- Unmatched projector/backprojector pairs: perturbation and convergence analysis
- Solution of mismatched monotone+Lipschitz inclusion problems
- Fixing nonconvergence of algebraic iterative reconstruction with an unmatched backprojector
Uses Software
This page was built for publication: GMRES methods for tomographic reconstruction with an unmatched back projector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146331)
