Some new multiplicative algorithms for image reconstruction from projections
From MaRDI portal
Publication:915376
DOI10.1016/0024-3795(90)90209-UzbMath0702.65043MaRDI QIDQ915376
Nicolas J. Dusaussoy, Ikram E. Abdou
Publication date: 1990
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
image processingconvex programmingiterative methodsBregman's methodlarge rectangular linear systemssuccessive entropy projections
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A relaxed version of Bregman's method for convex programming
- An iterative row-action method for interval convex programming
- On some methods for entropy maximization and matrix scaling
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Mathematical optimization versus practical performance: A case study based on the maximum entropy criterion in image reconstruction
- Generalized Iterative Scaling for Log-Linear Models