{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:48:23Z","timestamp":1753602503784,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1109\/ijcnn.2017.7965967","type":"proceedings-article","created":{"date-parts":[[2017,7,10]],"date-time":"2017-07-10T21:41:30Z","timestamp":1499722890000},"page":"1041-1048","source":"Crossref","is-referenced-by-count":10,"title":["Online compressed robust PCA"],"prefix":"10.1109","author":[{"given":"Pingbo","family":"Pan","sequence":"first","affiliation":[]},{"given":"Jiashi","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Ling","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Yang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.2307\/1968346"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TIT.2010.2054251"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1073\/pnas.0709640104"},{"year":"2015","author":"lois","journal-title":"Online matrix completion and online robust pca","key":"ref13"},{"key":"ref14","article-title":"Avoiding optimal mean robust pca\/2dpca with non-greedy 11-norm maximization","author":"luo","year":"2016","journal-title":"International Joint Conference on Artificial Intelligence"},{"key":"ref15","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","volume":"11","author":"mairal","year":"2010","journal-title":"The Journal of Machine Learning Research"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"ref17","first-page":"1433","article-title":"Robust principal component analysis with non-greedy 11-norm maximization","volume":"22","author":"nie","year":"2011","journal-title":"International Joint Conference on Artificial Intelligence"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TPAMI.2011.282"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1137\/070697835"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/CVPR.2011.5995548"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1145\/2910585","article-title":"A convex sparse PCA for feature analysis","author":"chang","year":"2016","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"ref27","article-title":"Exact recoverability of robust pca via outlier pursuit with tight recovery bounds","author":"zhang","year":"2015","journal-title":"Twenty-Ninth AAAI Conference on Artificial Intelligence"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/1970392.1970395"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1023\/A:1023709501986"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1006\/acha.2000.0313"},{"key":"ref8","first-page":"404","article-title":"Online robust pca via stochastic optimization","author":"feng","year":"2013","journal-title":"Advances in neural information processing systems"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1137\/1.9781611973075.53"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.2307\/2346896"},{"year":"2014","author":"guo","journal-title":"An online algorithm for separating sparse and low-dimensional signal sequences from their sum","key":"ref9"},{"year":"1999","author":"bertsekas","journal-title":"Nonlinear Programming","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1137\/080736417"},{"key":"ref22","first-page":"1764","article-title":"Nonconvex relaxation approaches to robust matrix recovery","author":"wang","year":"2013","journal-title":"Proceedings of the Twenty-Third internationaljoint conference on Artificial Intelligence"},{"key":"ref21","first-page":"720","article-title":"Weighted low-rank approximations","volume":"3","author":"srebro","year":"2003","journal-title":"International Conference on Machine Learning"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1007\/BFb0062107"},{"key":"ref23","first-page":"1089","article-title":"Sparcs: Recovering low-rank and sparse matrices from compressive measurements","author":"waters","year":"2011","journal-title":"Advances in neural information processing systems"},{"year":"2009","author":"yuan","journal-title":"Sparse and Low-rank Matrix Decomposition Via Alternating Direction Methods","key":"ref26"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1093\/imaiai\/iat002"}],"event":{"name":"2017 International Joint Conference on Neural Networks (IJCNN)","start":{"date-parts":[[2017,5,14]]},"location":"Anchorage, AK, USA","end":{"date-parts":[[2017,5,19]]}},"container-title":["2017 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7958416\/7965814\/07965967.pdf?arnumber=7965967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,29]],"date-time":"2019-09-29T10:26:56Z","timestamp":1569752816000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7965967\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/ijcnn.2017.7965967","relation":{},"subject":[],"published":{"date-parts":[[2017,5]]}}}