4 October 2000 Enforcing nonnegativity in image reconstruction algorithms
Author Affiliations +
In image restoration and reconstruction applications, unconstrained Krylov subspace methods represent an attractive approach for computing approximate solutions. They are fast, but unfortunately they do not produce approximate solutions preserving nonnegativity. As a consequence the error of the computed approximate solution can be large. Enforcing a nonnegativity constraint can produce much more accurate approximate solutions, but can also be computationally expensive. This paper considers a nonnegativity constrained minimization algorithm which represents a variant of an algorithm proposed by Kaufman. Numerical experiments show that the algorithm can be more accurate and computationally competitive with unconstrained Krylov subspace methods.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
James G. Nagy, James G. Nagy, Zdenek Strakos, Zdenek Strakos, "Enforcing nonnegativity in image reconstruction algorithms", Proc. SPIE 4121, Mathematical Modeling, Estimation, and Imaging, (4 October 2000); doi: 10.1117/12.402439; https://doi.org/10.1117/12.402439

Back to Top