On the choice of regularization matrix for an ℓ2-ℓ minimization method for image restoration

Ill-posed problems arise in many areas of science and engineering. Their solutions, if they exist, are very sensitive to perturbations in the data. To reduce this sensitivity, the original problem may be replaced by a minimization problem with a fidelity term and a regularization term. We consider minimization problems of this kind, in which the fidelity term is the square of the ℓ2-norm of a discrepancy and the regularization term is the qth power of the ℓq-norm of the size of the computed solution measured in some manner. We are interested in the situation when

On Krylov projection methods and Tikhonov regularization

In the framework of large-scale linear discrete ill-posed problems, Krylov projection methods represent an essential tool since their development, which dates back to the early 1950\u2019s. In recent years, the use of these methods in a hybrid fashion or to solve Tikhonov regularized problems has received great attention especially for problems involving the restoration of digital images. In this paper we review the fundamental Krylov-Tikhonov techniques based on Lanczos bidiagonalization and the Arnoldi algorithms. Moreover, we study the use of the unsymmetric Lanczos process that, to the best of our knowledge, has just marginally been considered in this setting. Many numerical experiments and comparisons of different methods are presented

Adaptive Arnoldi-Tikhonov regularization for image restoration

In the framework of the numerical solution of linear systems arising from image restoration, in this paper we present an adaptive approach based on the reordering of the image approximations obtained with the Arnoldi-Tikhonov method. The reordering results in a modified regularization operator, so that the corresponding regularization can be interpreted as problem dependent. Numerical experiments are presented