# The Filtered Backprojection

## The Filtered Backprojection

### The Fourier inversion formula Filling in the Fourier transform of the Radon transform regarding the t variable: The resulting expression gains its usefulness from the fact that the inverse Fourier transform is only carried out in 1D and the sampling points are evenly distribuited.

### The filter term of the Fourier inversion formula

For the interpretation of this formula let us note that the integral regarding only plays a role in the last transform. Until this point the variable can be regarded as a simple parameter. It can be regarded as such until the point when the inverse Fourier transform delivers new spatial coordinates to bereplaced by the expression. Now we write the state before the integration regarding : This simplified expressions just the Fourier transfrom of the 1D function , which is multiplied by the frequency variable |r| , and we do the inverse Fourier transform. This process describes a filtering in the Fourier-space, it is actually a high pass filtering.

### The backprojection part of the Fourier inversion formula

After the filtering is done, we can start integrating according to . Let us use the notation g for the function obtained after the filtering: . Now the integral: By definition describes lines in the space of , that cross point (x,y). The integral thus integrates the projections belonging to lines going through (x,y). This does not contradict our intuition since we collect all the information that belongs to the point (x,y). We can try how the backprojection of the Radon transform looks like without doing the filtering step. Let us start from distributions: Image of a foal in (x,y) space Radon transform of the picture of a foal

Let us backproject the Radon transform without the filtering step

You can see that the image is unacceptably soft, lacks details.
Let us use the following notation for the operator of the backprojection: .
Now we can write the steps of the filtered backprojection in operator form: #### Example: steps of the filtered backprojection

Now let us go through the steps one-by-one. We have again the same photo for the 2D distribution we are trying to reconstruct from its sinogram: Not its sinogram represents the acquired data: With operators Filtering must be done for each . as an illustration we took projection number 200, that looks like: With operator notation: Now let us take the Fourier transform of this projection that yielded an amplitude spectrum as follows: With operator notation: Now multiplied by |r| we obtain the next amplitude spectrum: With operator notation: Its inverse Fourier transform yields the filtered projection: With operator notation: Now we can see that the DC (constant) component vanishes.

Now let us carry out the Fourier transform for every projection, then we get an angle-frequency sinogram that looks like: With operator notation Let us multiply every projection with |r|, then do inverse Fourier transform: With operator notations: It is apparent that the image became sharper an more contrasty compared to the original image.

Taken the integral regarding we obtain the distribution we sought for (the foal): In operator notation: ### Practical realization

In practice there are two main differences in the realization of the algorithm:

1. The filtering in Fourier domain is often replaced by a convolution
2. the filter |r| is not ideal, as it amplifies noises so different filter terms should be applied

These aspects are dealt with in the next section .