Physics:Algebraic reconstruction technique
frame|right|Animated sequence of reconstruction steps, one iteration.
The algebraic reconstruction technique (ART) is an iterative reconstruction technique used in computed tomography. It reconstructs an image from a series of angular projections (a sinogram). Gordon, Bender and Herman first showed its use in image reconstruction;[1] whereas the method is known as Kaczmarz method in numerical linear algebra.[2][3]
An advantage of ART over other reconstruction methods (such as filtered backprojection) is that it is relatively easy to incorporate prior knowledge into the reconstruction process.
ART can be considered as an iterative solver of a system of linear equations [math]\displaystyle{ A x = b }[/math], where:
- [math]\displaystyle{ A }[/math] is a sparse [math]\displaystyle{ m \times n }[/math] matrix whose values represent the relative contribution of each output pixel to different points in the sinogram ([math]\displaystyle{ m }[/math] being the number of individual values in the sinogram, and [math]\displaystyle{ n }[/math] being the number of output pixels);
- [math]\displaystyle{ x }[/math] represents the pixels in the generated (output) image, arranged as a vector, and:
- [math]\displaystyle{ b }[/math] is a vector representing the sinogram. Each projection (row) in the sinogram is made up of a number of discrete values, arranged along the transverse axis. [math]\displaystyle{ b }[/math] is made up of all of these values, from each of the individual projections.[4]
Given a real or complex matrix [math]\displaystyle{ A }[/math] and a real or complex vector [math]\displaystyle{ b }[/math], respectively, the method computes an approximation of the solution of the linear systems of equations as in the following formula,
- [math]\displaystyle{ x^{k+1} = x^k + \lambda_k \frac{b_i - \langle a_i, x^k \rangle}{\|a_i\|^2} a_i^T }[/math]
where [math]\displaystyle{ i = k \bmod m + 1 }[/math], [math]\displaystyle{ a_i }[/math] is the i-th row of the matrix [math]\displaystyle{ A }[/math], [math]\displaystyle{ b_i }[/math] is the i-th component of the vector [math]\displaystyle{ b }[/math].
[math]\displaystyle{ \lambda_k }[/math] is an optional relaxation parameter, of the range [math]\displaystyle{ 0 \lt \lambda_k \leq 1 }[/math]. The relaxation parameter is used to slow the convergence of the system. This increases computation time, but can improve the signal-to-noise ratio of the output. In some implementations, the value of [math]\displaystyle{ \lambda_k }[/math] is reduced with each successive iteration.[4]
A further development of the ART algorithm is the simultaneous algebraic reconstruction technique (SART) algorithm.
References
- ↑ Gordon, R; Bender, R; Herman, GT (December 1970). "Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and x-ray photography". Journal of Theoretical Biology 29 (3): 471–81. doi:10.1016/0022-5193(70)90109-8. PMID 5492997. Bibcode: 1970JThBi..29..471G.
- ↑ Herman, Gabor T. (2009). Fundamentals of computerized tomography : image reconstruction from projections (2nd ed.). Dordrecht: Springer. ISBN 978-1-85233-617-2.
- ↑ Natterer, F. (1986). The mathematics of computerized tomography. Stuttgart: B.G. Teubner. ISBN 0-471-90959-9.
- ↑ 4.0 4.1 Kak, Avinash; Slaney, Malcolm (1999). Principles of Computerized Tomographic Imaging. New York: IEEE Press. pp. 276–277, 284. ISBN 978-0898714944. https://archive.org/details/principlescomput00akak.
 |  |
