{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T10:03:33Z","timestamp":1766311413964,"version":"3.37.3"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T00:00:00Z","timestamp":1489536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T00:00:00Z","timestamp":1489536000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T00:00:00Z","timestamp":1489536000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T00:00:00Z","timestamp":1489536000000},"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","CCF-1320547"],"award-info":[{"award-number":["CCF-1552497","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,3,15]]},"DOI":"10.1109\/tsp.2016.2645515","type":"journal-article","created":{"date-parts":[[2016,12,28]],"date-time":"2016-12-28T19:05:24Z","timestamp":1482951924000},"page":"1580-1594","source":"Crossref","is-referenced-by-count":33,"title":["Randomized Robust Subspace Recovery and Outlier Detection for High Dimensional Data Matrices"],"prefix":"10.1109","volume":"65","author":[{"given":"Mostafa","family":"Rahmani","sequence":"first","affiliation":[]},{"given":"George K.","family":"Atia","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Solving principal component pursuit in linear time via $ l\\_1$ filtering","year":"2011","author":"liu","key":"ref39"},{"key":"ref38","first-page":"1206","article-title":"A subspace learning approach for high dimensional matrix decomposition with efficient column\/row sampling","author":"rahmani","year":"0","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref33","first-page":"354","article-title":"Algorithms and hardness for robust subspace recovery","author":"hardt","year":"2013","journal-title":"COLT"},{"article-title":"Fast, robust and non-convex subspace recovery","year":"2014","author":"lerman","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2015.114"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7952457"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iat002"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS914"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008000628999"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177153"},{"key":"ref20","first-page":"749","article-title":"A novel m-estimator for robust PCA","volume":"15","author":"zhang","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10073"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1034"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9003-x"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2009.2039178"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/23\/3\/008"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref50","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref51","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":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/S1874-5849(01)80010-3"},{"article-title":"Introduction to the non-asymptotic analysis of random matrices","year":"2010","author":"vershynin","key":"ref53"},{"article-title":"Random observations on random observations: Sparse signal acquisition and processing","year":"2010","author":"davenport","key":"ref52"},{"key":"ref10","first-page":"25","article-title":"Analysis of randomized robust PCA for high dimensional data","author":"rahmani","year":"0","journal-title":"Proc IEEE Signal Process Signal Process Educ Workshop"},{"key":"ref11","first-page":"1","article-title":"Randomized robust subspace recovery for big data","author":"rahmani","year":"0","journal-title":"Proc 25th IEEE Int Workshop Mach Learn Signal Process"},{"key":"ref40","first-page":"1134","article-title":"Divide-and-conquer matrix factorization","author":"mackey","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-014-9221-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2204986"},{"key":"ref14","first-page":"255","article-title":"Nonconvex alternating direction method of multipliers for distributed sparse principal component analysis","author":"hajinezhad","year":"0","journal-title":"Proc IEEE Glob Conf Signal Inf Process"},{"key":"ref15","first-page":"1","article-title":"A framework for robust subspace learning","volume":"54","author":"de la torre","year":"2003","journal-title":"Int J Comput Vis"},{"key":"ref16","first-page":"281","article-title":"R 1-PCA: Rotational invariant L1-norm principal component analysis for robust subspace factorization","author":"ding","year":"0","journal-title":"Proc 23rd Int Conf Mach Learn"},{"key":"ref17","first-page":"739","article-title":"Robust L1 norm factorization in the presence of outliers and missing data by alternative convex programming","volume":"1","author":"ke","year":"0","journal-title":"Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit"},{"journal-title":"Robust Statistics","year":"2011","author":"huber","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"article-title":"Fast algorithms for robust PCA via gradient descent","year":"2016","author":"yi","key":"ref6"},{"key":"ref5","first-page":"1107","article-title":"Non-convex robust PCA","author":"netrapalli","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"article-title":"Robust matrix completion with corrupted columns","year":"2011","author":"chen","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173156"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2005.09.012"},{"article-title":"Coherence pursuit: Fast, simple, and robust principal component analysis","year":"2016","author":"rahmani","key":"ref9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2559902"},{"key":"ref45","first-page":"341","article-title":"A sparse Johnson-Lindenstrauss transform","author":"dasgupta","year":"0","journal-title":"Proc 42nd ACM Symp Theory Comput"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.92"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.382974"},{"key":"ref42","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":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995369"},{"key":"ref44","first-page":"1206","article-title":"Recovery of coherent data via low-rank dictionary pursuit","author":"liu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2401536"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/78\/7820239\/7801145-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/7820239\/07801145.pdf?arnumber=7801145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:02Z","timestamp":1649443742000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7801145\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,15]]},"references-count":54,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2016.2645515","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2017,3,15]]}}}