Hybrid and iteratively reweighted regularization by unbiased predictive risk and weighted GCV for projected systems

Abstract

Tikhonov regularization for projected solutions of large-scale ill-posed problems is considered. The Golub-Kahan iterative bidiagonalization is used to project the problem onto a subspace and regularization then applied to find a subspace approximation to the full problem. Determination of the regularization parameter for the projected problem by unbiased predictive risk estimation, generalized cross validation and discrepancy principle techniques is investigated. It is shown that the regularized parameter obtained by the unbiased predictive risk estimator can provide a good estimate for that to be used for a full problem which is moderately to severely ill-posed. A similar analysis provides the weight parameter for the weighted generalized cross validation such that the approach is also useful in these cases, and also explains why the generalized cross validation without weighting is not always useful. All results are independent of whether systems are over or underdetermined. Numerical simulations for standard one dimensional test problems and two dimensional data, for both image restoration and tomographic image reconstruction, support the analysis and validate the techniques. The size of the projected problem is found using an extension of a noise revealing function for the projected problem Hn\u etynková, Ple\u singer, and Strako\u s, [\textit{BIT Numerical Mathematics} {\bf 49} (2009), 4 pp. 669-696.]. Furthermore, an iteratively reweighted regularization approach for edge preserving regularization is extended for projected systems, providing stabilization of the solutions of the projected systems and reducing dependence on the determination of the size of the projected subspace.

References in corpus (3)

• Application of the ${\chi }^2$ principle and unbiased predictive risk estimator for determining the regularization parameter in 3D focusing gravity inversion
• Tomographic X-ray data of a walnut
• Some Results on the Regularization of LSQR for Large-Scale Discrete Ill-Posed Problems

Cited by in corpus (15)

• 3-D Projected $L_1$ inversion of gravity data
• A fast algorithm for regularized focused 3-D inversion of gravity data using the randomized SVD
• Efficient generalized Golub-Kahan based methods for dynamic inverse problems
• Total variation regularization of the $3$-D gravity inverse problem using a randomized generalized singular value decomposition
• A fast methodology for large-scale focusing inversion of gravity and magnetic data using the structured model matrix and the $2D$ fast Fourier transform
• A Joint Bidiagonalization Based Algorithm for Large Scale Linear Discrete Ill-posed Problems in General-Form Regularization
• An Inner-Outer Iterative Method for Edge Preservation in Image Restoration and Reconstruction
• Approximation Accuracy of the Krylov Subspaces for Linear Discrete Ill-Posed Problems
• Computational methods for large-scale inverse problems: a survey on hybrid projection methods
• Double precision is not necessary for LSQR for solving discrete linear ill-posed problems
• The Krylov Subspaces, Low Rank Approximations and Ritz Values of LSQR for Linear Discrete Ill-Posed Problems: the Multiple Singular Value Case
• Convergence of Regularization Parameters for Solutions Using the Filtered Truncated Singular Value Decomposition
• Hybrid Projection Methods for Large-scale Inverse Problems with Mixed Gaussian Priors
• Adaptive Regularization Parameter Choice Rules for Large-Scale Problems
• On inner iterations of the joint bidiagonalization based algorithms for solving large scale ill-posed problems