PETRELS: Subspace estimation and tracking from partial observations

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn , Issue , 2012, Pages 3301-3304

  Chi, Yuejie ^a   Eldar, Yonina C ^b   Calderbank, Robert ^c  

^a Princeton University   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c Duke University   (United States)

Author keywords

matrix completion; recursive least squares; subspace estimation and tracking

Indexed keywords

BATCH ALGORITHMS; DATA STREAM; DIRECTION OF ARRIVAL ESTIMATION; LEAST-SQUARES ESTIMATION; LINEAR SUBSPACE; LONG-TERM BEHAVIOR; LOW-DIMENSIONAL SUBSPACE; LOW-RANK MATRICES; MATRIX COMPLETION; NUMERICAL EXAMPLE; ON-LINE FASHION; PARALLEL ESTIMATION; PARTIAL OBSERVATION; RECURSIVE LEAST SQUARE (RLS); RECURSIVE PROCEDURE; STATE OF THE ART; SUBSPACE ESTIMATION;

ALGORITHMS; DATA COMMUNICATION SYSTEMS; SIGNAL PROCESSING;

ESTIMATION;

EID: 84867591047     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2012.6288621     Document Type: Conference Paper

References (16)

1. T. Ahmed, M. Coates, and A. Lakhina, "Multivariate online anomaly detection using kernel recursive least squares," Proc. 26th IEEE International Conference on Computer Communications, pp. 625-633, 2007.
2. S. Shahbazpanahi, S. Valaee, and M. H. Bastani, "Distributed source localization using esprit algorithm," IEEE Transactions on Signal Processing, vol. 49, no. 10, p. 21692178, 2001.
3. R. Kumaresan and D. Tufts, "Estimating the angles of arrival of multiple plane waves," IEEE Transactions On Aerospace And Electronic Systems, vol. AES-19, no. 1, pp. 134-139, 1983.
4. A. H. Sayed, Fundamentals of Adaptive Filtering. Wiley, NY, 2003.
5. B. Yang, "Projection approximation subspace tracking," IEEE Transactions on Signal Processing, vol. 43, no. 1, pp. 95-107, 1995.
6. K. Crammer, "Online tracking of linear subspaces," In Proc. COLT 2006, vol. 4005, pp. 438-452, 2006.
7. E. J. Candés and T. Tao, "The power of convex relaxation: Near-optimal matrix completion," IEEE Trans. Inform. Theory, vol. 56, no. 5, pp. 2053-2080, 2009.
8. L. Balzano, B. Recht, and R. Nowak, "High-dimensional matched subspace detection when data are missing," in Proc. ISIT, June 2010.
9. L. Balzano, R. Nowak, and B. Recht, "Online identification and tracking of subspaces from highly incomplete information," Proc. Allerton 2010, 2010.
10. W. Dai, O. Milenkovic, and E. Kerman, "Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion," IEEE Trans. Signal Processing, p. submitted, 2010.
11. R. Roy and T. Kailath, "ESPRIT-Estimation of signal parameters via rotational invariance techniques," IEEE Trans. on Acoustics, Speech, Signal Processing, vol. 37, no. 7, pp. 984-995, Jul. 1989.
12. K. Gedalyahu and Y. C. Eldar, "Time-delay estimation from low-rate samples: A union of subspaces approach," IEEE Trans. on Signal Processing, vol. 58, no. 6, pp. 3017-3031, 2010.
13. Z. Wen, W. Yin, and Y. Zhang, "Solving a low-rank factorization model for matrix completion by a non-linear successive over-relaxation algorithm," Rice CAAM Tech Report TR10-07, 2010.
14. S. Ma, D. Goldfarb, and L. Chen, "Fixed point and Bregman iterative methods for matrix rank minimization," Mathematical Programming, vol. 1, no. 1, pp. 1-27, 2009.
15. J.-F. Cai, E. J. Candes, and Z. Shen, "A singular value thresholding algorithm for matrix completion," SIAM Journal on Optimization, vol. 20, no. 4, pp. 1-28, 2008.
16. R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from noisy entries," Preprint, pp. 1-9, 2009. [Online]. Available: http://arxiv.org/abs/0906.2027v1