Recovery of low-rank plus compressed sparse matrices with application to unveiling traffic anomalies

IEEE Transactions on Information Theory

Volumn 59, Issue 8, 2013, Pages 5186-5205

  Mardani, Morteza ^a   Mateos, Gonzalo ^a   Giannakis, Georgios B ^a  

^a University of Minnesota   (United States)

Author keywords

Convex optimization; identifiability; low rank; sparsity; traffic volume anomalies

Indexed keywords

ANALYSIS AND SIMULATION; FIRST-ORDER ALGORITHMS; IDENTIFIABILITY; LOW RANK; NON-SMOOTH CONVEX OPTIMIZATIONS; SPARSITY; TRAFFIC ANOMALY DETECTIONS; TRAFFIC VOLUMES;

COMPLEX NETWORKS; COMPUTER SYSTEM RECOVERY; CONVEX OPTIMIZATION; CONVEX PROGRAMMING; ITERATIVE METHODS; MATRIX ALGEBRA;

RECOVERY;

EID: 84873863112     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2013.2257913     Document Type: Article

References (55)

1. [Online]. Available: http://internet2.edu/observatory/archive/data- collections. html
2. A. Agarwal, S. Negahban, and M. J. Wainright, "Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions," Ann. Statist., vol. 40, pp. 1171-1197, Sep. 2012.
3. R.Basri and D. Jacobs, "Lambertian reflectance and linear subspaces," IEEE Trans. Pattern Anal. Mach. Intell., vol. 25, no. 2, pp. 218-233, Feb. 2003.
4. A. Beck and M. Teboulle, "A fast iterative shrinkage-thresholding algorithm for linear inverse problems," SIAM J. Imag. Sci., vol. 2, pp. 183-202, Jan. 2009.
5. D. P. Bertsekas, Nonlinear Programming, 2nd ed. Belmont, MA, USA: Athena-Scientific, 1999.
6. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, 2nd ed. Belmont, MA, USA: Athena-Scientific, 1999.
7. P. J. Bickel, Y. Ritov, and A. Tsybakov, "Simultaneous analysis of Lasso and Dantzig selector," Ann. Statist., vol. 37, pp. 1705-1732,Apr. 2009.
8. B. Bollobas, Random Graphs. Cambridge, U.K.: Cambridge Univ. Press, 2001.
9. S. Boyd,N. Parikh, E. Chu, B. Peleato, and J. Eckstein, "Distributed optimization and statistical learning via the alternating direction method of multipliers," Found. Trends Mach. Learn., vol. 3, pp. 1-122, 2011.
10. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
11. E. J. Candès, X. Li, Y. Ma, and J.Wright, "Robust principal component analysis?," J. ACM, vol. 58, no. 1, pp. 1-37, 2011.
12. E. J. Candès and Y. Plan, "Matrix completion with noise," Proc. IEEE, vol. 98, no. 6, pp. 925-936, Jun. 2009.
13. E. J. Candès and B. Recht, "Exact matrix completion via convex optimization," Found. Comput. Math., vol. 9, no. 6, pp. 717-772, 2009.
14. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006. (Pubitemid 43174093)
15. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005. (Pubitemid 41800353)
16. E. J. Candès and M. B. Wakin, "An introduction to compressive sampling," IEEE Signal Process. Mag., vol. 25, no. 2, pp. 14-20, Mar. 2008.
17. V. Chandrasekaran, S. Sanghavi, P. R. Parrilo, and A. S. Willsky, "Rank-sparsity incoherence for matrix decomposition," SIAM J. Optim., vol. 21, no. 2, pp. 572-596, 2011.
18. Y. Chen, A. Jalali, S. Sanghavi, and C. Caramanis, "Low-rank matrix recovery from errors and erasures," IEEE Trans. Inf. Theory, 2013, (see also arXiv:1104.0354v2[cs.IT]).
19. Q. Chenlu and N. Vaswani, "Recursive sparse recovery in large but correlated noise," in Proc. 49th Allerton Conf. Commun., Control, Comput., Sep. 2011, pp. 752-759.
20. A. Chistov and D. Grigorev, "Complexity of quantifier elimination in the theory of algebraically closed fields," in Math. Found. of Computer Science. Berlin, Germany: Springer-Verlag, 1984, vol. 176, Lecture Notes in Computer Science, pp. 17-31.
21. F. Deutsch, Best Approximation in Inner Product Spaces, 2nd ed. New York, NY, USA: Springer-Verlag, 2001.
22. X. Ding, L. He, and L. Carin, "Bayesian robust principal component analysis," IEEE Trans. Image Process., vol. 20, no. 12, pp. 3419-3430, Dec. 2011.
23. D. L. Donoho andM. Elad, "Optimally sparse representation in general (nonorthogonal) dictionaries via minimization," Proc. Natl. Acad. Sci., vol. 100, pp. 2197-2202, Mar. 2003. (Pubitemid 36297476)
24. J. Finn, K. Nael, V. Deshpande, O. Ratib, and G. Laub, "Cardiac MR imaging: State of the technology," Radiology, vol. 241, no. 2, pp. 338-354, 2006. (Pubitemid 44632879)
25. H. Gao, "Prior rank, intensity and sparsity model (PRISM): A divide-and-conquer matrix decomposition model with low-rank coherence and sparse variation," presented at the SPIE Opt. Eng. Appl., 2012.
26. H. Gao, J. Cai, Z. Shen, and H. Zhao, "Robust principal component analysis-based four-dimensional computed tomography," Phys. Med. Biol., vol. 56, no. 11, pp. 3181-3198, 2011.
27. B. He and X. Yuan, On the convergence rate of alternating direction method Nanjing Univ., Nanjing, China, Tech. Rep., 2011.
28. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
29. P. Huang, S. D. Chen, P. Smaragdis, and M. Hasegawa-Johnson, "Singing-voice separation from monaural recordings using robust principal component analysis," in Proc. Int. Conf. Acoust., Speech Signal Process., Kyoto, Japan, Mar. 2012, pp. 57-60.
30. M. G. Jafari and M. D. Plumbley, "Fast dictionary learning for sparse representations of speech signals," IEEE J. Sel. Topics Signal Process., vol. 5, no. 5, pp. 1025-1031, Sep. 2011.
31. I. T. Jolliffe, Principal Component Analysis. NewYork,NY,USA: Springer, 2002.
32. A. Lakhina, M. Crovella, and C. Diot, "Diagnosing network-wide traffic anomalies," in Proc. ACM SIGCOMM, Portland, OR, USA, Aug. 2004, pp. 219-230. (Pubitemid 40954882)
33. Y. Li and D. Wang, "Separation of singing voice from music accompaniment for monaural recordings," IEEE Trans. Audio, Speech, Lang. Process., vol. 15, no. 4, pp. 1475-1487, May 2007.
34. Z. Lin, A. Ganesh, J.Wright, L.Wu, M. Chen, and Y. Ma, Fast convex optimization algorithms for exact recovery of a corrupted low-rankmatrix Univ. Illinois at Urbana-Champaign, Urbana, USA, 2009, Tech. Rep. UILU-ENG-09-2214.
35. B. Madore et al., "Unaliasing by Fourier-encoding the overlaps using the temporal dimension (UNFOLD), applied to cardiac imaging and fMRI," Magn. Reson. Med., vol. 42, no. 5, pp. 813-828, 1999. (Pubitemid 29521471)
36. M.Mardani, G.Mateos, and G. B. Giannakis, "Unveiling anomalies in large-scale networks via sparsity and low rank," in Proc. 45th Asilomar Conf. Signal, Syst. Comput., Pacific Grove, CA, USA, Nov. 2011, pp. 403-407.
37. M. Mardani, G. Mateos, and G. B. Giannakis, "In-network sparsityregularized rank minimization: Applications and algorithms," IEEE Trans. Signal Process., 2013, (see also arXiv:1203.1507v1 [cs.MA]).
38. M. Mardani, G. Mateos, and G. B. Giannakis, "Dynamic anomalography: Tracking network anomalies via sparsity and low rank," IEEE J. Sel. Topics Signal Process., vol. 7, no. 1, pp. 50-66, Feb. 2013.
39. G. Mateos, J. A. Bazerque, and G. B. Giannakis, "Distributed sparse linear regression," IEEE Trans. Signal Process., vol. 58, no. 10, pp. 5262-5276, Oct. 2010.
40. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, pp. 227-234, 1995.
41. Y. Nesterov, "A method of solving a convex programming problem with convergence rate ," Soviet Math. Doklady, vol. 27, pp. 372-376, 1983.
42. Y. Nesterov, "Smooth minimization of nonsmooth functions," Math. Prog., vol. 103, pp. 127-152, 2005.
43. H. Rauhut, "Compressive sensing and structured random matrices," Theor. Found. Numer. Methods Sparse Recov., vol. 9, pp. 1-92, 2010.
44. M. Roughan, Y. Zhang, W. Willinger, and L. Qiu, "Spatio-temporal compressive sensing and internet traffic matrices," IEEE/ACM Trans. Netw., vol. 20, no. 3, pp. 662-676, Jun. 2012.
45. M. Rudelson and R. Vershynin, "Sampling from large matrices: An approach through geometric functional analysis," J. ACM, vol. 54, pp. 1-20, Dec. 2006.
46. P. Sprechmann, A. M. Bronstein, and G. Sapiro, "Real-time online singing voice separation from monaural recordings using robust lowrank modeling," presented at the Annu. Conf. Int. Soc. Music Inf. Retriev., Porto, Portugal, Oct. 2012.
47. M. Talagrand, "New concentration inequalities in product spaces," Invent. Math., vol. 126, pp. 505-563, Dec. 1996. (Pubitemid 126323770)
48. M. Thottan and C. Ji, "Anomaly detection in IP networks," IEEE Trans. Signal Process., vol. 51, no. 8, pp. 2191-2204, Aug. 2003.
49. K.-C. Toh and S. Yun, "An accelerated proximal gradient algorithm for nuclear norm regularized least-squares problems," Pacific J. Opt., vol. 6, pp. 615-640, 2010.
50. A. E.Waters, A. C. Sankaranarayanan, and R. G. Baraniuk, "SpaRCS: Recovering low-rank and sparse matrices from compressive measurements," presented at the Proc. Neural Inf. Process. Syst., Granada, Spain, Dec. 2011.
51. J. Wright, A. Ganesh, and K. M. Y. Ma, "Compressive principal component pursuit," inProc. Int. Symp. Inf. Theory, Cambridge,MA, USA, Jul. 2012, pp. 1276-1280.
52. L. Xing et al., "Overview of image-guided radiation therapy," Med. Dosimetry, vol. 31, no. 2, pp. 91-112, 2006.
53. H. Xu, C. Caramanis, and S. Sanghavi, Robust PCA via Outlier Pursuit 2010 [Online]. Available: arXiv:1010.4237v2[cs.LG]
54. Y. Zhang, Z. Ge, A. Greenberg, and M. Roughan, "Network anomography," in Proc. Internet Meas. Conf., Berkeley, CA, USA, Oct. 2005, pp. 317-330.
55. Z. Zhou, X. Li, J. Wright, E. Candès, and Y. Ma, "Stable principal component pursuit," in Proc. Int. Symp. Inf. Theory, Austin, TX, USA, Jun. 2010, pp. 1518-1522.