On the efficiency of iterative ordered subset reconstruction algorithms for acceleration on GPUs

Expectation Maximization (EM) and the Simultaneous Iterative Reconstruction Technique (SIRT) are two iterative computed tomography reconstruction algorithms often used when the data contain a high amount of statistical noise, have been acquired from a limited angular range, or have a limited number of views. A popular mechanism to increase the rate of convergence of these types of algorithms has been to perform the correctional updates within subsets of the projection data. This has given rise to the method of Ordered Subsets EM (OS-EM) and the Simultaneous Algebraic Reconstruction Technique (SART). Commodity graphics hardware (GPUs) has shown great promise to combat the high computational demands incurred by iterative reconstruction algorithms. However, we find that the special architecture and programming model of GPUs add extra constraints on the real-time performance of ordered subsets algorithms, counteracting the speedup benefits of smaller subsets observed on CPUs. This gives rise to new relationships governing the optimal number of subsets as well as relaxation factor settings for obtaining the smallest wall-clock time for reconstruction-a factor that is likely application-dependent. In this paper we study the generalization of SIRT into Ordered Subsets SIRT and show that this allows one to optimize the computational performance of GPU-accelerated iterative algebraic reconstruction methods.

[1]  Y. Censor,et al.  On Block-Iterative Entropy Maximization , 1987 .

[2]  L. Shepp,et al.  Maximum Likelihood Reconstruction for Emission Tomography , 1983, IEEE Transactions on Medical Imaging.

[3]  A. Kak,et al.  Simultaneous Algebraic Reconstruction Technique (SART): A Superior Implementation of the Art Algorithm , 1984, Ultrasonic imaging.

[4]  Rüdiger Westermann,et al.  MR image reconstruction using the GPU , 2006, SPIE Medical Imaging.

[5]  Gengsheng Lawrence Zeng,et al.  Unmatched projector/backprojector pairs in an iterative reconstruction algorithm , 2000, IEEE Transactions on Medical Imaging.

[6]  Naga K. Govindaraju,et al.  A Survey of General‐Purpose Computation on Graphics Hardware , 2007 .

[7]  G. Herman,et al.  Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and x-ray photography. , 1970, Journal of theoretical biology.

[8]  Klaus Mueller,et al.  Real-time 3D computed tomographic reconstruction using commodity graphics hardware , 2007, Physics in medicine and biology.

[9]  Xinwei Xue,et al.  Acceleration of fluoro-CT reconstruction for a mobile C-arm on GPU and FPGA hardware: a simulation study , 2006, SPIE Medical Imaging.

[10]  A. H. Andersen Algebraic reconstruction in CT from limited views. , 1989, IEEE transactions on medical imaging.

[11]  Jens H. Krüger,et al.  A Survey of General‐Purpose Computation on Graphics Hardware , 2007, Eurographics.

[12]  Randima Fernando,et al.  The CG Tutorial: The Definitive Guide to Programmable Real-Time Graphics , 2003 .

[13]  Fang Xu,et al.  Accelerating popular tomographic reconstruction algorithms on commodity PC graphics hardware , 2005, IEEE Transactions on Nuclear Science.

[14]  Klaus Mueller,et al.  Rapid 3-D cone-beam reconstruction with the simultaneous algebraic reconstruction technique (SART) using 2-D texture mapping hardware , 2000, IEEE Transactions on Medical Imaging.

[15]  H. Malcolm Hudson,et al.  Accelerated image reconstruction using ordered subsets of projection data , 1994, IEEE Trans. Medical Imaging.

[16]  P. Gilbert Iterative methods for the three-dimensional reconstruction of an object from projections. , 1972, Journal of theoretical biology.

[17]  J. S. Kole,et al.  Evaluation of accelerated iterative X-ray CT image reconstruction using floating point graphics hardware , 2004 .