O(N2log2N) filtered backprojection reconstruction algorithm for tomography

We present a new fast reconstruction algorithm for parallel beam tomography. The new algorithm is an accelerated version of the standard filtered backprojection (FBP) reconstruction, and uses a hierarchical decomposition of the backprojection operation to reduce the computational cost from O(N(3)) to O(N(2)log(2 )N). We discuss the choice of the various parameters that affect the behavior of the algorithm, and present numerical studies that demonstrate the cost versus distortion tradeoff. Comparisons with Fourier reconstruction algorithms and a multilevel inversion algorithm by Brandt et al., both of which also have O(N(2)log(2)N) cost, suggest that the proposed hierarchical scheme has a superior cost versus distortion performance. It offers RMS reconstruction errors comparable to the FBP with considerable speedup. For an example with a 512 x 512-pixel image and 1024 views, the speedup achieved with a particular implementation is over 40 fold, with reconstructions visually indistinguishable from the FBP.

[1]  T. Moon,et al.  Mathematical Methods and Algorithms for Signal Processing , 1999 .

[2]  I Bajla,et al.  A high-speed reconstruction from projections using direct Fourier method with optimized parameters-an experimental analysis. , 1990, IEEE transactions on medical imaging.

[3]  A. Lindgren,et al.  Sampling the 2-D Radon transform , 1981 .

[4]  F. Natterer.  The Mathematics of Computerized Tomography , 1986 .

[5]  Yoram Bresler,et al.  A multilevel domain decomposition algorithm for fast O(N2logN) reprojection of tomographic images , 2000, IEEE Trans. Image Process..

[6]  R. Hingorani,et al.  An Investigation of Computerized Tomography by Direct Fourier Inversion and Optimum Interpolation , 1981, IEEE Transactions on Biomedical Engineering.

[7]  Achi Brandt,et al.  A Fast and Accurate Multilevel Inversion of the Radon Transform , 1999, SIAM J. Appl. Math..

[8]  K. W. Current,et al.  An image processing IC for backprojection and spatial histogramming in a pipelined array , 1993 .

[9]  A. C. Kak,et al.  4 – Image Reconstruction from Projections , 1984 .

[10]  B. Logan,et al.  Reconstructing Interior Head Tissue from X-Ray Transmissions , 1974 .

[11]  Achi Brandt,et al.  Fast Calculation of Multiple Line Integrals , 1999, SIAM J. Sci. Comput..

[12]  R M Mersereau,et al.  Direct Fourier transform techniques in 3-D image reconstruction. , 1976, Computers in biology and medicine.

[13]  R. Lewitt.  Reconstruction algorithms: Transform methods , 1983, Proceedings of the IEEE.

[14]  D. Luenberger.  Optimization by Vector Space Methods , 1968 .

[15]  Anil K. Jain.  Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.

[16]  Martin L. Brady,et al.  A Fast Discrete Approximation Algorithm for the Radon Transform , 1998, SIAM J. Comput..

[17]  G. Herman,et al.  Image reconstruction from linograms: implementation and evaluation. , 1988, IEEE transactions on medical imaging.

[18]  Yoram Bresler,et al.  A Multilevel Domain Decomposition Algorithm for Fast Reprojection of Tomographic , 2000 .

[19]  J. Philip.  The most ill-posed non-negative kernels in discrete deconvolution , 1987 .

[20]  M. Glas,et al.  Principles of Computerized Tomographic Imaging , 2000 .

[21]  J. D. O'Sullivan,et al.  A Fast Sinc Function Gridding Algorithm for Fourier Inversion in Computer Tomography , 1985, IEEE Transactions on Medical Imaging.

[22]  Frank Natterer.  Efficient evaluation of oversampled functions , 1986 .

[23]  Gabor T. Herman,et al.  Image Reconstruction From Projections , 1975, Real Time Imaging.

[24]  Jan Timmer,et al.  The gridding method for image reconstruction by Fourier transformation , 1995, IEEE Trans. Medical Imaging.

[25]  B. F. Logan,et al.  The Fourier reconstruction of a head section , 1974 .