Online subspace and sparse filtering for target tracking in reverberant environment

This paper proposes a class of joint subspace and sparse filtering algorithms with an example application in tracking moving targets in highly reverberant environment. Motivated by recent work in low-rank and sparse matrix decomposition, we have developed filtering algorithms that alternate between tracking the low-rank subspace and estimating the instantaneously sparse components, both of which are recursively updated as new data arrives. The algorithms are particularly suitable for online applications with streaming data or sequential processing of extremely large data sets for which matrix decomposition is computationally infeasible. In contrast to simple signal and noise subspace decomposition in traditional subspace processing, the algorithms we describe here assume a generative model consisting of a low-rank subspace, an additional sparse component and noise. This approach is well suited for tracking a sparse moving target signal in the presence of low-rank reverberations. We demonstrate the target tracking performance via a set of beam space field data.

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

[2]  George V. Moustakides,et al.  Fast and Stable Subspace Tracking , 2008, IEEE Transactions on Signal Processing.

[3]  John Wright,et al.  Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization , 2009, NIPS.

[4]  Roland Badeau,et al.  Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking , 2008, IEEE Transactions on Signal Processing.

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

[6]  Roland Badeau,et al.  Sliding window adaptive SVD algorithms , 2004, IEEE Transactions on Signal Processing.

[7]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[8]  D.W. Tufts,et al.  Efficient and Accurate Rectangular Window Subspace Tracking , 2006, Fourth IEEE Workshop on Sensor Array and Multichannel Processing, 2006..

[9]  Nathan Halko,et al.  Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..

[10]  Sham M. Kakade,et al.  Robust Matrix Decomposition With Sparse Corruptions , 2011, IEEE Transactions on Information Theory.

[11]  Constantine Caramanis,et al.  Robust PCA via Outlier Pursuit , 2010, IEEE Transactions on Information Theory.

[12]  Xi Chen,et al.  Direct Robust Matrix Factorizatoin for Anomaly Detection , 2011, 2011 IEEE 11th International Conference on Data Mining.

[13]  G. Golub,et al.  Tracking a few extreme singular values and vectors in signal processing , 1990, Proc. IEEE.

[14]  Pablo A. Parrilo,et al.  Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..

[15]  Thomas Kailath,et al.  Fast subspace decomposition , 1994, IEEE Trans. Signal Process..

[16]  Dacheng Tao,et al.  Bilateral random projections , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[17]  Dacheng Tao,et al.  GoDec: Randomized Lowrank & Sparse Matrix Decomposition in Noisy Case , 2011, ICML.

[18]  Martin J. Wainwright,et al.  Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions , 2011, ICML.

[19]  John C. S. Lui,et al.  Online Robust Subspace Tracking from Partial Information , 2011, ArXiv.