By Topic

Performance of maximum entropy algorithms for image reconstruction from projections

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
N. J. Dusaussoy ; Dept. of Electr. Eng., Delaware Univ., Newark, DE, USA ; I. E. Abdou

The analysis of maximum entropy algorithms is provided for image reconstruction from projections. The performance of block- and row-type multiplicative algebraic reconstruction techniques, Bregman's method of convex programming for entropy maximization under linear equality constraints, and MENT is compared with those of the Algebraic Reconstruction Techniques and the convolution backprojection. The quality of the successive reconstructed iterates versus the computational complexity of the algorithms is given. Furthermore, it is shown that a priori knowledge of the shape of the image to be reconstructed is easily included with these algorithms by solving a more general optimization problem

Published in:

Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on

Date of Conference:

11-14 Apr 1988