Discrete Tomography pp 265-284 | Cite as

# An Algebraic Solution for Discrete Tomography

## Abstract

Discrete tomography is the problem of reconstructing a binary image defined on a discrete lattice of points from its projections at only a few angles. It has applications in X-ray crystallography, in which the projections are the number of atoms in the crystal along a given line,and nondestructive testing. The 2D version of this problem is fairly well understood, and several algorithms for solving it are known, most of which involve discrete mathematics or network theory. However, the 3D problem is much harder to solve. This chapter shows how the problem can be recast in a purely algebraic form. This results in: (1) new insight into the number of projection angles needed for an almost surely unique solution; (2) non-obvious dependencies in projection data; and (3) new algorithms for solving it. We then present an explicit formula for reconstructing a finite-support object from a finite number of its discrete projections over a limited range of angles, again making extensive use of the discrete Fourier transform in doing so. We compute the object directly as a linear combination of the projections. The well-known ill-posedness of the limited-angle tomography problem manifests itself in some very large coefficients in these linear combinations; these coefficients,which are computed off-line,provide a direct sensitivity measure of the reconstruction samples to the projections samples. The discrete nature of the problem implies that the projections must also take on integer values; this means noise can be rejected. This makes the formula practical.

## Keywords

Discrete Fourier Transform Projection Data View Angle Tomography Problem Phase Retrieval## Preview

Unable to display preview. Download preview PDF.

## References

- [1]P. M. Salzberg, “Binary tomography on lattices,”
*Congresses Numeratium 111*, 185–192 (1995).Google Scholar - [2]S. K. Chang and Y. R. Wang, “Three-dimensional object reconstruction from orthogonal projections,”
*Pattern Recognition 7*, 167–176 (1975).CrossRefGoogle Scholar - [3]D. Dudgeon and R. M. Mersereau, Multidimensional Digital Signal Processing, (Prentice-Hall, Englewood Cliffs, NJ), 1984.Google Scholar
- [4]K. C. Tam and V. Perez-Mendez, “Tomographical imaging with limited angle input,” J. Opt. Soc. Am. A. 71, 582–592 (1981).CrossRefGoogle Scholar
- [5]H. Soltanian-Zadeh and A. E. Yagle, “A fast algorithm for extrapolation of discrete-time periodic band-limited signals,” Signal Processing 33, 183–196 (1993).CrossRefGoogle Scholar
- [6]A. E. Yagle, “An explicit closed-form solution to the limited angle discrete tomography problem for finite-support objects,” Int. J. Imaging Syst. and Technol. 9, 174–180 (1998).CrossRefGoogle Scholar
- [7]A. E. Yagle, “An algebraic solution to the 3-D discrete tomography problem,” in Proc. 1998 IEEE International Conference on Image Processing, (IEEE, Piscataway, NJ), to appear in 1999.Google Scholar
- [8]A. E. Yagle, “An explicit closed-form solution to the limited angle discrete tomography problem for finite-support objects,” in Proc. 1998 IEEE International Conference on Image Processing, (IEEE, Piscataway, NJ), to appear in 1999.Google Scholar