Skip to main content
SpringerLink
Log in

A symmetric rank-revealing toeplitz matrix decomposition

  • Published:
Journal of VLSI signal processing systems for signal, image and video technology Aims and scope Submit manuscript

Abstract

In signal and image processing, regularization often requires a rank-revealing decomposition of a symmetric Toeplitz matrix with a small rank deficiency. In this paper, we present an efficient factorization method that exploits symmetry as well as the rank and Toeplitz properties of the given matrix.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F.T. Luk and D. Vandevoorde, “SVD-based analysis of image boundary distortion”, inSVD and Signal Processing, III: Algorithms, Analysis and Applications, M. Moonen and B. De Moor, Eds., Elsevier, Amsterdam, pp. 305–313, 1995.

    Chapter  Google Scholar 

  2. J.G. Nagy, “Fast algorithms for the regularization of banded Toeplitz least squares problems”, inProc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, F.T. Luk, Ed., SPIE, Bellingham, 1994, WA, pp. 566–575.

    Chapter  Google Scholar 

  3. H.C. Andrews and B.R. Hunt,Digital Image Restoration, Prentice-Hall, Englewood Cliffs, NJ, 1977.

    Google Scholar 

  4. P.C. Hansen, “The truncated SVD as a method for regularization”,BIT, Vol. 27, pp. 534–553, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  5. G.W. Stewart, “An updating algorithm for subspace tracking”,IEEE Trans. Signal Proc., Vol. 40, pp. 1535–1541, 1992.

    Article  Google Scholar 

  6. J. Chun, T. Kailath, and H. Lev-Ari, “Fast parallel algorithms for QR and triangular factorization”,SIAM J. Sci. Stat. Comput., Vol. 8, No. 6, pp. 899–913, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  7. G.H. Golub and C.F. Van Loan,Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Rensselaer Polytechnic Institute, 12180, Troy, New York, USA

    Franklin T. Luk

  2. Communications Research Laboratory, McMaster University, L8S 4K1, Hamilton, Ontario, Canada

    Sanzheng Qiao

Authors
  1. Franklin T. Luk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanzheng Qiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Luk, F.T., Qiao, S. A symmetric rank-revealing toeplitz matrix decomposition. J VLSI Sign Process Syst Sign Image Video Technol 14, 19–28 (1996). https://doi.org/10.1007/BF00925265

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00925265

Keywords

Search

Navigation