{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:23:44Z","timestamp":1751091824733,"version":"3.37.3"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61601284"],"award-info":[{"award-number":["61601284"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1109\/tetci.2019.2935747","type":"journal-article","created":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T00:10:08Z","timestamp":1567123808000},"page":"620-638","source":"Crossref","is-referenced-by-count":13,"title":["Outlier-Robust Moving Object and Background Decomposition via Structured ${\\ell }_p$-Regularized Low-Rank Representation"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5144-7855","authenticated-orcid":false,"given":"Lin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7099-6817","authenticated-orcid":false,"given":"Xue","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4533-3904","authenticated-orcid":false,"given":"Xingzhao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thiagalingam","family":"Kirubarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhixin","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23234-8_32"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2732350"},{"key":"ref33","first-page":"62","article-title":"Online decomposition of compressive streaming data using $n$-$\\ell _1$ cluster-weighted minimization","author":"van luong","year":"0","journal-title":"Proc Data Compress Conf"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.201"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00138-013-0555-4"},{"key":"ref30","first-page":"771","article-title":"Efficient computation of robust low-rank matrix approximations in the presence of missing data using the $\\ell _1$ norm","author":"eriksson","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2419737"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.132"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299099"},{"key":"ref34","first-page":"846","article-title":"Compressive online decomposition of dynamic signals via $n$-$\\ell _1$ minimization with clustered priors","author":"van luong","year":"0","journal-title":"Proc IEEE Statist Signal Process Workshop"},{"key":"ref60","doi-asserted-by":"crossref","first-page":"3520","DOI":"10.1109\/78.887045","article-title":"Maximum-likelihood array processing in non-Gaussian noise with Gaussian mixtures","volume":"48","author":"kozick","year":"2000","journal-title":"IEEE Trans Signal Process"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2853589"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2036049"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/49.233212"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.761256"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-016-0930-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"2034","DOI":"10.1109\/TCSVT.2014.2333132","article-title":"Joint video frame set division and low-rank decomposition for background subtraction","volume":"24","author":"wen","year":"2014","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2013.6738210"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2465956"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2013.2284280"},{"key":"ref23","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","author":"wright","year":"2009","journal-title":"Proc NIPS"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7471872"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/100781894"},{"key":"ref50","first-page":"2479","article-title":"Alternating directions based contraction method for generally separable linearly constrained convex programming problems","volume":"62","author":"he","year":"2011","journal-title":"SIAM J Optimiz"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016892"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2784361"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2685518"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2562626"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1371-5"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.120"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1137\/9780898719987"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2826566"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2695664.2695863"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref15","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Opt"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.25"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2585047"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.309"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2017.2778716"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2361338"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref5","first-page":"181","article-title":"Statistical background modeling for foreground detection: A survey","volume":"4","author":"bouwmans","year":"2010","journal-title":"Handbook of Pattern Recognition and Computer Vision"},{"article-title":"Low-rank matrix recovery and completion via convex optimization","year":"0","author":"wright","key":"ref8"},{"article-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","year":"2009","author":"lin","key":"ref7"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-012-0003-z"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2016.11.001"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/IWSSIP.2016.7502717"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.419"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.08.002"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.09.014"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-015-0610-z"},{"key":"ref41","first-page":"4161","article-title":"Practical ReProCS for separating sparse and low-dimensional signal sequences from their sum—Part 1","author":"guo","year":"0","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref44","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 Conf Comput Vis Pattern Recognit"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1049\/ic.2015.0105"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7433297\/9492172\/08820084.pdf?arnumber=8820084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:05Z","timestamp":1652194445000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8820084\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":65,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2019.2935747","relation":{},"ISSN":["2471-285X"],"issn-type":[{"type":"electronic","value":"2471-285X"}],"subject":[],"published":{"date-parts":[[2021,8]]}}}