MENT: a maximum entropy algorithm for reconstructing a source from projection data

Journal Article · Mon Jan 01 00:00:00 EST 1979 · Comput. Graphics Image Process.; (United States)

DOI:https://doi.org/10.1016/0146-664X(79)90034-0· OSTI ID:6821231

Minerbo, G

A description is given of an iterative algorithm, MENT, which produces a maximum entropy solution to the problem of reconstructing a source from a discrete set of projection data. Whereas the MART algorithm considered by Lent (1976 Society of Photographic Scientists and Engineers Conference Proceedings, SPSE, Washington, DC, 1977) uses a rectangular grid to represent the source, MENT uses a discretization that is better suited to the problem. Unlike MART, MENT does not require the evaluation of logarithms or exponentials. The storage requirements are also lower for MENT. Numerical examples are given of a two-dimensional reconstruction from five views. MENT and MART are compared with regard to convergence rates, artifact formation, and stability against noise errors in the data. A three-dimensional version of the algorithm is also considered; we give an example of a direct three-dimensional reconstruction from four views. 6 figures.

• Research Organization: Univ. of California, Los Alamos, NM
• OSTI ID: 6821231
• Journal Information: Comput. Graphics Image Process.; (United States), Vol. 10
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
ALGORITHMS
IMAGE PROCESSING
COMPARATIVE EVALUATIONS
COMPUTER CALCULATIONS
ENTROPY
ITERATIVE METHODS
THREE-DIMENSIONAL CALCULATIONS
TWO-DIMENSIONAL CALCULATIONS
MATHEMATICAL LOGIC
PHYSICAL PROPERTIES
PROCESSING
THERMODYNAMIC PROPERTIES
990200* - Mathematics & Computers