{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:27:50Z","timestamp":1762457270151,"version":"3.37.3"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"23","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF CAREER","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,12,1]]},"DOI":"10.1109\/tsp.2017.2749215","type":"journal-article","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T18:07:08Z","timestamp":1504548428000},"page":"6260-6275","source":"Crossref","is-referenced-by-count":93,"title":["Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis"],"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":"crossref","first-page":"363","DOI":"10.1007\/s10208-014-9221-0","article-title":"Robust computation of linear models, or how to find a needle in a haystack","volume":"15","author":"lerman","year":"2015","journal-title":"Foundations of Computational Mathematics"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143880"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04898-2_594"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/948143.948144"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.4137\/CIN.S6868"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2401536"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref35","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":"2005","journal-title":"Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS914"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2015.114"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472520"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1034"},{"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":"4152","article-title":"Fast algorithms for robust PCA via gradient descent","author":"yi","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","first-page":"2496","article-title":"Robust PCA via outlier pursuit","author":"xu","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"article-title":"Fast, robust and non-convex subspace recovery","year":"2014","author":"lerman","key":"ref21"},{"key":"ref24","first-page":"189","article-title":"Robust low-rank data matrix approximations","volume":"2","author":"feng","year":"2016","journal-title":"Science China Mathematics"},{"key":"ref23","first-page":"2864","article-title":"Coherence pursuit: Fast, simple, and robust subspace recovery","author":"rahmani","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2645515"},{"key":"ref25","first-page":"873","article-title":"Robust matrix completion with corrupted columns","author":"chen","year":"0","journal-title":"Proc 28th Int Conf Mach Learn"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.939739"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2749206"},{"key":"ref58","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref57","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.jmva.2011.11.008","article-title":"Phase transition in limiting distributions of coherence of high-dimensional random matrices","volume":"107","author":"cai","year":"2012","journal-title":"J Multivariate Anal"},{"key":"ref56","volume":"1200","author":"milman","year":"0","journal-title":"Asymptotic Theory of Finite Dimensional Normed Spaces Isoperimetric Inequalities in Riemannian Manifolds"},{"key":"ref55","volume":"89","author":"ledoux","year":"2001","journal-title":"The Concentration of Measure Phenomenon"},{"key":"ref54","first-page":"2753","article-title":"Greedy subspace clustering","author":"park","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.382974"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1198\/004017005000000166"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/11-EJS636"},{"key":"ref40","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":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2212415"},{"article-title":"Robust subspace recovery by geodesically convex optimization","year":"2012","author":"zhang","key":"ref13"},{"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","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2016.11.001"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2649482"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref19","first-page":"1107","article-title":"Non-convex robust PCA","author":"netrapalli","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","first-page":"1062","article-title":"Optimal mean robust principal component analysis","author":"nie","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2511743"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0713-z"},{"key":"ref5","first-page":"1802","article-title":"Avoiding optimal mean robust PCA\/2DPCA with non-greedy L1-norm maximization","author":"luo","year":"2016","journal-title":"Proc 25th Int Conf Artif Intell"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2014.6958854"},{"key":"ref7","first-page":"1433","article-title":"Robust principal component analysis with non-greedy L1-norm maximization","volume":"22","author":"nie","year":"2011","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1999.791228"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-014-9242-6"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2168521"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-3833-5_5"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2004.836169"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TPAMI.2010.70","article-title":"Learning to detect a salient object","volume":"33","author":"liu","year":"2011","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref42","first-page":"354","article-title":"Algorithms and hardness for robust subspace recovery","author":"hardt","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"journal-title":"Table of Integrals Series and Products","year":"1980","author":"gradshteyn","key":"ref44"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/0470010940"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/78\/8053877\/8025623-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8053877\/08025623.pdf?arnumber=8025623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:00Z","timestamp":1649443740000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8025623\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,1]]},"references-count":58,"journal-issue":{"issue":"23"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2017.2749215","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2017,12,1]]}}}