next up previous
Next: Algorithm for more general Up: Algorithms in Tomography Previous: Basic Algorithms in 2D

Formulas for 3D reconstruction

In 3D CT one reconstructes a from the values of

displaymath1770

where v runs through the source curve V outside supp(a) and tex2html_wrap_inline1778 . Most reconstruction formulas make use of an intermediate function

eqnarray489

where h is homogeneous of degree -2 and a function F on tex2html_wrap_inline1786 derived from G by

eqnarray493

The reconstruction formula then reads

eqnarray496

where the convolution with the 1D function k in the second argument. It can be shown that (4.1-3) is in fact a reconstruction formula provided that

eqnarray502

For the proof we start out from

displaymath1794

with the 3D Radon transform [49], hence tex2html_wrap_inline1798 . Then, (4.3) is compared with (2.4) for n = 3, i.e.

displaymath1802

This coincides with (4.3) if (4.4) holds.

The simplest choice for h, k is tex2html_wrap_inline1808 , tex2html_wrap_inline1810 . In this case, both tex2html_wrap_inline1812 , tex2html_wrap_inline1814 are local. We obtain Grangeat's inversion formula [19]

eqnarray519

where tex2html_wrap_inline1816 is the derivative in direction tex2html_wrap_inline994 with respect to the second argument and tex2html_wrap_inline1820 is the partial derivative with respect to the second argument. In order to apply (4.5-6), tex2html_wrap_inline1822 is needed for each plane tex2html_wrap_inline1824 meeting supp(a). Since F is obtained from G by means of (4.2) we need for each such plane a source v in that plane. In view of (4.5) this means that g is available for a neighbourhood of the fan in that plane converging to the source v. This is Grangeat's completeness condition.

The inversion formulas of Tuy [53], B. Smith [50] and Gelfand and Goncharov [17] can be obtained by putting tex2html_wrap_inline1838 , tex2html_wrap_inline1840 and tex2html_wrap_inline1842 , tex2html_wrap_inline1844 , respectively [12]. These formulas are not as useful as Grangeat's formula since h is no longer local.

In practice tex2html_wrap_inline1848 is measured on a detector plane tex2html_wrap_inline1850 where tex2html_wrap_inline1852 is the orthogonal projection of v onto tex2html_wrap_inline1856 . Putting tex2html_wrap_inline1858 , (4.1) assumes the form

displaymath1860

Introducing an orthogonal system tex2html_wrap_inline1862 in tex2html_wrap_inline1864 we obtain in the Grangeat case (4.5)

eqnarray546

where tex2html_wrap_inline1866 , R is the 2D Radon transform and tex2html_wrap_inline1872 the gradient of tex2html_wrap_inline1874 . Thus Grangeat's formula can be implemented by computing line integrals in the detector plane, followed by a 3D backprojection (4.6). An implementation analogous to the filtered backprojection algorithm of 2D tomography can be found in [12].

In 3D emission CT, the requirements are quite different. In PET one puts the object into a vertical cylinder whose interior surface is covered by detectors. With such an arrangement one measures the X-ray transform for all lines joining two points on the mantle of the cylinder. In principle one could do the reconstruction layer by layer, using only horizontal lines in each layer. However, all the information contained in the oblique rays would be lost.

A formula which at least partially copes with this situation is

eqnarray558

where tex2html_wrap_inline1884 is a spherical zone around the equator and tex2html_wrap_inline1886 is the length of the intersection of G and the plane spanned by tex2html_wrap_inline994 , y [41]. With (4.8) one still has problems near the openings of the cylinder. More satisfactory reconstruction formulas based on the principle of the stationary phase have been given in [11].


next up previous
Next: Algorithm for more general Up: Algorithms in Tomography Previous: Basic Algorithms in 2D

Frank Wuebbeling
Fri Jun 28 16:25:38 MET DST 1996