Some new multiplicative algorithms for image reconstruction from projections

Linear Algebra and Its Applications

Volumn 130, Issue C, 1990, Pages 111-132

  Dusaussoy, Nicolas J ^a   Abdou, Ikram E ^b  

^a Advanced Research & Applications Corporation   (United States)

^b Martin Marietta Corporation   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000191315     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(90)90209-U     Document Type: Article

References (19)

1. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
2. Relaxational methods for large-scale entropy optimization problems, with application in image reconstruction
3. An iterative row-action method for interval convex programming
4. Finite series-expansion reconstruction methods
5. Strong underrelaxation in Kaczmarcz's method for inconsistent systems
6. On Maximization of Entropies and a Generalization of Bregman's Method for Convex Programming
7. Generalized iterative scaling for log-linear models
8. A relaxed version of Bregman's method for convex programming
9. Image reconstruction using a modified Bregman's method
10. Performance of maximum entropy algorithms for image reconstruction from projections
11. Maximum Entropy Type Algorithms for Image Reconstruction from Projections
12. On some methods for entropy maximization and matrix scaling
13. Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and x-ray photography
14. Mathematical optimization versus practical performance A case study based on the maximum entropy criterion in image reconstruction
15. Bregman's balancing method
16. A convergent algorithm for maximum entropy image restoration, with a medical x-ray application