Table of Contents Author Guidelines Submit a Manuscript
International Journal of Biomedical Imaging
Volume 2006 (2006), Article ID 17463, 8 pages

Parallel Implementation of Katsevich's FBP Algorithm

LMAM, School of Mathematical Sciences, Peking University, Beijing 100871, China

Received 30 September 2005; Revised 17 January 2006; Accepted 17 February 2006

Copyright © 2006 Jiansheng Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


For spiral cone-beam CT, parallel computing is an effective approach to resolving the problem of heavy computation burden. It is well known that the major computation time is spent in the backprojection step for either filtered-backprojection (FBP) or backprojected-filtration (BPF) algorithms. By the cone-beam cover method [1], the backprojection procedure is driven by cone-beam projections, and every cone-beam projection can be backprojected independently. Basing on this fact, we develop a parallel implementation of Katsevich's FBP algorithm. We do all the numerical experiments on a Linux cluster. In one typical experiment, the sequential reconstruction time is 781.3 seconds, while the parallel reconstruction time is 25.7 seconds with 32 processors.