Conference paper
A very fast implementation of 2D iterative reconstruction algorithms
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
| Language: | English |
|---|---|
| Publisher: | IEEE |
| Year: | 1996 |
| Pages: | 1742-1746 |
| Proceedings: | 1996 IEEE Nuclear Science Symposium and Medical Imaging Conference |
| ISBN: | 0780335341 and 9780780335349 |
| ISSN: | 25770829 and 10823654 |
| Types: | Conference paper |
| DOI: | 10.1109/NSSMIC.1996.587967 |
2D iterative reconstruction algorithms Acceleration Detectors Image reconstruction Iterative methods Least squares methods Mathematical model Reconstruction algorithms Sparse matrices Subspace constraints Vectors direct reconstruction algorithms filtered backprojection image reconstruction iterative methods least squares conjugate gradient method medical diagnostic imaging medical image processing software package sparse matrix system matrix generation
