Filtered Back Projection
Filtered Back Projection
Filtered backprojection as a concept is relatively easy to understand. Let's assume that we have a
finite number of projections of an object which contains radioactive sources (Fig. 5 A). The
projections of these sources at 45 degree intervals are represented on the sides of an octagon.
Figure 5 B illustrates the basic idea behind back projection, which is to simply run the
projections back through the image (hence the name ``back projection'') to obtain a rough
approximation to the original. The projections will interact contstructively in regions that
correspond to the emittive sources in the original image. A problem that is immediately apparent
is the blurring (star-like artifacts) that occur in other parts of the reconstructed image. One would
expect that a high-pass filter could be used to eliminate blurring, and that is the case. The optimal
way to eliminate these patterns in the noiseless case is through a ramp filter [5]. The combination
of back projection and ramp filtering is known as filtered back projection.
i.e., the line integral along a line (a tomography beam) at an angle from the y-axis and at a
distance |s| from the origin. By rotating the coordinate system,
or
can be expressed as
Reconstruction
One approach for reconstructing the image is simply to take the inverse Radon transform of the
projections. This involves two steps; the image is back projected and then filtered with a two
dimensional ramp filter.
The back projection operator, is defined as
This operator represents the accumulation of the projections that pass through the point (x,y). As
in the example above, the back projection is a blurred version of the desired image.
The image can be now unblurred with a two-dimensional ramp filter. Because two-dimensional
filtering is computationally intensive, a better a better approach is to reverse the order of the
filtering and the back projection. Figure 6 illustrates both approaches. The second approach is
possible due to the projection slice theorem, which states that the one-dimensional Fourier
transform with respect to s of
is equal to the central slice at angle of the twodimensional Fourier transform of f(x,y),
The projection slice theorem implies that the Radon transform of the two-dimensional
convolution of two functions is equal to the one-dimensional convolution of their Radon
transforms. Convolution has the nice property of being symmetric, i.e f*g=g*f. This can be used
to find a closed formula for the inverse Radon transform. It also implies a simpler inverse Radon
scheme than before. It can be summarized with the following two points:
Figure 6: Illustration of the two possible cases for filtered back projection. Most algorithms
today does a one-dimensional filtering of the projections before the back projection.