Discrete Tomography pp 191-212 | Cite as

# Binary Tomography Using Gibbs Priors

## Abstract

The problem of reconstructing a binary image (usually an image in the plane and not necessarily on a Cartesian grid) from a few projections translates into the problem of solving a system of equations,which is very underdetermined and leads in general to a large class of solutions. It is desirable to limit the class of possible solutions, by using appropriate prior information, to only those which are reasonably typical of the class of images which contains the unknown image that we wish to reconstruct. One may indeed pose the following hypothesis: if the image is a typical member of a class of images having a certain distribution, then by using this information we can limit the class of possible solutions to only those which are close to the given unknown image. This hypothesis is experimentally validated for the specific case of a class of binary images defined on the hexagonal grid, where the probability of the occurrence of a particular image of the class is determined by a Gibbs distribution and reconstruction is to be done from the three natural projections. Another case for which the hypothesis is tested is reconstruction, from the three projections, of semiconductor surface phantoms defined on the square grid. The time-consuming nature of the stochastic reconstruction algorithm is ameliorated by a preprocessing step that discovers image locations at which the value is the same in all images having the given projections; this reduces the search space considerably. We discuss, in particular, a linear-programming approach to finding such “invariant” locations.

## Keywords

Original Image Tabu Search Binary Tomography Projection Data Brute Force## Preview

Unable to display preview. Download preview PDF.

## References

- [1]S.-K. Chang and C. K. Chow, “The reconstruction of three-dimensional objects from two orthogonal projections and its application to cardiac cineangiography,”
*IEEE Trans. on Computers*22, 18–28 (1973).CrossRefGoogle Scholar - [2]P. Fishburn, P. Schwander, L. Shepp, and R. J. Vanderbei, “The discrete Radon transform and its approximate inversion via linear programming,”
*Discrete Applied Mathematics*75, 39–61 (1997).CrossRefGoogle Scholar - [3]M. T. Chan, G. T. Herman, and E. Levitan, “A Bayesian approach to PET reconstruction using image-modeling Gibbs priors: Implementation and comparison,”
*IEEE Trans. Nucl. Sci.*44, 1347–1354 (1997).CrossRefGoogle Scholar - [4]G. Winkler,
*Image Analysis*,*Random Fields and Dynamic Monte Carlo Methods*(Springer-Verlag, Heidelberg), 1995.CrossRefGoogle Scholar - [5]E. Levitan, M. Chan, and G. T. Herman, “Image-modeling Gibbs priors,”
*Graph. Models Image Proc.*57, 117–130 (1995).CrossRefGoogle Scholar - [6]N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equations of state calculations by fast computing machines,”
*J. Chem. Phys.*21, 1087–1092 (1953).CrossRefGoogle Scholar - [7]G. T. Herman and A. Kuba (Eds.), “Special Issue on Discrete Tomography,”
*Int. J. Imaging Syst. and Technol. 9*, No. 2/3, 1998.Google Scholar - [8]R. Aharoni, G. T. Herman, and A. Kuba, “Binary vectors partially determined by linear equation systems,”
*Discrete Mathematics 171*, 1–16 (1997).CrossRefGoogle Scholar - [9]S. Wright,
*Primal-Dual Interior-Point Methods*(SIAM, Philadelphia), 1997.Google Scholar - [10]C. Reeves,
*Modern Heuristic Techniques for Combinatorial Problems*(John Wiley and Sons, New York), 1993.Google Scholar