Title: Speedup performance analysis of parallel Katsevich algorithm for 3D CT image reconstruction

Authors: Jun Ni, Junjun Deng, Tao He, Hengyong Yu, Ge Wang

Addresses: Medical Imaging HPC and Informatics Lab, Department of Radiology, The University of Iowa, Iowa City, IA 52242, USA. ' Medical Imaging HPC and Informatics Lab, Department of Radiology, The University of Iowa, Iowa City, IA 52242, USA. ' Medical Imaging HPC and Informatics Lab, Department of Radiology, The University of Iowa, Iowa City, IA 52242, USA. ' VT-WFU School of Biomedical Engineering and Sciences, Virginia Polytechnic Institute and State University, 1880 Pratt Drive, Suite 2000, MC-0493 Blacksburg, VA 24061, USA. ' VT-WFU School of Biomedical Engineering and Sciences, Virginia Polytechnic Institute and State University, 1880 Pratt Drive, Suite 2000, MC-0493 Blacksburg, VA 24061, USA

Abstract: The first exact spiral cone-beam CT reconstruction algorithm was developed by Katsevich (2002, 2004). Recently, Yu and Wang (2004a, 2004b) implemented the algorithm numerically. Although the method is very promising, the computation is very intensive. It requires huge amounts of computational time. Recently, people (Deng et al., 2006; Yang et al., 2006) began to parallelise the algorithm for achieving high performance computing (HPC). This paper presents a performance analysis of the parallel Katsevich algorithm (Deng et al., 2006) by developing an analytical expression to evaluate the performance of the algorithm parallelism. The results from the analytical model and numerical experiments are compared in a fair agreement. The analytical model provides a useful tool to estimate HPC benchmarks in the parallel Katsevich algorithm.

Keywords: medical imaging; image reconstruction; parallel computing; high performance computing; HPC; Katsevich; computed tomography; 3D CT images; modelling.

DOI: 10.1504/IJCSE.2011.042018

International Journal of Computational Science and Engineering, 2011 Vol.6 No.3, pp.151 - 159

Available online: 20 Aug 2011 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article