Some new multiplicative algorithms for image reconstruction from projections
- 1 March 1990
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 130, 111-132
- https://doi.org/10.1016/0024-3795(90)90209-u
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Algebraic Reconstruction Techniques (ART) for three-dimensional electron microscopy and X-ray photographyPublished by Elsevier ,2004
- A relaxed version of Bregman's method for convex programmingJournal of Optimization Theory and Applications, 1986
- Finite series-expansion reconstruction methodsProceedings of the IEEE, 1983
- Strong underrelaxation in Kaczmarz's method for inconsistent systemsNumerische Mathematik, 1983
- Mathematical optimization versus practical performance: A case study based on the maximum entropy criterion in image reconstructionPublished by Springer Nature ,1982
- An iterative row-action method for interval convex programmingJournal of Optimization Theory and Applications, 1981
- On some methods for entropy maximization and matrix scalingLinear Algebra and its Applications, 1980
- RELAXATIONAL METHODS FOR LARGE-SCALE ENTROPY OPTIMIZATION PROBLEMS, WITH APPLICATION IN IMAGE RECONSTRUCTIONPublished by Elsevier ,1979
- Generalized Iterative Scaling for Log-Linear ModelsThe Annals of Mathematical Statistics, 1972
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967