7 September 2006 Parallelism of iterative CT algorithm based on local reconstruction
Author Affiliations +
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. To overcome this problem, we proposed an innovative parallel method based on the local iterative CT reconstruction algorithm. The object to be reconstructed is partitioned into a number of sub-regions and assigned to different processing elements (PEs). Within each PE, local iterative reconstruction is performed to recover the sub-region. Several numerical experiments were conducted on a high performance computing cluster. And the FORBILD head phantom 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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Junjun Deng, Junjun Deng, Hengyong Yu, Hengyong Yu, Jun Ni, Jun Ni, Lihe Wang, Lihe Wang, Ge Wang, Ge Wang, "Parallelism of iterative CT algorithm based on local reconstruction", Proc. SPIE 6318, Developments in X-Ray Tomography V, 63181P (7 September 2006); doi: 10.1117/12.681272; https://doi.org/10.1117/12.681272

Back to Top