Back Projection Speed Improvement for 3-D Reconstruction
- 1 June 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nuclear Science
- Vol. 24 (5) , 1999-2005
- https://doi.org/10.1109/tns.1977.4329148
Abstract
The Fourier convolution algorithm has been used to reconstruct a 3-D density function. The method involves a particular choice of weighting function to convolve with projection data sets scanned through various angles from 0 to ¿. The convolved data are then back projected to obtain a 2-D image. A 3-D reconstruction is obtained as a stack of 2-D images. Because the new tomographic machines have much finer resolution, the number or projection data to be processed is considerably more than with the early models. The amount of data to be processed makes critical the need for improvements in both the speed as well as the accuracy. A first step toward speed improvement is to use a finite field transform to perform the convolutions. This was shown previously by the authors to be, in fact, a worthwhile effort. Another and most time-consuming part of the reconstruction algorithm is the so-called back-projection algorithm. The purpose of this paper is to present a method for speeding-up the back-projection algorithm by cutting down the computational time by a factor of two.Keywords
This publication has 5 references indexed in Scilit:
- A generalized |ω|-filter for 3-D reconstructionIEEE Transactions on Nuclear Science, 1977
- X-Ray Reconstruction by Finite Field TransformsIEEE Transactions on Nuclear Science, 1977
- The Fourier reconstruction of a head sectionIEEE Transactions on Nuclear Science, 1974
- Three-dimensional Reconstruction from Radiographs and Electron Micrographs: Application of Convolutions instead of Fourier TransformsProceedings of the National Academy of Sciences, 1971
- Inversion of Fan-Beam Scans in Radio AstronomyThe Astrophysical Journal, 1967