{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T07:48:13Z","timestamp":1749541693254,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1109\/acssc.2016.7869681","type":"proceedings-article","created":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T22:12:32Z","timestamp":1488838352000},"page":"1744-1749","source":"Crossref","is-referenced-by-count":8,"title":["Robust PCA via tensor outlier pursuit"],"prefix":"10.1109","author":[{"given":"Jineng","family":"Ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingguo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jarvis","family":"Haupt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","article-title":"An efficient dictionary based robust PCA via sketching","author":"li","year":"2016","journal-title":"Technical Report"},{"key":"ref10","first-page":"2539","article-title":"Sparse and low-rank tensor decomposition","author":"shah","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref11","article-title":"Tensor vs matrix methods: Robust tensor decomposition under block sparse perturbations","author":"anandkumar","year":"2015","journal-title":"arXiv preprint arXiv 1510 04747"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref13","first-page":"1","article-title":"On tensor completion via nuclear norm minimization","author":"yuan","year":"2014","journal-title":"Foundations of Computational Mathematics"},{"year":"2002","author":"jolliffe","journal-title":"Principal Component Analysis","key":"ref14"},{"key":"ref15","first-page":"2496","article-title":"Robust PCA via outlier pursuit","author":"xu","year":"2010","journal-title":"Advances in neural information processing systems"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1137\/090761793"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TSP.2015.2401536"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1007\/BF02289464"},{"year":"1970","author":"harshman","article-title":"Foundations of the parafac procedure: Models and conditions for an” explanatory” multi-modal factor analysis","key":"ref19"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/TIT.2013.2257913"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/1102351.1102451"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/GlobalSIP.2015.7418224"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/CVPR.2003.1211457"},{"key":"ref6","article-title":"Estimation of low-rank tensors via convex optimization","author":"tomioka","year":"2010","journal-title":"Arxiv Preprint arXiv 1010 0789"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/GlobalSIP.2016.7906054"},{"key":"ref5","first-page":"2773","article-title":"Tensor decompositions for learning latent variable models","volume":"15","author":"anandkumar","year":"2014","journal-title":"Journal of Machine Learning Research"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1137\/1.9781611972801.61"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1137\/130905010"},{"year":"2014","author":"sonka","journal-title":"Image Processing Analysis and Machine Vision Cengage Learning","key":"ref2"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TSP.2015.2469642"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1364\/JOSAA.25.003001"},{"key":"ref20","article-title":"Provable low-rank tensor recovery","volume":"4252","author":"huang","year":"2014","journal-title":"Optimization Online"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1561\/2200000016"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1007\/s00365-012-9176-9"},{"year":"0","article-title":"Dicom sample image sets repositor","key":"ref24"},{"key":"ref23","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate o (1\/k2)","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/SSP.2016.7551785"},{"key":"ref25","article-title":"Sketching as a tool for numerical linear algebra","author":"woodruff","year":"2014","journal-title":"arXiv preprint arXiv 1411 4357"}],"event":{"name":"2016 50th Asilomar Conference on Signals, Systems and Computers","start":{"date-parts":[[2016,11,6]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2016,11,9]]}},"container-title":["2016 50th Asilomar Conference on Signals, Systems and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7859055\/7868973\/07869681.pdf?arnumber=7869681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T19:57:02Z","timestamp":1513195022000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7869681\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/acssc.2016.7869681","relation":{},"subject":[],"published":{"date-parts":[[2016,11]]}}}