Projection-slice theorem

Last updated May 20, 2022

In mathematics, the projection-slice theorem, central slice theorem or Fourier slice theorem in two dimensions states that the results of the following two calculations are equal:

Take a two-dimensional function f(r), project (e.g. using the Radon transform) it onto a (one-dimensional) line, and do a Fourier transform of that projection.
Take that same function, but do a two-dimensional Fourier transform first, and then slice it through its origin, which is parallel to the projection line.

In operator terms, if

F₁ and F₂ are the 1- and 2-dimensional Fourier transform operators mentioned above,
P₁ is the projection operator (which projects a 2-D function onto a 1-D line),
S₁ is a slice operator (which extracts a 1-D central slice from a function),

then

F_{1}P_{1}=S_{1}F_{2}.

This idea can be extended to higher dimensions.

This theorem is used, for example, in the analysis of medical CT scans where a "projection" is an x-ray image of an internal organ. The Fourier transforms of these images are seen to be slices through the Fourier transform of the 3-dimensional density of the internal organ, and these slices can be interpolated to build up a complete Fourier transform of that density. The inverse Fourier transform is then used to recover the 3-dimensional density of the object. This technique was first derived by Ronald N. Bracewell in 1956 for a radio-astronomy problem.^[1]

The projection-slice theorem in N dimensions

In N dimensions, the projection-slice theorem states that the Fourier transform of the projection of an N-dimensional function f(r) onto an m-dimensional linear submanifold is equal to an m-dimensional slice of the N-dimensional Fourier transform of that function consisting of an m-dimensional linear submanifold through the origin in the Fourier space which is parallel to the projection submanifold. In operator terms:

F_{m}P_{m}=S_{m}F_{N}.\,

The generalized Fourier-slice theorem

In addition to generalizing to N dimensions, the projection-slice theorem can be further generalized with an arbitrary change of basis.^[2] For convenience of notation, we consider the change of basis to be represented as B, an N-by-N invertible matrix operating on N-dimensional column vectors. Then the generalized Fourier-slice theorem can be stated as

F_{m}P_{m}B=S_{m}{\frac {B^{-T}}{|B^{-T}|}}F_{N}

where $B^{-T}=(B^{-1})^{T}$ is the transpose of the inverse of the change of basis transform.

Proof in two dimensions

A graphical illustration of the projection slice theorem in two dimensions. f(r) and F(k) are 2-dimensional Fourier transform pairs. The projection of f(r) onto the x-axis is the integral of f(r) along lines of sight parallel to the y-axis and is labelled p(x). The slice through F(k) is on the kx axis, which is parallel to the x axis and labelled s(kx). The projection-slice theorem states that p(x) and s(kx) are 1-dimensional Fourier transform pairs. ProjectionSlice.png — A graphical illustration of the projection slice theorem in two dimensions. f(r) and F(k) are 2-dimensional Fourier transform pairs. The projection of f(r) onto the x-axis is the integral of f(r) along lines of sight parallel to the y-axis and is labelled p(x). The slice through F(k) is on the k_x axis, which is parallel to the x axis and labelled s(k_x). The projection-slice theorem states that p(x) and s(k_x) are 1-dimensional Fourier transform pairs.

The projection-slice theorem is easily proven for the case of two dimensions. Without loss of generality, we can take the projection line to be the x-axis. There is no loss of generality because if we use a shifted and rotated line, the law still applies. Using a shifted line (in y) gives the same projection and therefore the same 1D Fourier transform results. The rotated function is the Fourier pair of the rotated Fourier transform, for which the theorem again holds.

If f(x, y) is a two-dimensional function, then the projection of f(x, y) onto the x axis is p(x) where

p(x)=\int _{-\infty }^{\infty }f(x,y)\,dy.

The Fourier transform of $f(x,y)$ is

F(k_{x},k_{y})=\int _{-\infty }^{\infty }\int _{-\infty }^{\infty }f(x,y)\,e^{-2\pi i(xk_{x}+yk_{y})}\,dxdy.

The slice is then $s(k_{x})$

s(k_{x})=F(k_{x},0)=\int _{-\infty }^{\infty }\int _{-\infty }^{\infty }f(x,y)\,e^{-2\pi ixk_{x}}\,dxdy

=\int _{-\infty }^{\infty }\left[\int _{-\infty }^{\infty }f(x,y)\,dy\right]\,e^{-2\pi ixk_{x}}dx

=\int _{-\infty }^{\infty }p(x)\,e^{-2\pi ixk_{x}}dx

which is just the Fourier transform of p(x). The proof for higher dimensions is easily generalized from the above example.

The FHA cycle

If the two-dimensional function f(r) is circularly symmetric, it may be represented as f(r), where r = |r|. In this case the projection onto any projection line will be the Abel transform of f(r). The two-dimensional Fourier transform of f(r) will be a circularly symmetric function given by the zeroth-order Hankel transform of f(r), which will therefore also represent any slice through the origin. The projection-slice theorem then states that the Fourier transform of the projection equals the slice or

F_{1}A_{1}=H,

where A₁ represents the Abel-transform operator, projecting a two-dimensional circularly symmetric function onto a one-dimensional line, F₁ represents the 1-D Fourier-transform operator, and H represents the zeroth-order Hankel-transform operator.

Extension to fan beam or cone-beam CT

The projection-slice theorem is suitable for CT image reconstruction with parallel beam projections. It does not directly apply to fanbeam or conebeam CT. The theorem was extended to fan-beam and conebeam CT image reconstruction by Shuang-ren Zhao in 1995.^[3]

Related Research Articles

In mathematics, convolution is a mathematical operation on two functions that produces a third function that expresses how the shape of one is modified by the other. The term convolution refers to both the result function and to the process of computing it. It is defined as the integral of the product of the two functions after one is reversed and shifted. The integral is evaluated for all values of shift, producing the convolution function.

In mathematics, the Laplace transform, named after its inventor Pierre-Simon Laplace, is an integral transform that converts a function of a real variable to a function of a complex variable $. The transform has many applications in science and engineering because it is a tool for solving differential equations. In particular, it transforms linear differential equations into algebraic equations and convolution into multiplication. For suitable functions f, the Laplace transform is the integral$

In mathematics, an operator is generally a mapping or function that acts on elements of a space to produce elements of another space. There is no general definition of an operator, but the term is often used in place of function when the domain is a set of functions or other structured objects. Also, the domain of an operator is often difficult to be explicitly characterized, and may be extended to related objects. See Operator (physics) for other examples.

In mathematics, the Dirac delta distribution, also known as the unit impulse symbol, is a generalized function or distribution over the real numbers, whose value is zero everywhere except at zero, and whose integral over the entire real line is equal to one.

Fourier transform Mathematical transform that expresses a function of time as a function of frequency

A Fourier transform (FT) is a mathematical transform that decomposes functions depending on space or time into functions depending on spatial frequency or temporal frequency. An example application would be decomposing the waveform of a musical chord into terms of the intensity of its constituent pitches. The term Fourier transform refers to both the frequency domain representation and the mathematical operation that associates the frequency domain representation to a function of space or time.

Fourier series Decomposition of periodic functions into sums of simpler sinusoidal forms

A Fourier series is a sum that represents a periodic function as a sum of sine and cosine waves. The frequency of each wave in the sum, or harmonic, is an integer multiple of the periodic function's fundamental frequency. Each harmonic's phase and amplitude can be determined using harmonic analysis. A Fourier series may potentially contain an infinite number of harmonics. Summing part of but not all the harmonics in a function's Fourier series produces an approximation to that function. For example, using the first few harmonics of the Fourier series for a square wave yields an approximation of a square wave.

In mathematics, particularly linear algebra and functional analysis, a spectral theorem is a result about when a linear operator or matrix can be diagonalized. This is extremely useful because computations involving a diagonalizable matrix can often be reduced to much simpler computations involving the corresponding diagonal matrix. The concept of diagonalization is relatively straightforward for operators on finite-dimensional vector spaces but requires some modification for operators on infinite-dimensional spaces. In general, the spectral theorem identifies a class of linear operators that can be modeled by multiplication operators, which are as simple as one can hope to find. In more abstract language, the spectral theorem is a statement about commutative C*-algebras. See also spectral theory for a historical perspective.

In mathematics, the Fourier inversion theorem says that for many types of functions it is possible to recover a function from its Fourier transform. Intuitively it may be viewed as the statement that if we know all frequency and phase information about a wave then we may reconstruct the original wave precisely.

In mathematics, the Mellin transform is an integral transform that may be regarded as the multiplicative version of the two-sided Laplace transform. This integral transform is closely connected to the theory of Dirichlet series, and is often used in number theory, mathematical statistics, and the theory of asymptotic expansions; it is closely related to the Laplace transform and the Fourier transform, and the theory of the gamma function and allied special functions.

In mathematics, the Radon transform is the integral transform which takes a function f defined on the plane to a function Rf defined on the (two-dimensional) space of lines in the plane, whose value at a particular line is equal to the line integral of the function over that line. The transform was introduced in 1917 by Johann Radon, who also provided a formula for the inverse transform. Radon further included formulas for the transform in three dimensions, in which the integral is taken over planes. It was later generalized to higher-dimensional Euclidean spaces, and more broadly in the context of integral geometry. The complex analogue of the Radon transform is known as the Penrose transform. The Radon transform is widely applicable to tomography, the creation of an image from the projection data associated with cross-sectional scans of an object.

In mathematics and in signal processing, the Hilbert transform is a specific linear operator that takes a function, $u (t)$ of a real variable and produces another function of a real variable $H(u)(t)$ . This linear operator is given by convolution with the function $. The Hilbert transform has a particularly simple representation in the frequency domain: It imparts a phase shift of \pm90° to every frequency component of a function, the sign of the shift depending on the sign of the frequency. The Hilbert transform is important in signal processing, where it is a component of the analytic representation of a real-valued signal u (t) . The Hilbert transform was first introduced by David Hilbert in this setting, to solve a special case of the Riemann-Hilbert problem for analytic functions.$

In mathematics, a Paley–Wiener theorem is any theorem that relates decay properties of a function or distribution at infinity with analyticity of its Fourier transform. The theorem is named for Raymond Paley (1907–1933) and Norbert Wiener (1894–1964). The original theorems did not use the language of distributions, and instead applied to square-integrable functions. The first such theorem using distributions was due to Laurent Schwartz. These theorems heavily rely on the triangle inequality.

In Fourier analysis, a multiplier operator is a type of linear operator, or transformation of functions. These operators act on a function by altering its Fourier transform. Specifically they multiply the Fourier transform of a function by a specified function known as the multiplier or symbol. Occasionally, the term multiplier operator itself is shortened simply to multiplier. In simple terms, the multiplier reshapes the frequencies involved in any function. This class of operators turns out to be broad: general theory shows that a translation-invariant operator on a group which obeys some regularity conditions can be expressed as a multiplier operator, and conversely. Many familiar operators, such as translations and differentiation, are multiplier operators, although there are many more complicated examples such as the Hilbert transform.

The rectangular function is defined as

In mathematics, a Dirac comb is a periodic function with the formula

In mathematics, the Hankel transform expresses any given function f(r) as the weighted sum of an infinite number of Bessel functions of the first kind $J ν (kr)$ . The Bessel functions in the sum are all of the same order ν, but differ in a scaling factor k along the r axis. The necessary coefficient $F ν$ of each Bessel function in the sum, as a function of the scaling factor k constitutes the transformed function. The Hankel transform is an integral transform and was first developed by the mathematician Hermann Hankel. It is also known as the Fourier–Bessel transform. Just as the Fourier transform for an infinite interval is related to the Fourier series over a finite interval, so the Hankel transform over an infinite interval is related to the Fourier–Bessel series over a finite interval.

In mathematics, the Abel transform, named for Niels Henrik Abel, is an integral transform often used in the analysis of spherically symmetric or axially symmetric functions. The Abel transform of a function f(r) is given by

In mathematics, Hilbert spaces allow generalizing the methods of linear algebra and calculus from (finite-dimensional) Euclidean vector spaces to spaces that may be infinite-dimensional. A Hilbert space is a vector space equipped with an inner product which defines a distance function for which it is a complete metric space. Hilbert spaces arise naturally and frequently in mathematics and physics, typically as function spaces.

In mathematics, singular integral operators of convolution type are the singular integral operators that arise on Rⁿ and Tⁿ through convolution by distributions; equivalently they are the singular integral operators that commute with translations. The classical examples in harmonic analysis are the harmonic conjugation operator on the circle, the Hilbert transform on the circle and the real line, the Beurling transform in the complex plane and the Riesz transforms in Euclidean space. The continuity of these operators on L² is evident because the Fourier transform converts them into multiplication operators. Continuity on L^p spaces was first established by Marcel Riesz. The classical techniques include the use of Poisson integrals, interpolation theory and the Hardy–Littlewood maximal function. For more general operators, fundamental new techniques, introduced by Alberto Calderón and Antoni Zygmund in 1952, were developed by a number of authors to give general criteria for continuity on L^p spaces. This article explains the theory for the classical operators and sketches the subsequent general theory.

In signal processing, nonlinear multidimensional signal processing (NMSP) covers all signal processing using nonlinear multidimensional signals and systems. Nonlinear multidimensional signal processing is a subset of signal processing. Nonlinear multi-dimensional systems can be used in a broad range such as imaging, teletraffic, communications, hydrology, geology, and economics. Nonlinear systems cannot be treated as linear systems, using Fourier transformation and wavelet analysis. Nonlinear systems will have chaotic behavior, limit cycle, steady state, bifurcation, multi-stability and so on. Nonlinear systems do not have a canonical representation, like impulse response for linear systems. But there are some efforts to characterize nonlinear systems, such as Volterra and Wiener series using polynomial integrals as the use of those methods naturally extend the signal into multi-dimensions. Another example is the Empirical mode decomposition method using Hilbert transform instead of Fourier Transform for nonlinear multi-dimensional systems. This method is an empirical method and can be directly applied to data sets. Multi-dimensional nonlinear filters (MDNF) are also an important part of NMSP, MDNF are mainly used to filter noise in real data. There are nonlinear-type hybrid filters used in color image processing, nonlinear edge-preserving filters use in magnetic resonance image restoration. Those filters use both temporal and spatial information and combine the maximum likelihood estimate with the spatial smoothing algorithm.

References

↑ Bracewell, Ronald N. (1956). "Strip integration in radio astronomy". Australian Journal of Physics. 9 (2): 198–217. Bibcode:1956AuJPh...9..198B. doi: 10.1071/PH560198 .
↑ Ng, Ren (2005). "Fourier Slice Photography" (PDF). ACM Transactions on Graphics. 24 (3): 735–744. doi:10.1145/1073204.1073256.
↑ Zhao S.R. and H.Halling (1995). A New Fourier Transform Method for fan Beam Tomography. Published in 1995 Nuclear Science Symposium and Medical Imaging Conference Record. Vol. 2. pp. 1287–91. doi:10.1109/NSSMIC.1995.510494. ISBN 978-0-7803-3180-8. S2CID 60933220.

External links

Fourier Slice Theorem (video). Part of the "Computed Tomography and the ASTRA Toolbox" course. University of Antwerp. September 10, 2015.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Bracewell, Ronald N. (1956). "Strip integration in radio astronomy". Australian Journal of Physics. 9 (2): 198–217. Bibcode:1956AuJPh...9..198B. doi: 10.1071/PH560198 .

[NgFourierSlicePhotography-2] Ng, Ren (2005). "Fourier Slice Photography" (PDF). ACM Transactions on Graphics. 24 (3): 735–744. doi:10.1145/1073204.1073256.

[ZhaoFSliceThoerem-3] Zhao S.R. and H.Halling (1995). A New Fourier Transform Method for fan Beam Tomography. Published in 1995 Nuclear Science Symposium and Medical Imaging Conference Record. Vol. 2. pp. 1287–91. doi:10.1109/NSSMIC.1995.510494. ISBN 978-0-7803-3180-8. S2CID 60933220.

[1]

[2]

[3]