Skip to main content

Least squares and total least squares methods in image restoration

  • Conference paper
  • First Online:
Numerical Analysis and Its Applications (WNAA 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1196))

Included in the following conference series:

Abstract

Image restoration is the process of removing or minimizing degradations (blur) in an image. Mathematically, it can be modeled as a discrete ill-posed problem Hf=g, where H is a matrix of large dimension representing the blurring phenomena, and g is a vector representing the observed image. Often H is severely ill-conditioned, and both H and g are corrupted with noise. Regularization is used to reduce the noise sensitivity of the numerical scheme. Most of these methods, however, assume that there is no noise in H, and therefore least squares techniques are used to reconstruct f. In some applications, though, H is also corrupted with noise. In this case a total least squares approach may be more appropriate. These least squares and total least squares methods will be investigated in the context of signal restoration.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chan, R., Nagy, J., Plemmons, R.: Circulant preconditioned Toeplitz least squares iterations. SIAM J. Matrix Anal. Appl. 15 (1994) 80–97.

    Google Scholar 

  2. Fierro, R., Golub, G., Hansen, P., O'Leary, D.: Regularization by truncated total least squares. Technical Report UNIC-93-14, UNI•C, Technical University of Denmark, 1993.

    Google Scholar 

  3. Fish, D., Grochmalicki, J., Pike, E.: Scanning singular-value-decomposition method for restoration of images with space-variant blur. J. Opt. Soc. Am. A 13 (1996) 1–6.

    Google Scholar 

  4. Franklin, J.: Minimum principles for ill-posed problems. SIAM J. Math. Anal. 9 (1978) 638–650.

    Google Scholar 

  5. Golub, G., Van Loan, C.: An analysis of the total least squares problem. SIAM J. Numer. Anal. 17 (1980) 883–893.

    Google Scholar 

  6. Groetsch, C.: The theory of Tikhonov regularization for Fredholm integral equations of the first kind. Pitman, Boston, 1984.

    Google Scholar 

  7. Hanke, M.: Conjugate Gradient Type Methods for Ill-Posed Problems. Pitman Research Notes in Mathematics, Longman Scientific & Technical, Harlow, Essex, 1995.

    Google Scholar 

  8. Hanke, M., Hansen, P.: Regularization methods for large-scale problems. Surv. Math. Ind. 3 (1993) 253–315.

    Google Scholar 

  9. Hanke, M., Nagy, J.: Restoration of atmospherically blurred images by symmetric indefinite conjugate gradient techniques. Inverse Problems 12 (1996) 157–173.

    Google Scholar 

  10. Hanke, M., Nagy, J., Plemmons, R.: Preconditioned iterative regularization. In Numerical Linear Algebra, Reichel, L., Ruttan, A., Varga, R., eds., pages 141–163, de Gruyter, Berlin, 1993.

    Google Scholar 

  11. Hansen, P.: The truncated SVD as a method for regularization. BIT 27 (1987) 534–553.

    Google Scholar 

  12. Hansen, P.: Regularization tools: A Matlab package for the analysis and solution of discrete ill-posed problems. Numerical Algorithms 6 (1994) 1–35.

    Google Scholar 

  13. Van Huffel, S., Vandewalle, J.: The Total Least Squares Problem: Computational Aspects and Analysis. SIAM, Philadelphia, 1991.

    Google Scholar 

  14. Jain, A.: Fundamentals of Digital Image Processing. Prentice-Hall, Englewood Cliffs, NJ, 1989.

    Google Scholar 

  15. Mesarović, V., Galatsanos, N., Katsaggelos, A.: Regularized constrained total least squares image restoration. IEEE Trans. Image Proc. 4 (1995) 1096–1108.

    Google Scholar 

  16. De Moor, B.: Structured total least squares and L 2 approximation problems. Linear Algebra Appl. 188 (1993) 189:163–205.

    Google Scholar 

  17. Nagy, J.: Fast inverse QR factorization for Toeplitz matrices. SIAM J. Sci. Comput., 14 (1993) 1174–1193.

    Google Scholar 

  18. Plato, R.: Optimal regularization for linear ill-posed problems yield regularization methods. Numer. Funct. Anal. and Optimiz. 11 (1990) 111–118.

    Google Scholar 

  19. Trussell, H.: Convergence criteria for iterative restoration methods. IEEE Trans. Acoust., Speech, Signal Processing 31 (1983) 129–136.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lubin Vulkov Jerzy Waśniewski Plamen Yalamov

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kamm, J., Nagy, J.G. (1997). Least squares and total least squares methods in image restoration. In: Vulkov, L., Waśniewski, J., Yalamov, P. (eds) Numerical Analysis and Its Applications. WNAA 1996. Lecture Notes in Computer Science, vol 1196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62598-4_96

Download citation

  • DOI: https://doi.org/10.1007/3-540-62598-4_96

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62598-8

  • Online ISBN: 978-3-540-68326-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics