title: Fast parallel algorithms for the x-ray transform and its adjoint.
abstract: OBJECTIVE
  Iterative reconstruction methods often offer better imaging quality and allow for reconstructions with lower imaging dose than classical methods in computed tomography. However, the computational speed is a major concern for these iterative methods, for which the x-ray transform and its adjoint are two most time-consuming components. The speed issue becomes even notable for the 3D imaging such as cone beam scans or helical scans, since the x-ray transform and its adjoint are frequently computed as there is usually not enough computer memory to save the corresponding system matrix. The purpose of this paper is to optimize the algorithm for computing the x-ray transform and its adjoint, and their parallel computation.
  
  
  METHODS
  The fast and highly parallelizable algorithms for the x-ray transform and its adjoint are proposed for the infinitely narrow beam in both 2D and 3D. The extension of these fast algorithms to the finite-size beam is proposed in 2D and discussed in 3D.
  
  
  RESULTS
  The CPU and GPU codes are available at https://sites.google.com/site/fastxraytransform. The proposed algorithm is faster than Siddon's algorithm for computing the x-ray transform. In particular, the improvement for the parallel computation can be an order of magnitude.
  
  
  CONCLUSIONS
  The authors have proposed fast and highly parallelizable algorithms for the x-ray transform and its adjoint, which are extendable for the finite-size beam. The proposed algorithms are suitable for parallel computing in the sense that the computational cost per parallel thread is O(1).
authors.affiliation: Department of Mathematics and Computer Science, Emory University, Atlanta, GA, USA. hao.gao@emory.edu
authors.forename: Hao
authors.initials: H
authors.lastname: Gao
mesh_terms: D000465:Algorithms; D021621:Imaging, Three-Dimensional / Q000379:methods*; D013997:Time Factors; D014965:X-Rays