Instead of the Tikhonov regularization method which with a scalar being the regularization parameter, Liu et al. [1] have proposed a novel regularization method with a vector as being the regularization parameter. As a continuation we further propose an optimally scaled vector regularization method (OSVRM) to solve the ill-posed linear problems, which is better than the Tikhonov regularization ...

Image restoration is an ill-posed inverse problem, which has been introduced the regularization method to suppress over-amplification. In this paper, we propose to apply the iterative regularization method to the image restoration problem and present a nested iterative method, called iterative conjugate gradient regularization method. Convergence properties are established in detail. Based on [...

The inverse problem in the diffuse optical tomography is known to be nonlinear, ill-posed, and sometimes under-determined, requiring regularization to obtain meaningful results, with Tikhonov-type regularization being the most popular one. The choice of this regularization parameter dictates the reconstructed optical image quality and is typically chosen empirically or based on prior experience...

this paper describes an efficient edge-preserved regularization algorithm for downward continuation of magnetic data in detection of unexploded ordnance (uxo). the magnetic anomalies arising from multi-source uxo can overlap at a height over the ground surface, while causative sources may not be readily separated due to low level of signal-to-noise ratio of the observed data. to effectively the...

Abstract. Tikhonov regularization is one of the most popular approaches to solve discrete ill-posed problems with error-contaminated data. A regularization operator and a suitable value of a regularization parameter have to be chosen. This paper describes an iterative method, based on Golub-Kahan bidiagonalization, for solving large-scale Tikhonov minimization problems with a linear regularizat...

We consider Tikhonov regularization of large linear discrete ill-posed problems with a regularization operator of general form and present an iterative scheme based on a generalized Krylov subspace method. This method simultaneously reduces both the matrix of the linear discrete ill-posed problem and the regularization operator. The reduced problem so obtained may be solved, e.g., with the aid ...