Some new multiplicative algorithms for image reconstruction from projections
type: Item
instance of: scholarly article
title: Some new multiplicative algorithms for image reconstruction from projections
zbMATH Open document ID: 0702.65043
DOI: 10.1016/0024-3795(90)90209-U
author: Nicolas J. Dusaussoy
author: Ikram E. Abdou
published in: Linear Algebra and its Applications
publication date: 1990-01-01T00:00:00Z
review text: Two iterative methods for the solution of large rectangular linear systems are proposed and their relationship to other iterative methods for this problem is discussed. It is demonstrated that for the application of image processing, these systems have better performance than other methods, although they use more iterations.
Mathematics Subject Classification ID: 65F20
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 4151730
zbMATH Keywords: Bregman's method
zbMATH Keywords: successive entropy projections
zbMATH Keywords: convex programming
zbMATH Keywords: iterative methods
zbMATH Keywords: large rectangular linear systems
zbMATH Keywords: image processing
reviewed by: Volker Mehrmann
MaRDI profile type: Publication
cites work: Q5580053
cites work: An iterative row-action method for interval convex programming
cites work: Strong underrelaxation in Kaczmarz's method for inconsistent systems
cites work: A relaxed version of Bregman's method for convex programming
cites work: Generalized Iterative Scaling for Log-Linear Models
cites work: On some methods for entropy maximization and matrix scaling
cites work: Q3325518
cites work: Mathematical optimization versus practical performance: A case study based on the maximum entropy criterion in image reconstruction
cites work: Q5529067
cites work: Extensions of Hildreth’s Row-Action Method for Quadratic Programming
description: scientific article; zbMATH DE number 4151730