# Vector Extrapolation Based Landweber Method for Discrete Ill-Posed Problems

Authors: Xi-Le Zhao; Ting-Zhu Huang; Xian-Ming Gu; Liang-Jian Deng
Journal: Mathematical Problems in Engineering
 (2017)

---

## Abstract

Landweber method is one of the classical iterative methods for solving linear discrete ill-posed problems. However, Landweber method generally converges very slowly. In this paper, we present the vector extrapolation based Landweber method, which exhibits fast and stable convergence behavior. Moreover, a restarted version of the vector extrapolation based Landweber method is proposed for practical considerations. Numerical results are given to illustrate the benefits of the vector extrapolation based Landweber method.


---

## Body

## 1. Introduction

Ill-posed inverse problems arise in many important applications, including astronomy, medical tomography, geophysics, sound source detection, and image deblurring (refer, e.g., to [1–6] and references therein). In this paper, we consider linear discrete ill-posed problems of the form (1)b=Axtrue+η,where b∈Rm is an observed vector, A∈Rm×m is a severely ill-conditioned matrix, and η∈Rm is an unknown additive noise. Popular methods for computing an approximation of xtrue are iterative regularization methods, which are very well suited for large-scale problems [3, 7]. Due to their fast convergence behaviors, Krylov subspace methods (e.g., CGLS [8, pp. 288–293], LSQR [9], and LSMR [10]) are usually considered to be superior to Landweber method (refer to Brianzi et al. [11] for an excellent overview of regularizing properties of Krylov subspace methods). However, the semiconvergence behavior of Krylov subspace methods is much more pronounced than that of Landweber method. This suggests that we are at high risk of computing a poor solution without good stopping criteria for Krylov subspace methods.Due to its simplicity and stability, Landweber method is still competitive with Krylov subspace methods in some real applications [12, 13]. Slow convergence behavior is the main practical disadvantage of Landweber method. Recently, the adaptive Landweber method, which updates parameters at each iteration, was advanced to speed up the convergence of Landweber method [14]. But if we do not have a good preset parameter, the performance of the adaptive Landweber method is almost the same as that of Landweber method. Vector extrapolation methods are often effective strategies to accelerate the convergence of vector sequences. This motivates us to combine vector extrapolation methods with Landweber method to refresh Landweber method by accelerating its convergence.The rest of this paper is organized as follows. In Section2, a brief review of popular vector extrapolation methods is provided. To accelerate the convergence of Landweber method, the vector extrapolation based Landweber method is established in Section 3. Moreover, a restarted version of the vector extrapolation based Landweber method is proposed for practical considerations. Numerical experiments from image deblurring are reported to show the performance of the vector extrapolation based Landweber method in Section 4. Finally, the paper closes with conclusions in Section 5.


## 2. Vector Extrapolation Methods

In this section, we briefly review popular vector extrapolation methods. Surveys and practical applications of the vector extrapolation methods can be found in [15–19]. Most popular vector extrapolation methods can be classified into two categories: the polynomial-type methods and the ϵ-algorithms [16]. In general, the polynomial-type methods are more economical than the ϵ-algorithms for solving large-scale systems of algebraic equations in terms of both computation and storage requirements. In the current study, we consider using the minimal polynomial extrapolation (MPE) method which is one of the efficient polynomial-type methods.Let{xj} be the vector sequence generated via (2)xj+1=Txj+b,j=0,1,…,where x0∈Cn is an initial vector. The MPE approximation sn,k to s, the desired limit or antilimit, is defined as (3)sn,k=∑i=0kγixn+i,with ∑i=0kγi=1. Define (4)ui=Δxi=xi+1-xi.Then γi are determined as follows:(i) Compute the least-squares solution of the overdetermined linear system(5)Uk-1nc=-un+k,where Uk-1(n)=[un|un+1|⋯|un+k-1] and c=(c0,c1,…,ck-1)T.(ii) Setck=1, and compute γi by (6)γi=ci∑i=0kci,0≤i≤k.Based on QR decomposition and LU decomposition, two fast and numerically stable implementations of the MPE method were presented in [20, 21].The following theorem in [22] illustrates the accelerating effect of the MPE method.Theorem 1.
Let the vector sequence{xn} be such that (7)xn=s+∑i=1pviλin,where v1,v2,…,vp are linearly independent vectors and λi are distinct nonzero scalars satisfying (8)λi≠1∀iand are ordered such that (9)λ1≥λ2≥⋯≥λp.Assume for some integers k<p that there holds (10)λk>λk+1.Then sn,k exists for all large n, and (11)sn,k-s=Oλk+1nasn⟶∞.Remark 2.
When the matrixT is diagonalizable and (I-T) is nonsingular, vector sequences {xn} satisfy the conditions of Theorem 1 [17]. In this case, all eigenvalues of the matrix T are different from 1, the scalars λ1,…,λp are some or all of the distinct nonzero eigenvalues of T, and the vectors vi are corresponding eigenvectors.


## 3. Vector Extrapolation Based Landweber Method

Landweber method is one of the simplest iterative regularization methods for solving linear discrete ill-posed problems (1). It follows the form (12)xj=xj-1+ωATb-Axj-1,where x0 is an initial vector and ω is a real parameter satisfying 0<ω<2ATA2-1. The filter factors for (12) are (13)fij=1-1-ωσi2j,i=1,…,m,in which the iteration number j plays the role of a regularization parameter [3].Remark 3.
At each iteration, the leading computational requirement for Landweber method is two matrix-vector multiplications. Imposing boundary conditions, the matrix-vector multiplication can be efficiently implemented via the corresponding fast transforms [23]. In this paper, we employed Neumann boundary conditions and the corresponding fast two-dimensional discrete cosine transform. The difference in boundary conditions may slightly affect the accuracies of image deblurring. For further discussions on this topic, we refer the interested readers to [23].Remark 4.
When solving the regularized linear system(ATA+λLTL)x=ATb by Landweber method, the matrix I-T is nonsingular if NA∩N(L)={0}. And if the point spread function (PSF) is symmetric, the matrices A, L, and ATA+LTL can be diagonalized by the two-dimensional discrete cosine transform. Thus, from Remark 2, we can conclude that vector sequences {xj} generated by (12) satisfy the conditions of Theorem 1 when solving the above regularized linear system.Although exhibiting stable convergence behavior, Landweber method converges too slowly to be a practical method. Recently, the adaptive Landweber method, which adaptively updates parameters, has been proposed to speed up the convergence of Landweber method [14]. Numerical experiments showed that, without a good preset parameter, the performance of the adaptive Landweber method is almost the same as that of Landweber method. One way to economically accelerate the convergence of vector sequences is to apply vector extrapolation methods. This motivates us to combine Landweber method with vector extrapolation methods to accelerate the convergence of Landweber method for practical use. The vector extrapolation based Landweber method for ill-posed problems (1) is proposed as follows.Algorithm 5.
(1)
Choose the integersk and p, the discrepancy principle factor νdp, the initial vector x0, and the parameter ω satisfying 0<ω<2ATA2-1.
(2)
Generate{x1,…,xp-1} by (12); set xn-1=xp-1.
(3)
Generate{xn,…,xn+k} by (12), and compute the MPE approximation sn,k by (3).
(4)
IfAsn,k-b2≤νdpη2, stop.
Otherwise setxi-1=xi for i=n,…,n+k, and go to step (3).Remark 6.
The discrepancy principle for parameter-choice is well suited for iterative regularization methods [7]. The stable convergence behavior of the vector extrapolation based Landweber method makes it easy to be terminated by the simplified discrepancy principle Asn,k-b2≤νdpη2. Recent developments of the parameter-choice methods (i.e., stopping rules) for Landweber-type methods are discussed in [24].Remark 7.
For akth-order MPE approximation, an m×k overdetermined linear system needs to be solved with complexity O(k2m) (see [8] for more details) and k+2 vectors need to be stored. Thus, one has to take computational and storage requirement into account in choosing the order k. And we observed that it is useful to perform some iterations before applying vector extrapolation methods in practice.It is not computationally desirable to solve anm×k overdetermined linear system after one Landweber iteration in Algorithm 5. For practical considerations, we can compute the kth-order MPE approximation after k+1 Landweber iterations and then restart this procedure using the MPE approximation as the initial vector. The restarted version of the vector extrapolation based Landweber method is proposed as follows.Algorithm 8.
(1)
Choose the integersp and k, the discrepancy principle factor νdp, the initial vector x0, and the parameter ω satisfying 0<ω<2ATA2-1.
(2)
Generate{x1,…,xp-1} by (12); set xn-1=xp-1.
(3)
Generate{xn,…,xn+k} by (12), and compute the MPE approximation sn,k by (3).
(4)
IfAsn,k-b2≤νdpη2, stop.
Otherwise setxn-1=sn,k, and go to step (3).


## 4. Numerical Experiments

In this section, we illustrate the performance of the vector extrapolation based Landweber method for typical linear discrete ill-posed problems (1) arising from image deblurring. In all tests, 1% white noise is added to the blurred images. The relative error (ReErr) is often used to measure the quality of solutions. It is defined as (14)ReErr=xcom-xtrue2xtrue2,where xcom and xtrue are the computed solution and the true solution, respectively. All the tests were carried out on a ThinkPad laptop with Intel(R) Core(TM) i3 CPU, 2.27 GHz, with 2 GB RAM, under Windows 7 operating system. Moreover, all the experimental results are obtained from using Matlab v7.10 (R2010a) implementation with double-precision floating-point arithmetic.Example 9.
The first example is a test problem from RestoreTools package [25]. The original image, the point spread function (PSF), and the blurred and noisy image are illustrated in Figure 1. Convergence histories of CGLS, Landweber method, and Algorithm 5 in Figure 2 show that Algorithm 5 converges faster than Landweber method and Algorithm 5 also has a more stable performance than CGLS. Moreover, restored images by Landweber method and Algorithm 5 in Figures 3 and 4 vividly illustrate that Algorithm 5 is superior to Landweber method.Figure 1
The true image (a), the point spread function (b), and the blurred and noisy image (c).
(a)
(b)
(c)Figure 2
Convergence histories of CGLS, Landweber method, and Algorithm5 with ω = 1.7.Figure 3
Restored images by Landweber method and Algorithm5.
(a)
(b)Figure 4
The non-strongly symmetric PSF.Example 10.
The aim of the second example is to make comparisons between the adaptive Landweber method and Algorithm5. Two original images as well as the corresponding blurred and noisy images with the PSF of Gaussian blur and the non-strongly symmetric PSF (see Figure 4) are shown in Figure 5. It is clearly observed from convergence histories in Figure 6 that Algorithm 5 converges faster than Landweber method and the adaptive Landweber method and the performance of the adaptive Landweber method is almost the same as that of Landweber method without a good preset parameter ω. The corresponding restored images by Landweber method, the adaptive Landweber method, and Algorithm 5 are given in Figure 7. We can safely conclude that Algorithm 5 outperforms Landweber method and the adaptive Landweber method in terms of both convergence speed and quality of recovery.Figure 5
The original image (a) and the corresponding blurred and noisy image with the PSF of Gauss blur (b). The original image (c) and the corresponding blurred and noisy image with the non-strongly symmetric PSF (d).
(a)
(b)
(c)
(d)Figure 6
Convergence histories of Landweber method, the adaptive Landweber method, and Algorithm5 with ω = 1.7 (a) and ω = 0.7 (b).
(a)
(b)Figure 7
The corresponding restored images by Landweber method ((a) and (d)), the adaptive Landweber method ((b) and (e)), and Algorithm5 ((c) and (f)) at iteration 35: ω = 1.7 and ω = 0.7 for (a), (b), and (c) and for (d), (e), and (f), respectively.
(a)
(b)
(c)
(d)
(e)
(f)Example 11.
We compare the performance of the vector extrapolation based Landweber method with its restarted version in the third example. For the test problem used in Example9, the vector extrapolation based Landweber method reaches the relative error of 0.3747 with 100 iterations and 97 MPE approximations, while its restarted version reaches the relative error of 0.3539 with 100 iterations and 31 MPE approximations. The corresponding restored image by the restarted version of the vector extrapolation based Landweber method (100 Landweber iterations and 31 MPE approximations) is given in Figure 8. The experiments confirm the favorable performance of the restarted version of the vector extrapolation based Landweber method both visually and in aspects of relative error and the number of MPE approximations.Figure 8
Restored image by the restarted version of the vector extrapolation based Landweber method withω = 1.7.


## 5. Conclusions

In this paper, we construct the vector extrapolation technique for accelerating the Landweber method, which is a classical iterative method for solving ill-posed problems (1). Moreover, both the properties and the practical implementation of the proposed method (including its restarted version) are well investigated. Numerical experiments have shown that the proposed methods are feasible, robust, and efficient.



---

*Source: 1375716-2017-11-16.xml*