{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:30:45Z","timestamp":1772296245081,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2017,4,15]],"date-time":"2017-04-15T00:00:00Z","timestamp":1492214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,4,15]],"date-time":"2017-04-15T00:00:00Z","timestamp":1492214400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,4,15]],"date-time":"2017-04-15T00:00:00Z","timestamp":1492214400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,4,15]],"date-time":"2017-04-15T00:00:00Z","timestamp":1492214400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1552497"],"award-info":[{"award-number":["CCF-1552497"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1320547"],"award-info":[{"award-number":["CCF-1320547"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2017,4,15]]},"DOI":"10.1109\/tsp.2017.2649482","type":"journal-article","created":{"date-parts":[[2017,1,9]],"date-time":"2017-01-09T21:38:07Z","timestamp":1483997887000},"page":"2004-2019","source":"Crossref","is-referenced-by-count":55,"title":["High Dimensional Low Rank Plus Sparse Matrix Decomposition"],"prefix":"10.1109","volume":"65","author":[{"given":"Mostafa","family":"Rahmani","sequence":"first","affiliation":[]},{"given":"George K.","family":"Atia","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S1874-5849(01)80010-3"},{"key":"ref38","article-title":"Introduction to the non-asymptotic analysis of random matrices","author":"vershynin","year":"2010"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1201\/b20190"},{"key":"ref32","article-title":"l1-magic: Recovery of sparse signals via convex programming","volume":"4","author":"cand\u00e8s","year":"2005"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513535"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-662-12788-9_6","article-title":"Concentration","author":"mcdiarmid","year":"1998","journal-title":"Probabilistic Methods for Algorithmic Discrete Mathematics"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref35","first-page":"404","article-title":"Online robust PCA via stochastic optimization","author":"feng","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2004.836169"},{"key":"ref10","article-title":"Randomized robust subspace recovery for high dimensional data matrices","author":"rahmani","year":"2015"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1214\/aos\/1015957395","article-title":"Adaptive estimation of a quadratic functional by model selection","volume":"28","author":"laurent","year":"2000","journal-title":"Ann Statist"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.53"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2015.7421461"},{"key":"ref14","first-page":"1206","article-title":"A subspace learning approach for high dimensional matrix decomposition with efficient column\/row sampling","author":"rahmani","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref15","first-page":"33","article-title":"Godec: Randomized low-rank & sparse matrix decomposition in noisy case","author":"zhou","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995369"},{"key":"ref17","article-title":"Solving principal component pursuit in linear time via l_1 filtering","author":"liu","year":"2011"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(96)00301-1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2417491"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref4","article-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2010"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.38"},{"key":"ref3","first-page":"1","article-title":"Sparse and low-rank matrix decomposition via alternating direction methods","volume":"9","author":"yuan","year":"2009"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2401536"},{"key":"ref29","first-page":"739","article-title":"Robust l 1 norm factorization in the presence of outliers and missing data by alternative convex programming","volume":"1","author":"ke","year":"2005","journal-title":"Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit"},{"key":"ref5","first-page":"1134","article-title":"Divide-and-conquer matrix factorization","author":"mackey","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/23\/3\/008"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iat002"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/EUSIPCO.2015.7362837"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2331612"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875221"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.105"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref26","first-page":"1206","article-title":"Recovery of coherent data via low-rank dictionary pursuit","author":"liu","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","first-page":"123","article-title":"Randomized algorithms for matrices and data","volume":"3","author":"mahoney","year":"2011","journal-title":"Found Trends Mach Learn"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/78\/7845749\/7809181-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/7845749\/07809181.pdf?arnumber=7809181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T02:27:42Z","timestamp":1658370462000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7809181\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,15]]},"references-count":40,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2017.2649482","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,15]]}}}