Abstract
An iterative algorithm is suited to reconstruct CT images from noisy or truncated projection data. However, as a disadvantage, the algorithm requires significant computational time. Although a parallel technique can be used to reduce the computational time, a large amount of communication overhead becomes an obstacle to its performance (Li et al. in J. X-Ray Sci. Technol. 13:1–10, 2005). To overcome this problem, we proposed an innovative parallel method based on the local iterative CT reconstruction algorithm (Wang et al. in Scanning 18:582–588, 1996 and IEEE Trans. Med. Imaging 15(5):657–664, 1996). The object to be reconstructed is partitioned into a number of subregions and assigned to different processing elements (PEs). Within each PE, local iterative reconstruction is performed to recover the subregion. Several numerical experiments were conducted on a high performance computing cluster. And the FORBILD head phantom (Lauritsch and Bruder http://www.imp.uni-erlangen.de/phantoms/head/head.html) was used as benchmark to measure the parallel performance. The experimental results showed that the proposed parallel algorithm significantly reduces the reconstruction time, hence achieving a high speedup and efficiency.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Li X, Ni J, Wang G (2005) Parallel iterative cone beam CT image reconstruction on a PC cluster. J X-Ray Sci Technol 13:1–10
Wang G, Snyder DL, Vannier MW (1996) Local computed tomography via iterative deblurring. Scanning 18:582–588
Wang G, Snyder DL, O’Sullivan JA (1996) Iterative deblurring for CT metal artifact reduction. IEEE Trans Med Imaging 15(5):657–664
Lauritsch G, Bruder H Head phantom technical report. http://www.imp.uni-erlangen.de/phantoms/head/head.html
Andersen AH (1989) Algebraic reconstruction in CT from limited views. IEEE Trans Med Imaging 8:50–55
Andersen AH, Kak AC (1984) Simultaneous algebraic reconstruction technique (SART): A superior implementation of the ART algorithm. Ultrasonic Imaging 6:81–94
Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc (B) 39:1–39
Shepp LA, Valdi Y (1982) Maximum likelihood reconstruction for emission tomography. IEEE Trans Med Imaging 1(2):113–122
Lange K, Carson R (1984) EM reconstruction algorithms for emission and transmission tomography. J Comput Assist Tomogr 8(2):302–316
Leahy RM, Qi J (2000) Statistical approaches in quantitative positron emission tomography. Stat Comput 10:147–165
Hudson HM, Larkin RS (1994) Accelerated image reconstruction using ordered subsets of projection data. IEEE Trans Med Imaging 13:601–609
Kamphuis C, Beekman FJ (1998) Accelerated iterative transmission CT reconstruction using an ordered subsets convex algorithm. IEEE Trans Med Imaging 17:1101–1105
Kole JS, Beekman FJ (2005) Evaluation of the ordered subset convex algorithm for cone-beam CT. Phys Med Biol 50:613–623
Miller M, Butler C (1993) 3-D maximum a posteriori estimation for single photon emission computed tomography on massively-parallel computers. IEEE Trans Med Imaging 12:560–565
Chen CM, Lee SY, Cho ZH (1990) A parallel implementation of 3-D CT image reconstruction on hypercube multiprocessor. IEEE Trans Nucl Sci 37(3):1333–1346
Chen CM, Lee SY (1994) On parallelizing the EM algorithm for PET image reconstruction. IEEE Trans Parallel Distributed Syst 5(8)
Johnson C, Sofer A (1999) A data-parallel algorithm for iterative tomographic image reconstruction. In: Proc of 7th IEEE symp front mass parallel computing. IEEE Computer Society Press
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Deng, J., Yu, H., Ni, J. et al. Parallelism of iterative CT reconstruction based on local reconstruction algorithm. J Supercomput 48, 1–14 (2009). https://doi.org/10.1007/s11227-008-0198-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-008-0198-9