1990
DOI: 10.1109/42.56333
|View full text |Cite
|
Sign up to set email alerts
|

Incremental algorithm-a new fast backprojection scheme for parallel beam geometries

Abstract: A fast backprojection scheme for parallel beam geometries is proposed. Known as the incremental algorithm, it performs backprojection on a ray-by-ray (beam-by-beam) basis rather than the pixel-by-pixel backprojection in the conventional algorithm. By restructuring a conventional backprojection algorithm, the interdependency of pixel computations (position and value) is transformed to a set of incremental relations for a beam, where a beam is a set of pixels enclosed by two adjacent rays in 2-D computed tomogra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
40
0

Year Published

1995
1995
2013
2013

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 42 publications
(40 citation statements)
references
References 7 publications
0
40
0
Order By: Relevance
“…For example, the pixels required for projection θ i+3 could be any two adjacent pixels within [t 1 , t 6 ]. Required pixels spread out further from t 3 and t 4 for memories that are further away from the first memory as explained by formulae (11). Similar to the output-mux design shown in Fig.…”
Section: Horizontal and Vertical Parallel Backprojectionmentioning
confidence: 70%
See 1 more Smart Citation
“…For example, the pixels required for projection θ i+3 could be any two adjacent pixels within [t 1 , t 6 ]. Required pixels spread out further from t 3 and t 4 for memories that are further away from the first memory as explained by formulae (11). Similar to the output-mux design shown in Fig.…”
Section: Horizontal and Vertical Parallel Backprojectionmentioning
confidence: 70%
“…Introduced in 1974 it is still in common use today as a reference image for reconstruction algorithms. The Shepp and Logan backprojection algorithm is the most well-known backprojection algortithm [3,11]. In the conventional Shepp and Logan backprojection algorithm, for each pixel, P , located at (x, y), and each projection angle θ i , the first step in backprojection is to locate the pixel in an appropriate beam (ray).…”
Section: Shepp and Logan Backprojection Algorithmmentioning
confidence: 99%
“…STIR and our projection/backprojection pair are quite similar. STIR one is made of a ray tracing projector using a variation of Siddon's algorithm 25 and an incremental, beamwise interpolating backprojector using Cho's algorithm 26,27 . Original and reconstructred phantoms are presented on figure 4.…”
Section: Voxel Flow Architecturementioning
confidence: 99%
“…The backprojection operator is based on an extension to 3D cylindrical geometry of Cho's incremental algorithm [11]: the 3D beamwise, incremental backprojection method [12].…”
Section: The Projection/backprojection Operatorsmentioning
confidence: 99%
“…• classes for projection data (the complete dataset, segments, sinograms, viewgrams) and images (3D and 2D); • various filter transfer functions (2D and 1D); • Fast Fourier Transform (FFT) utilities; • forward projection operators (ray tracing method using Siddon's algorithm [10]); • backprojection operators (incremental, beamwise interpolating backprojection using Cho's algorithm [11]); • trimming, mashing, and zooming utilities on projection and image data; • classes for both analytic and iterative reconstruction algorithms;…”
Section: Description Of the Reconstruction Librarymentioning
confidence: 99%