Implementation of the Fast Approximate 3D Image Reconstruction Algorithm

Abstract

For an N×N×N image I(x,y,z), it would generally require O(N5)time to computer the projections of N3 different planes, since each plance contains about N2 sample points from I(x,y,z). Reconstruction of an N×N×N image from N3projections also would usually take O(N5) time. Our fast approximate algorithmth performs planar projection and backprojection in only O(N3 log N)time. In this paper, we present the implementation results (include both timing results and images reconstructed by the algorithms)of the fast approximat projection algorith. The results demonstrate that our algorithms are not only feasible, but also performs quite well.