Yet another subspace tracker

The paper introduces a new algorithm for tracking the dominant subspace of the correlation matrix associated with time series. This algorithm greatly outperforms many well-known subspace trackers in terms of subspace estimation. Moreover, it guarantees the orthonormality of the subspace weighting matrix at each iteration, and reaches the lowest complexity found in the literature.

[1]  Carlos E. Davila,et al.  Efficient, high performance, subspace tracking for time-domain data , 2000, IEEE Trans. Signal Process..

[2]  Yingbo Hua,et al.  Fast subspace tracking and neural network learning by a novel information criterion , 1998, IEEE Trans. Signal Process..

[3]  Y. Hua,et al.  Fast orthonormal PAST algorithm , 2000, IEEE Signal Processing Letters.

[4]  Ilkka Karasalo,et al.  Estimating the covariance matrix by signal subspace averaging , 1986, IEEE Trans. Acoust. Speech Signal Process..

[5]  Daniel J. Rabideau,et al.  Fast, rank adaptive subspace tracking and applications , 1996, IEEE Trans. Signal Process..

[6]  Bin Yang,et al.  Projection approximation subspace tracking , 1995, IEEE Trans. Signal Process..

[7]  P. Strobach Low-rank adaptive filters , 1996, IEEE Trans. Signal Process..

[8]  Peter Strobach,et al.  Fast recursive subspace adaptive ESPRIT algorithms , 1998, IEEE Trans. Signal Process..

[9]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[10]  Roland Badeau,et al.  Fast approximated power iteration subspace tracking , 2005, IEEE Transactions on Signal Processing.