{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,14]],"date-time":"2026-08-14T15:55:47Z","timestamp":1786722947591,"version":"3.56.0"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Foundation for Science and Technology Development (NAFOSTED) of Vietnam","award":["102.04-2019.14"],"award-info":[{"award-number":["102.04-2019.14"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tsp.2021.3066795","type":"journal-article","created":{"date-parts":[[2021,3,18]],"date-time":"2021-03-18T19:29:28Z","timestamp":1616095768000},"page":"2070-2085","source":"Crossref","is-referenced-by-count":35,"title":["Robust Subspace Tracking With Missing Data and Outliers: Novel Algorithm With Convergence Guarantee"],"prefix":"10.1109","volume":"69","author":[{"given":"Le Trung","family":"Thanh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3002-7373","authenticated-orcid":false,"given":"Nguyen Viet","family":"Dung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3103-994X","authenticated-orcid":false,"given":"Nguyen Linh","family":"Trung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karim","family":"Abed-Meraim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-018-0757-z"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/140998135"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3388"},{"key":"ref31","first-page":"1267","article-title":"ADMM without a fixed penalty parameter: Faster convergence with new adaptive penalization","author":"xu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2354892"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-017-5628-6"},{"key":"ref36","first-page":"404","article-title":"Online robust PCA via stochastic optimization","author":"feng","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","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":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1031049"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2695457"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569920.003"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2795560"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2924885"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"ref14","first-page":"1460","article-title":"Global convergence of a grassmannian gradient descent algorithm for subspace estimation","author":"zhang","year":"0","journal-title":"Proc Int Conf Art Intel Stat"},{"key":"ref15","first-page":"1568","article-title":"Incremental gradient on the grassmannian for online foreground and background separation in subsampled video","author":"he","year":"0","journal-title":"Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2282910"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/78.365290"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178735"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2876626"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864420"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/5.58320"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/7.78295"},{"key":"ref3","author":"golub","year":"2012","journal-title":"Matrix Computations"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2877405"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2015.0202"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2826566"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2847041"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2853498"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2417491"},{"key":"ref1","author":"tulay","year":"2010","journal-title":"Adaptive Signal Processing Next Generation Solutions"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2012.6238919"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2872023"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2928130"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00180-013-0435-4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2924595"},{"key":"ref42","first-page":"37","article-title":"Evaluation: From precision, recall and f-measure to ROC, informedness, markedness and correlation","volume":"2","author":"powers","year":"2011","journal-title":"J Mach Learn Technol"},{"key":"ref24","first-page":"1821","article-title":"Subspace learning with partial information","volume":"17","author":"gonen","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref41","author":"van der vaart","year":"2000","journal-title":"Asymptotic Statistics"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2449254"},{"key":"ref44","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":"ref26","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO.2019.8903031"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/110845768"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.sigpro.2017.02.003","article-title":"Online sparse and low-rank subspace learning from incomplete data: A Bayesian view","volume":"137","author":"giampouras","year":"2017","journal-title":"” Signal Process"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9307529\/09381678.pdf?arnumber=9381678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:35Z","timestamp":1652194235000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9381678\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/tsp.2021.3066795","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}