Premium
Incomplete oblique projections method for solving regularized least‐squares problems in image reconstruction
Author(s) -
Scolnik H. D.,
Echebest N. E.,
Guardarucci M. T.
Publication year - 2008
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.2008.00643.x
Subject(s) - oblique case , smoothing , discretization , mathematics , least squares function approximation , algorithm , rank (graph theory) , image (mathematics) , pixel , function (biology) , mathematical optimization , iterative reconstruction , set (abstract data type) , oblique projection , computer science , artificial intelligence , mathematical analysis , statistics , combinatorics , philosophy , linguistics , estimator , evolutionary biology , orthographic projection , biology , programming language
In this paper we improve on the incomplete oblique projections (IOP) method introduced previously by the authors for solving inconsistent linear systems, when applied to image reconstruction problems. That method uses IOP onto the set of solutions of the augmented system Ax − r = b , and converges to a weighted least‐squares solution of the system Ax = b . In image reconstruction problems, systems are usually inconsistent and very often rank‐deficient because of the underlying discretized model. Here we have considered a regularized least‐squares objective function that can be used in many ways such as incorporating blobs or nearest‐neighbor interactions among adjacent pixels, aiming at smoothing the image. Thus, the oblique incomplete projections algorithm has been modified for solving this regularized model. The theoretical properties of the new algorithm are analyzed and numerical experiments are presented showing that the new approach improves the quality of the reconstructed images.