Abstract
Linear systems of equations and linear least-squares problems with a matrix whose singular values “cluster” at the origin and with an error-contaminated data vector arise in many applications. Their numerical solution requires regularization, i.e., the replacement of the given problem by a nearby one, whose solution is less sensitive to the error in the data. The amount of regularization depends on a parameter. When an accurate estimate of the norm of the error in the data is known, this parameter can be determined by the discrepancy principle. This paper is concerned with the situation when the error is white Gaussian and no estimate of the norm of the error is available, and explores the possibility of applying a denoising method to both reduce this error and to estimate its norm. Applications to image deblurring are presented.
Similar content being viewed by others
References
Björck, Å.: A bidiagonalization algorithm for solving ill-posed system of linear equations. BIT 28, 659–670 (1988)
Brezinski, C., Rodriguez, G., Seatzu, S.: Error estimates for the regularization of least squares problems. Numer. Algorithms 51, 61–76 (2009)
Chang, S.G.: Adaptive wavelet thresholding for image denoising and compression. IEEE Trans. Image Process. 9, 1532–1546 (2000)
D’Agostino, R., Pearson, E.S.: Tests for departure from normality. Empirical results for the distributions of b2 and \(\sqrt {b1}\). Biometrika 60, 613–622 (1973)
D’Agostino, R., Tietjen, G.L.: Simulation probability points of b2 for small samples. Biometrika 58, 669–672 (1971)
Donoho, D.: De-noising by soft-thresholding. IEEE Trans. Inf. Theory 41, 613–627 (1995)
Donoho, D., Johnstone, I.M.: Adapting to unknown smoothness via wavelet shrinkage. J. Am. Stat. Assoc. 91, 1200–1224 (1995)
Eldén, L.: Algorithms for the regularization of ill-conditioned least squares problems. BIT 17, 134–145 (1977)
Engl, H.W., Hanke, M., Neubauer, A.: Regularization of Inverse Problems. Kluwer, Dordrecht (1996)
Fisher, R.A.: The moments of the distribution for normal samples of measures of departure from normality. Proc. R. Soc. Lond. Ser. A 130, 16–28 (1930)
Hansen, P.C.: Analysis of discrete ill-posed problems by means of the L-curve. SIAM Rev. 34, 561–580 (1992)
Hansen, P.C.: Rank-Deficient and Discrete Ill-Posed Problems. SIAM, Philadelphia (1988)
Hansen, P.C., Regularization tools version 4.0 for Matlab 7.3. Numer. Algorithm. 46, 189–194 (2007)
Hansen, P.C., Kilmer, M.E., Kjeldsen, R.: Exploiting residual information in the parameter choice for discrete ill-posed problems. BIT 46, 41–59 (2006)
Hearn, T.A., Reichel, L.: Image Denoising via Residual Kurtosis Minimization. Submitted for publication.
Hochstenbach, M.E., McNinch, N., Reichel, L.: Discrete ill-posed least-squares problems with a solution norm constraint. Linear Algebra Appl. 436, 3801–3818 (2012)
Hyvärinen, A., Karhunen, J., Oja, E.: Independent Component Analysis. Wiley, New York (2001)
Kindermann, S.: Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems. Electron. Trans. Numer. Anal. 38, 233–257 (2011)
Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. SIAM, Philadelphia (1995). First published by Prentice-Hall in 1974
Mead, J., Renaut, R.A.: A Newton root-finding algorithm for estimating the regularization parameter for solving ill-conditioned least squares problems. Inverse Probl. 25, 025002 (2009)
Morigi, S., Reichel, L., Sgallari, F.: Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems. Numer. Algorithm. 53, 1–22 (2010)
Morigi, S., Reichel, L., Sgallari, F.: Cascadic multilevel methods for fast nonsymmetric blur- and noise-removal. Appl. Numer. Math. 60, 378–396 (2010)
Morigi, S., Reichel, L., Sgallari, F.: A cascadic alternatingKrylov subspace image restoration method. In: Kuijper, A. et al., (eds.) Scale Space and Variational Methods in Computer Vision. Lecture Notes in Computer Science, vol. 7893, pp. 98–108. Springer, Berlin (2013)
Nocedal, J., Wright, S.: Numerical Optimization. Springer, New York (1999)
Neuman, A., Reichel, L., Sadok, H.: Implementations of range restricted iterative methods for linear discrete ill-posed problems. Linear Algebra Appl. 436, 3974–3990 (2012)
Neuman, A., Reichel, L., Sadok, H.: Algorithms for range restricted iterative methods for linear discrete ill-posed problems. Numer. Algorithm. 59, 325–331 (2012)
Reichel, L., Rodriguez, G.: Old and new parameter choice rules for discrete ill-posed problems. Numer. Algorithm. 63, 65–87 (2013)
Rudin, L., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D. 60, 259–268 (1992)
Vogel, C., Oman, M.: Iterative methods for total variation denoising. SIAM J. Sci. Comput. 17, 227–238 (1996)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by NSF grant DMS-1115385.
Rights and permissions
About this article
Cite this article
Hearn, T.A., Reichel, L. Application of denoising methods to regularizationof ill-posed problems. Numer Algor 66, 761–777 (2014). https://doi.org/10.1007/s11075-013-9760-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-013-9760-5