{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:35:49Z","timestamp":1775280949994,"version":"3.50.1"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1109\/tit.2013.2257913","type":"journal-article","created":{"date-parts":[[2013,4,12]],"date-time":"2013-04-12T18:02:02Z","timestamp":1365789722000},"page":"5186-5205","source":"Crossref","is-referenced-by-count":74,"title":["Recovery of Low-Rank Plus Compressed Sparse Matrices With Application to Unveiling Traffic Anomalies"],"prefix":"10.1109","volume":"59","author":[{"given":"Morteza","family":"Mardani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Mateos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios B.","family":"Giannakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2055862"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2012.2233193"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1109\/TASL.2006.889789","article-title":"Separation of singing voice from music accompaniment for monaural recordings","volume":"15","author":"li","year":"2007","journal-title":"IEEE Trans Audio Speech Lang Process"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015492"},{"key":"ref31","author":"jolliffe","year":"2002","journal-title":"Principal Component Analysis"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2011.2157892"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2279080"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190029"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1522-2594(199911)42:5<813::AID-MRM1>3.3.CO;2-J"},{"key":"ref34","author":"lin","year":"2009","journal-title":"Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"ref27","author":"he","year":"2011","journal-title":"On the convergence rate of alternating direction method"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6287816"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1000"},{"key":"ref1","year":"0"},{"key":"ref20","first-page":"17","volume":"176","author":"chistov","year":"1984","journal-title":"Proc Mathematical Foundations of Computer Science"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2156801"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9298-9"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1148\/radiol.2412041866"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","article-title":"Optimally sparse representation in general (nonorthogonal) dictionaries via <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell _{1}$<\/tex><\/formula> minimization","volume":"100","author":"donoho","year":"2003","journal-title":"Proc Natl Acad Sci"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1088\/0031-9155\/56\/11\/002"},{"key":"ref25","article-title":"Prior rank, intensity and sparsity model (PRISM): A divide-and-conquer matrix decomposition model with low-rank coherence and sparse variation","author":"gao","year":"2012","journal-title":"SPIE Opt Eng Appl"},{"key":"ref50","article-title":"SpaRCS: Recovering low-rank and sparse matrices from compressive measurements","author":"waters","year":"2011","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283062"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513535"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1330107.1330146"},{"key":"ref53","author":"xu","year":"2010","journal-title":"Robust PCA via Outlier Pursuit"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.meddos.2005.12.004"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref16","first-page":"14","article-title":"An introduction to compressive sampling","volume":"25","author":"cand\ufffds","year":"2008","journal-title":"IEEE Signal Process Mag"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2249572"},{"key":"ref19","first-page":"752","article-title":"Recursive sparse recovery in large but correlated noise","author":"chenlu","year":"2011","journal-title":"Proc 49th Allerton Conf Commun Control Comput"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177153"},{"key":"ref6","author":"bertsekas","year":"1999","journal-title":"Parallel and Distributed Computation Numerical Methods"},{"key":"ref5","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS620"},{"key":"ref49","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized least-squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Opt"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref46","article-title":"Real-time online singing voice separation from monaural recordings using robust low-rank modeling","author":"sprechmann","year":"2012","journal-title":"Annu Conf Int Soc Music Inf Retriev"},{"key":"ref45","first-page":"1","article-title":"Sampling from large matrices: An approach through geometric functional analysis","volume":"54","author":"rudelson","year":"2006","journal-title":"J ACM"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2003.814797"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s002220050108"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"ref41","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate <formula formulatype=\"inline\"><tex Notation=\"TeX\">$o(1\/k^{2})$<\/tex><\/formula>","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Math Doklady"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2169424"},{"key":"ref43","first-page":"1","article-title":"Compressive sensing and structured random matrices","volume":"9","author":"rauhut","year":"2010","journal-title":"Theoretical Foundations and Numerical Methods for Sparse Recovery"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6557006\/06497613.pdf?arnumber=6497613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:46Z","timestamp":1638218866000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6497613\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":55,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2257913","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}