{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T18:34:53Z","timestamp":1790188493570,"version":"4.1.0"},"reference-count":98,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001352","name":"NUS","doi-asserted-by":"publisher","award":["R-263-000-B37-133"],"award-info":[{"award-number":["R-263-000-B37-133"]}],"id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Education Academic Research Fund Tier 1","award":["R-263-000-C12-112"],"award-info":[{"award-number":["R-263-000-C12-112"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2017,2,1]]},"DOI":"10.1109\/tsp.2016.2620967","type":"journal-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T18:19:34Z","timestamp":1477419574000},"page":"555-570","source":"Crossref","is-referenced-by-count":37,"title":["Online Nonnegative Matrix Factorization With Outliers"],"prefix":"10.1109","volume":"65","author":[{"given":"Renbo","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincent Y. F.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.87"},{"key":"ref33","first-page":"2258","article-title":"Online $\\ell _1$-dictionary learning with application to novel document detection","author":"kasiviswanathan","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3390\/e13010134"},{"key":"ref31","first-page":"673","article-title":"Robust nonnegative matrix factorization using $\\ell _{21}$ -norm","author":"kong","year":"0","journal-title":"Proc ACM Conf Inf Knowl Manag"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288308"},{"key":"ref37","first-page":"1718","article-title":"Online optimization for max-norm regularization","author":"shen","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref36","first-page":"404","article-title":"Online robust PCA via stochastic optimization","author":"feng","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","first-page":"5282","article-title":"Robust nonnegative matrix factorization via $l_1$ norm regularization by multiplicative updating rules","author":"shen","year":"2014","journal-title":"Proc Int Conf Image Process"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2468177"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1371-5"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2601434"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.39"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772760"},{"key":"ref22","article-title":"Maxios: Large scale nonnegative matrix factorization for collaborative filtering","author":"du","year":"2014","journal-title":"Proc Neural Inf Process Syst Workshop Distrib Mach Learn Matrix Comput"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020426"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2385045"},{"key":"ref26","first-page":"871","article-title":"Robust capped norm nonnegative matrix factorization: Capped norm NMF","author":"gao","year":"2015","journal-title":"Proc ACM Conf Inf Knowl Manag"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2516971"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282771"},{"key":"ref51","first-page":"3540","article-title":"Online robust low rank matrix recovery","author":"guo","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref59","first-page":"1737","article-title":"Dictionary learning for massive matrix factorization","author":"mensch","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2007.895831"},{"key":"ref57","article-title":"A tutorial on stochastic programming","author":"shapiro","year":"2007"},{"key":"ref56","first-page":"161","article-title":"The tradeoffs of large scale learning","author":"bottou","year":"2008","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref55","article-title":"Online algorithms and stochastic approximations","author":"bottou","year":"1998","journal-title":"Online Learning and Neural Networks"},{"key":"ref54","author":"tsypkin","year":"1971","journal-title":"Adaptation and Learning in Automatic Aystems"},{"key":"ref53","article-title":"Learning efficient sparse and low rank models","author":"sprechmann","year":"2012"},{"key":"ref52","first-page":"67","article-title":"Real-time online singing voice separation from monaural recordings using robust low-rank modeling","author":"sprechmann","year":"2012","journal-title":"Proc Int Symp Music Inf Retrieval"},{"key":"ref40","author":"van der vaart","year":"2000","journal-title":"Asymptotic Statistics"},{"key":"ref4","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2000","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by nonnegative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.149"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-012-0194-5"},{"key":"ref49","first-page":"1488","article-title":"Online (and offline) robust PCA: Novel algorithms and performance guarantees","author":"zhan","year":"0","journal-title":"Proc 19th Int Conf Artif Intell"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/07069239X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.70"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.88"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2012.07.015"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0124685"},{"key":"ref47","first-page":"3165","article-title":"Online dictionary learning on symmetric positive definite manifolds with vision applications","author":"zhang","year":"2015","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/env.3170050203"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1515\/9783110845563"},{"key":"ref44","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","volume":"11","author":"mairal","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref43","first-page":"1457","article-title":"Non-negative matrix factorization with sparseness constraints","volume":"5","author":"hoyer","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref73","first-page":"3349","article-title":"Sparse and unique nonnegative matrix factorization through data preprocessing","volume":"13","author":"gillis","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213994"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)90224-C"},{"key":"ref70","first-page":"1141","article-title":"When does non-negative matrix factorization give correct decomposition into parts?","author":"donoho","year":"2004","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref76","first-page":"272","article-title":"Efficient projections onto the l1-ball for learning in high dimensions","author":"duchi","year":"0","journal-title":"Proc ICML"},{"key":"ref77","article-title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","author":"wang","year":"2013"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-015-0350-z"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxp008"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"},{"key":"ref60","first-page":"2283","article-title":"Stochastic majorization-minimization algorithms for large-scale optimization","author":"mairal","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854796"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1021-7"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1137\/120891009"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2015.2481563"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s11801-015-4203-2"},{"key":"ref66","article-title":"On accelerated proximal gradient methods for convex-concave optimization","author":"tseng","year":"2008"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1137\/070709967"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2001.973042"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472577"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472160"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2008.04-08-771"},{"key":"ref94","first-page":"1107","article-title":"Non-convex robust PCA","author":"netrapalli","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref92","article-title":"Measures of image quality","author":"veldhuizen","year":"1998"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref90","first-page":"382","article-title":"Bayesian PCA","author":"bishop","year":"1999","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref98","article-title":"Supplemental Material for ‘Online Matrix Factorization with Outliers’","author":"zhao","year":"2016"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00168"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2487966"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSTARS.2015.2427656"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2011.2158801"},{"key":"ref12","first-page":"2689","article-title":"Detect and track latent factors with online nonnegative matrix factorization","author":"cao","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11460-011-0128-0"},{"key":"ref14","article-title":"Rad-outlier detection on big data","year":"2015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.09.002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2197827"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.73"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ASPAA.2011.6082314"},{"key":"ref81","article-title":"Elastic net projections","author":"duchi","year":"2009"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.78"},{"key":"ref84","article-title":"A note on the group lasso and a sparse group lasso","author":"friedman","year":"2010"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2013.2278199"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.5244\/C.25.56"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339610"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.240"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2012.681250"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/34.927464"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2004.836169"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/7753033\/07676413.pdf?arnumber=7676413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:10:23Z","timestamp":1642003823000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7676413\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,1]]},"references-count":98,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2016.2620967","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,1]]}}}