# Tomography

Reconstruction from projections, i.e. the recovery of a function from its line or (hyper)plane integrals. Important issues are existence, uniqueness and stability of inversion procedures, as well as the development of efficient numerical algorithms. In tomography a fundamental role is played by the Radon transform on Euclidean space. Let $f ( x _ {1} \dots x _ {n} )$ be a continuous function of the real variables $x _ {i} \in \mathbf R ^ {1}$ that is decreasing sufficiently fast at infinity, $i = 1 \dots n$; $n= 1 , 2 , . . .$. Let $\theta = ( \theta _ {1} \dots \theta _ {n} )$ be a unit vector in $\mathbf R ^ {n}$, $s$ a real number and $\Gamma = \{ {x \in \mathbf R ^ {n} } : {\langle x, \theta \rangle = s } \}$ a hyperplane, where $\langle , \rangle$ denotes the Euclidean inner product. The integral of $f$ over the hyperplane $\Gamma$,

$$\tag{a1 } F( \theta , s) = \int\limits _ \Gamma f( x) dm ( r),$$

where $dm$ is the Euclidean measure on $\Gamma$, is called the Radon transform of the function $f$. The Radon operator ${\mathcal R} : f \mapsto F$ maps the space ${\mathcal S} ( \mathbf R ^ {n} )$ of rapidly-decreasing $C ^ \infty$- functions on $\mathbf R ^ {n}$ to the space ${\mathcal S} ( Z ^ {n} )$ of rapidly-decreasing $C ^ \infty$- functions on $Z ^ {n}$, where $Z ^ {n} = S ^ {n-1} \times \mathbf R$ is the unit cylinder in $\mathbf R ^ {n+1}$ and $S ^ {n-1}$ the unit sphere in $\mathbf R ^ {n}$. The integral $F( \theta , s)$, with $\theta$ and $s$ fixed, is called a projection. The Radon transform is connected to the Fourier transform through the central slice theorem:

$$\tag{a2 } \widetilde{f} ( \alpha \theta ) = \ \int\limits _ {- \infty } ^ \infty F( \theta , s) e ^ {- i \alpha s } ds,\ \ \alpha \in \mathbf R ,$$

where $\widetilde{f} ( \xi ) = \int _ {\mathbf R ^ {n} } e ^ {- i \langle x, \xi \rangle } f( x) dx$ denotes the $n$- dimensional Fourier transform of $f$. To the Radon operator is associated a dual or backprojection operator ${\mathcal R} ^ {\#} : {\mathcal S} ( Z ^ {n} ) \rightarrow {\mathcal S} ( \mathbf R ^ {n} )$, by

$$\tag{a3 } ( {\mathcal R} ^ {\#} g) ( x) = \int\limits _ {S ^ {n-1} } g( \theta ,\ \langle x, \theta \rangle ) d \theta ,\ \ g \in {\mathcal S} ( Z ^ {n} ) .$$

Whereas ${\mathcal R}$ integrates over all points in a hyperplane, ${\mathcal R} ^ {\#}$ integrates over all hyperplanes through a point. Thus ${\mathcal R}$, ${\mathcal R} ^ {\#}$ form a dual pair in the sense of integral geometry (see [a1], [a8], [a9]). Related transforms are the $k$- plane transform, which integrates a function over $k$- dimensional subspaces (the case $k = 1$ is called the $X$- ray transform; the case $k = n- 1$ is identical to the Radon transform), and the divergent beam transform, which integrates over half-lines.

## Inversion.

The inversion formula of the Radon transform takes two different forms, depending on whether the dimension is even or odd [a12], [a17]:

$$f( x) = \frac{1}{2} ( 2 \pi ) ^ {1-n} \times$$

$$\times \left \{ \begin{array}{cl} (- 1) ^ {n/2} \frac{1} \pi \int\limits _ {\mathbf R } \frac{1}{q} \int\limits _ {S ^ {n-1} } F ^ { ( n- 1) } ( \theta , \langle x, \theta \rangle + q) d \theta \ dq &( n \textrm{ even } ) , \\ (- 1) ^ {( n- 1)/2} \int\limits _ {S ^ {n-1} } F ^ { ( n- 1) } ( \theta , \langle x, \theta \rangle ) d \theta &( n \textrm{ odd } ) . \\ \end{array} \right .$$

Here $F ^ { ( n- 1) }$ denotes the $( n- 1)$- st derivative of $F$ with respect to its last (scalar) argument. So, for $n$ odd only local information in a neighbourhood of the point $x$ is needed, whereas for even $n$ the integrals along all hyperplanes meeting the support of the function are required. In his 1917 paper, J. Radon [a17] also discussed the problem of determining a function on the hyperbolic plane from its integrals over all geodesics. Previously, a similar method had been used by P. Funk [a5] for the elliptic case of reconstructing an even function on the sphere from the integrals along the great circles. A unified form of the inversion formula for odd and even $n$ is given by

$$\tag{a4 } f = c ^ {-1} L _ {x} ^ {( n- 1)/2} ( {\mathcal R} ^ {\#} F ) ,\ \ F = {\mathcal R} f ,$$

where $c = (- 4 \pi ) ^ {n- 1/2} \Gamma ( n/2)/ \Gamma ( 1/2)$( with $\Gamma ( \cdot )$ the gamma-function and $L _ {x}$ the Laplace operator (acting on $x$)), see [a8]. Similar expressions for the dual transform exist. Inversion formulas for the divergent beam and $X$- ray transforms are analogous to those for ${\mathcal R}$. Other inversion formulas for the Radon transform are obtained by analytic series expansion methods, see [a3].

From the inversion formulas it follows that $f \in {\mathcal S} ( \mathbf R ^ {n} )$ is uniquely determined by ${\mathcal R} f$. If the transform is only known on a subset of the domain, this may no longer be true. Some of these so-called incomplete data problems are as follows (cf. Potential theory, inverse problems in). i) The exterior problem, i.e. recovering a function in the exterior of some ball from integrals over lines or planes outside that ball. This problem is uniquely solvable, if $f$ is decaying fast enough at infinity. ii) The interior problem, i.e. determining $f$ inside some ball from integrals inside that ball. A unique solution exists for odd dimension only. iii) The limited angle problem, where ${\mathcal R} f( \theta , s )$ is given only for $\theta$ in a subset of a half-sphere. Uniqueness holds as long as the set of directions is such that no non-trivial homogeneous polynomial vanishes on it. iv) Problems with a finite number of directions. The solution is non-unique to a very large extent. In fact, for any finite set of directions and any function $f \in C _ {0} ^ \infty ( K)$, with $K$ a compact set in $\mathbf R ^ {n}$, and any compact set $K _ {0}$ in the interior of $K$, one can find a function $f _ {0} \in C _ {0} ^ \infty ( K)$ which coincides with $f$ on $K _ {0}$ and for which all the line integrals along the given directions are identically zero, see [a20]. Such (highly oscillatory) functions $f _ {0}$, sometimes called "ghostghosts" , form the null-space of the transform for finitely many projections. To resolve this indeterminacy one has to put restrictions on the variation of the function $f$. On the other hand, by increasing the number of projections, arbitrarily good approximations to the unknown function can be found.

## Reconstruction algorithms.

The identity $f \star ( {\mathcal R} ^ {\#} g) = {\mathcal R} ^ {\#} ( g \star {\mathcal R} f )$, where $\star$ denotes convolution (cf. Convolution of functions), is the basis of filtered backprojection. One chooses $g$ in such a way that ${\mathcal R} ^ {\#} g$ is a low-pass filter approaching a delta-distribution, so that $f$ is recovered by a convolution followed by backprojection (both operations properly discretized). Variants exist where the backprojection is performed before the filtering procedure. The central slice theorem is the basis of Fourier reconstruction. Here the projections $F( \theta , s)$ are Fourier transformed with respect to the last variable, which is allowed by the inverse $n$- dimensional Fourier transform. To make use of the fast Fourier transform (cf. Fourier transform, discrete), one first has to interpolate from a polar grid to a Cartesian grid. Analytic series expansion methods are based upon discretization of the inversion formulas for the individual expansion coefficients of the unknown function. Algebraic reconstruction techniques use iterative methods from numerical linear algebra (cf. Iteration methods) applied to the system of linear equations resulting from a full discretization of Radon's integral equation.

Problems in computerized tomography are ill-posed (cf. Ill-posed problems). There may be no solution if the data are not in the range of the transform, or the solution may be non-unique, problems which can be overcome by using the concept of generalized inverses. Moreover, the operator which maps the transform to the solution may not be continuous. In that case one uses regularization procedures, such as Tikhonov–Phillips regularization, iterative methods with appropriate stopping criteria or truncated singular value decompositions [a4], [a15]. Limited data problems in particular are severely ill-posed. In this context one also may apply various statistical estimation procedures with or without the use of a-priori information, often resulting in iterative algorithms.

## Generalizations.

Generalized Radon transforms can be defined, where the integration is over subspaces or, more generally, over manifolds [a6], [a8], [a12]. A related problem for such spaces is the orbital integral problem, i.e. recovering a function from its integrals over (generalized) spheres. In acoustic or diffraction tomography, which is a special inverse scattering problem, $f$ can be recovered from data on semi-circles through the origin (see [a14], [a18], [a21]). Another variant is the attenuated Radon transform, which differs from the standard Radon transform by the presence of an exponential weighting factor under the integral sign. For the use of the Radon transform in the area of partial differential equations, see [a8], [a13]. One more generalization of Radon's problem is the reconstruction of a measure from its projections, i.e. from lower-dimensional measures induced by some measurable mapping. For the Radon transform in the complex domain, see [a6]. Finite Radon transforms have also been studied.

## Applications.

Tomography is a widely used method to reconstruct cross-sections of the interior structure of an object without having to cut or damage the object. In this context one usually speaks of computerized (computed, computer assisted) tomography, since for actually performing the reconstructions in practice one needs to use a digital computer. Through the interaction of a physical agens or "probe" — varying from $X$- rays, gamma rays, visible light, electrons, or neutrons to ultrasound waves or nuclear magnetic resonance signals — with the object, one obtains line or plane integrals of the internal distribution to be reconstructed. One of the most prominent examples of computerized tomography occurs in diagnostic medicine, where the method is used to produce images of the interior of human organs. In industry the method is used for non-destructive testing. Other applications arise in radio astronomy, radar theory, electron microscopy, aerodynamics, geophysics, and oceanography, see [a3], [a10], [a14] for references. Finite Radon transforms are used in various areas such as the theory of error-correcting codes and lattice theory.

How to Cite This Entry:
Tomography. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Tomography&oldid=49722
This article was adapted from an original article by J.B.T.M. Roerdink (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article