A Recursive Algorithm for Diffuse Planar Tomography
Diffuse tomography generalizes the standard discrete tomography problem,permitting anisotropic scattering. The diffuse problem involves more unknowns, and also more data. Markov transition probabilities are recovered from measurements taken at all pairs of input/output ports on the boundary. A recursive algorithm is used to solve the problem on a general n × n lattice in the plane.
KeywordsInverse Problem Imaging Object Hide State Recursive Algorithm Range Condition
Unable to display preview. Download preview PDF.
- G. T. Herman, Image Reconstruction from Projections: The Fundamentals of Computerized Tomography, (Academic Press, New York), 1980.Google Scholar
- F. A. Grünbaum and S. K. Patch, “How many parameters can one solve for in Diffuse Tomography,” In G. Papanicolaou, A. Friedman, and R. Gulliver I.M.A. Workshop on Inverse Problems in Waves and Scattering, (Springer-Verlag, New York), pp. 219–236, 1995.Google Scholar
- F. A. Grünbaum and S. K. Patch, “The use of Graßmann identities for inversion of a general model in diffuse tomography,” In Proceedings of the Lapland Conference on Inverse Problems, (Saariselkä, Finland), 1992.Google Scholar
- W. V. D. Hodge and D. Pedoe, Methods of Algebraic Geometry, (Cambridge University Press, Cambridge, UK) 1968.Google Scholar
- P. Griffiths and J. Harris, Principles of Algebraic Geometry, (Wiley and Sons, New York) 1978.Google Scholar
- S. K. Patch, “Sufficiency and simplicity of range conditions for diffuse tomgraphic systems,” Technical Report #97–07, Scientific Computing and Computational Mathematics, Stanford University, Stanford, CA (1997).Google Scholar