Incremental Algorithm A New Fast Backprojection Scheme for Parallel Beam Geometries英文文献.pdfVIP

IEEE TRANSACTIONS ON MEDICAL IMAGING. VOL. 9. NO. 2. J U N E 1990 207 Incremental Algorithm-A New Fast Backprojection Scheme for Parallel Beam Geometries z. H. CHO, FELLOW, IEEE, c . M. CHEN, STUDENT MEMBER, IEEE, AND s.-Y. LEE, MEMBER, IEEE Abstract-In this paper, we propose a new fast backprojection proximated algorithm, STRETCH, which was proposed by scheme for parallel beam geometries, the Incremental algorithm, which Peters [6], to build a special hardware to speed up back- performs backprojection on a ray-by-ray (beam-by-beam) basis in con- projection. At least two disadvantages may be pointed out trast with a pixel-by-pixel backprojection in the conventional algo- rithm. By restructuring a conventional backprojection algorithm, the in this algorithm: loss of precision, and a large memory interdependency of pixel computations (position and value) is trans- size for the stretched array. It is because STRETCH per- formed to a set of incremental relations for a beam, where a beam is a forms a nearest neighbor interpolation on all pixels, of set of pixels enclosed by two adjacent rays in 2-D CT and a set of voxels which precision is proportional to the resolution of the enclosed by four adjacent rays in 3-D CT. This incremental backpro- preinterpolated array (stretched array). A higher precision jection algorithm should be distinguished from the incremental ray tracing algorithms in c