Computational analysis and improvement of SIRT.
Iterative X-ray computed tomography (CT) algorithms have the potential for producing high-quality images but are computationally very demanding, especially when applied to high-resolution problems. Focusing on simultaneous iterative reconstruction technique (SIRT), we provide an eigenvalue based scheme for automatically determining a near-optimal value of the relaxation parameter. This accelerates the convergence rate of SIRT to the point where only half the number of iterations normally required is needed. We also modify the way SIRT uses preconditioning to solve a weighted least squares problem. The resulting algorithm, which we call PSIRT, is associated with a smaller memory footprint and calls for less data to be communicated in a distributed-memory implementation. Experimental residual norm and timing results are provided based on cone-beam micro-CT mouse data, including for an ordered subsets study.
Gregor
Jens
J
Department of Computer Science, University of Tennessee, 1122 Volunteer Blvd., Knoxville, TN 37996, USA. jgregor@cs.utk.edu
Benson
Thomas
T
D000465:Algorithms; D000818:Animals; D001185:Artificial Intelligence; D001330:Electronic Data Processing / Q000379:methods; D005246:Feedback; D021621:Imaging, Three-Dimensional / Q000379:methods; D016018:Least-Squares Analysis; D051379:Mice; D009716:Numerical Analysis, Computer-Assisted; D010363:Pattern Recognition, Automated / Q000379:methods; D011857:Radiographic Image Interpretation, Computer-Assisted / Q000379:methods; D014057:Tomography, X-Ray Computed / Q000379:methods*; D051598:Whole Body Imaging