By Topic

A very fast implementation of 2D iterative reconstruction algorithms

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
$33 $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

1 Author(s)
P. Toft ; Dept. of Math. Modelling, Tech. Univ., Lyngby

One of the limitations of using iterative reconstruction methods in tomography is the slow performance compared with the direct reconstruction methods, such as Filtered Backprojection. Here, the authors demonstrate a very fast implementation of most types of iterative reconstruction methods. The key idea of the authors' method is to generate the huge system matrix only once, and store it using sparse matrix techniques. From the sparse matrix one can perform the matrix vector products very fast, which implies a major acceleration of the reconstruction algorithms. Here, the authors demonstrate that iterative reconstruction algorithms can be implemented and run almost as fast as direct reconstruction algorithms. The method has been implemented in a software package that is available for free, providing reconstruction algorithms using ART, EM, and the Least Squares Conjugate Gradient Method

Published in:

Nuclear Science Symposium, 1996. Conference Record., 1996 IEEE  (Volume:3 )

Date of Conference:

2-9 Nov 1996