By Topic

Analysis of Performance Evaluation of Parallel Katsevich Algorithm for 3-D CT Image Reconstruction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Jun Ni ; Dept. of Radiol., Iowa Univ., Iowa City, IA ; Deng, J. ; Hengyong Yu ; He, T.
more authors

The first theoretically exact spiral cone-beam CT reconstruction algorithm developed was by Katsevich. Recently, Yu et al. implemented the algorithm numerically. Although the method is very promising, the computation is very intensive. It requires huge amount of computer time. Recently, people began to parallelize the algorithm for achieving high performance computation. This paper presents an analysis of data decomposition and data communication in the parallel Katsevich algorithm and develops an analysis expression to evaluate the performance of the algorithm parallelism. The results based on the analytical model and numerical benchmarks compared in a fare agreement. The analytical model provides a great tool to evaluate high performance computing benchmarks in the parallel Katsevich algorithms

Published in:

Computer and Computational Sciences, 2006. IMSCCS '06. First International Multi-Symposiums on  (Volume:1 )

Date of Conference:

20-24 June 2006