Cadzow's basic algorithm, alternating projections and singular spectrum analysis

After observing a noisy time series or signal, it is common practice to try to separate the noise from the observed measurements. Singular value decomposition based methods are often used to split the observed signal into a number of components. Components associated with noise may be removed from the signal, and subsequent analyses may be undertaken. This paper will describe two methods commonly used to remove noise from a signal; the so-called singular spectrum analysis, and Cadzow’s basic algorithm. Connections between both methods will be drawn, and both will be related to the method of alternating projections, and structured low rank approximation (finding a lower rank approximation of a given matrix with specified structure). A simulation study and example based on real data will highlight and explain the differences between both methods. AMS 2000 subject classifications: Primary 62M10, 62M15; secondary 62P99.

[1]  Søren Holdt Jensen,et al.  Subspace-Based Noise Reduction for Speech Signals via Diagonal and Triangular Matrix Decompositions: Survey and Analysis , 2007, EURASIP J. Adv. Signal Process..

[2]  James A. Cadzow,et al.  Signal enhancement-a composite property mapping algorithm , 1988, IEEE Trans. Acoust. Speech Signal Process..

[3]  W. Cheney,et al.  Proximity maps for convex sets , 1959 .

[4]  N. Higham Computing the nearest correlation matrix—a problem from finance , 2002 .

[5]  Shih-Ping Han,et al.  A successive projection method , 1988, Math. Program..

[6]  Yariv Ephraim,et al.  A signal subspace approach for speech enhancement , 1995, IEEE Trans. Speech Audio Process..

[7]  Heinz H. Bauschke,et al.  On the convergence of von Neumann's alternating projection algorithm for two sets , 1993 .

[8]  V. Moskvina,et al.  Approximate Projectors in Singular Spectrum Analysis , 2002, SIAM J. Matrix Anal. Appl..

[9]  Thomas F. Quatieri,et al.  Speech analysis/Synthesis based on a sinusoidal representation , 1986, IEEE Trans. Acoust. Speech Signal Process..

[10]  Ivan Markovsky,et al.  Structured low-rank approximation and its applications , 2008, Autom..

[11]  Louis L. Scharf,et al.  Data adaptive rank-shaping methods for solving least squares problems , 1995, IEEE Trans. Signal Process..

[12]  F. Varadi,et al.  Searching for Signal in Noise by Random-Lag Singular Spectrum Analysis , 1999 .

[13]  Sabine Van Huffel,et al.  Total least squares problem - computational aspects and analysis , 1991, Frontiers in applied mathematics.

[14]  G. Golub,et al.  Inverse Eigenvalue Problems: Theory, Algorithms, and Applications , 2005 .

[15]  W. Glunt,et al.  An alternating projection algorithm for computing the nearest euclidean distance matrix , 1990 .

[16]  Anatoly A. Zhigljavsky,et al.  Analysis of Time Series Structure - SSA and Related Techniques , 2001, Monographs on statistics and applied probability.

[17]  Donald W. Tufts,et al.  Estimation of a signal waveform from noisy data using low-rank approximation to a data matrix , 1993, IEEE Trans. Signal Process..

[18]  Nina Golyandina,et al.  On the choice of parameters in Singular Spectrum Analysis and related subspace-based methods , 2010, 1005.4374.

[19]  F. Deutsch Accelerating the Convergence of the Method of Alternating Projections Via a Line Search: a Brief Survey , 2001 .

[20]  Hossein Hassani,et al.  Singular Spectrum Analysis: Methodology and Comparison , 2021, Journal of Data Science.

[21]  Bart De Moor,et al.  Total least squares for affinely structured matrices and the noisy realization problem , 1994, IEEE Trans. Signal Process..

[22]  Andrew L. Rukhin,et al.  Analysis of Time Series Structure SSA and Related Techniques , 2002, Technometrics.

[23]  D. Sornette,et al.  Data-adaptive wavelets and multi-scale singular-spectrum analysis , 1998, chao-dyn/9810034.

[24]  Sabine Van Huffel,et al.  Enhanced resolution based on minimum variance estimation and exponential data modeling , 1993, Signal Process..