ACM Home Page
Please provide us with feedback. Feedback
HPC for iterative image reconstruction in CT
Full text PdfPdf (543 KB)
Source ACM International Conference Proceeding Series; Vol. 290 archive
Proceedings of the 2008 C3S2E conference table of contents
Montreal, Quebec, Canada
SESSION: Applications table of contents
Pages 61-68  
Year of Publication: 2008
ISBN:978-1-60558-101-9
Authors
Cameron Melvin  University of Manitoba, Winnipeg, Manitoba
Meilian Xu  University of Manitoba, Winnipeg, Manitoba
Parimala Thulasiraman  University of Manitoba, Winnipeg, Manitoba
Sponsors
: ACM International Conference Proceedings Series
Concordia University : Concordia University
: BytePress
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 45,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1370256.1370265
What is a DOI?

ABSTRACT

Algebraic Reconstruction Techniques (ART) for computed tomography (CT) have proven to produce better images with fewer projections, hence, reducing the side-effects of the carcinogenic nature of X-ray imaging. However, the iterative nature of ART prohibits its commercial use because of the long processing time. Parallel processing through high performance computers (HPC) is one solution to speedup ART algorithm.

The work discussed in the literature on parallel computing and CT primarily focuses on the algorithms based on Fourier techniques, with a lack of development of parallel approaches for ART techniques. The main reason for this has been the extensive computational requirements needed for this algorithm. With the boom in information technology and advanced architectures, we show in this paper that the ART algorithm can be parallelized on high performance computers, with significant performance gain while maintaining the image quality.

In this paper, we examine the efficiency of ART on a shared memory machine available on the Western Canada Research Grid consortium without impeding image quality. We show that a 6 processor IBM P-server could reconstruct the same image from 36 angles in approximately 5.038 seconds (36 processors is 1.183 seconds), with an efficiency of 93.35%. In other words, a parallel algorithm reconstruction could be done in about the same amount of time as a 180 angle sequential Fourier back projection reconstruction, yielding approximately equivalent image quality, with an 80% reduction in dose.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Chen, S. Lee, and Z. Cho. A parallel implementation of 3d ct image reconstruction on a hypercube multiprocessor. IEEE Transactions on Nuclear Science, 37(3):1333--1346, 1990.
 
2
L. Feldkamp, L. Davis, and J. Kress. Practical cone beam algorithm. Journal of the Optical Society of America, 1(6):612--619, 1984.
 
3
R. Gordon, R. Bender, and G. T. Herman. Algebraic reconstruction techniques (ART) for three dimensional electron microscopy and x-ray photography. Journal of Theoretical Biology, 29(3):471--481, 1970.
 
4
R. Gordon, G. T. Herman, and S. A. Johnson. Image Reconstructin from Projections. Scientific American, October 1975.
 
5
H. Guan and R. Gordon. A projection access order for speedy convergence of art: a multilevel scheme for computed tomography. Physics in Medicine and Biology, Vol. 39, 1994.
 
6
C. Guerrini and G. Spaletta. An image reconstruction algorithm in tomography: a version of the CRAY X-MP vector computer. Computers and Graphics, 13:367--372, 1989.
 
7
G. Herman and L. Meyer. Algebraic reconstruction can be made computationally efficient. IEEE Transactions on Medical Imaging, 12(3):600--609, 1993.
 
8
M. Jiang and G. Wang. Convergence of the simultaneous algebraic reconstruction technique (SART). IEEE Transactions on Image Processing, 12(8):957--961, 2003.
 
9
W. Kalender. Computed Tomography: Fundamentals, System Technology, Image Quality, Applications. Erlangen: Publics Corporate Pub., 2005.
 
10
D. Lattard and G. Mazare. Image Reconstruction Using an Original Asynchronous Cellular Array. IEEE International Symposium on Circuits and Systems, pages 13--16, 1989.
 
11
 
12
C. Melvin, P. Thulasiraman, and R. Gordon. Parallel Algebraic Reconstruction Technique for Computed Tomography. In Proc. of Parallel and Distributed Processing Techniques and Applications, Las Vegas, Nevada, 2003.
 
13
Cameron Melvin. Design, development and implementation of a parallel algorithm for computed tomography using algebraic reconstruction technique. Master's thesis, University of Manitoba, 2006.
 
14
R. M. Rangayyann and R. Gordon. Streak Preventive Image Reconstruction with ART and Adaptive Filtering. IEEE Transactions on Medical Imaging, Vol. MI-1(3), November 1982.
 
15
 
16
D. Roberson, J. Yuan, G. Wang, and M. vannier. Total hip prosthesis metal artifact suppression using iterative deblurring reconstruction. Journal of Computer Assisted Tomography, 21(2):293--298, 1997.
 
17
S. Sakamoto, H. Nishiyama, H. Satoh, S. Shimizu, T. Sanuki, K. Kamijoh, A. Watanabe, and A. Asara. An implementation of the Feldkamp algorithm for medical imaging on Cell. IBM White Paper, October 2005.
 
18
19

Collaborative Colleagues:
Cameron Melvin: colleagues
Meilian Xu: colleagues
Parimala Thulasiraman: colleagues