{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:28:36Z","timestamp":1762252116970},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Multimedia"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1109\/tmm.2014.2353772","type":"journal-article","created":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T18:33:35Z","timestamp":1409337215000},"page":"2333-2344","source":"Crossref","is-referenced-by-count":16,"title":["Recursive On-Line &lt;formula formulatype=\"inline\"&gt; &lt;tex Notation=\"TeX\"&gt;${(2{\\rm D})}^2{\\rm PCA}$&lt;\/tex&gt;&lt;\/formula&gt; and Its Application to Long-Term Background Subtraction"],"prefix":"10.1109","volume":"16","author":[{"given":"Ja-Won","family":"Seo","sequence":"first","affiliation":[]},{"given":"Seong Dae","family":"Kim","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2004.836169"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2012.6238919"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2002.801448"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.rti.2004.12.004"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2013.07.008"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238641"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/ICCV.2003.1238312","article-title":"Segmenting foreground objects from a dynamic textured background via a robust Kalman filter","author":"zhong","year":"2003","journal-title":"Proc Int Conf Comput Vis"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.213"},{"key":"ref16","first-page":"1556","article-title":"Dynamic background modeling and subtraction using spatio-temporal local binary patterns","author":"zhang","year":"2008","journal-title":"Proc Int Conf Image Process"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2011.2182648"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2013.2269011"},{"key":"ref19","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices by convex optimization","author":"wright","year":"2009","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref28","author":"jolliffe","year":"2002","journal-title":"Principal Component Analysis"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2004.1333992"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2005.06.004"},{"key":"ref3","first-page":"543","article-title":"A framework for high-level feedback to adaptive, per-pixel, mixture-of-Gaussian background models","author":"harville","year":"2002","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.102"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1261097"},{"key":"ref5","first-page":"1017","article-title":"A re-evaluation of mixture of Gaussian background","author":"wang","year":"2005","journal-title":"Proc Int Conf Acoust Speech Signal Process"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00138-010-0262-3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2007.4379545"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"dempster","year":"1977","journal-title":"J Royal Statist Soc Ser B"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45053-X_48"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1999.784637"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SAM.2010.5606734"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1002\/cpa.20132","article-title":"For most large underdetermined systems of linear equations the minimal <formula formulatype=\"inline\"><tex Notation=\"TeX\">${l_1}$<\/tex><\/formula>-norm solution is also the sparsest solution","volume":"59","author":"donoho","year":"2006","journal-title":"Commun Pure Appl Math"},{"key":"ref21","first-page":"11","article-title":"Compressed sensing","volume":"58","author":"donoho","year":"2011","journal-title":"J ACM"},{"key":"ref24","first-page":"315","article-title":"Foreground detection via robust low rank matrix decomposition including spatio-temporal constraint","author":"guyon","year":"2012","journal-title":"Proc Asian Conf Comput Vis Workshops"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2012.6467087"},{"key":"ref26","first-page":"64","article-title":"Learning with dynamic group sparsity","author":"huang","year":"2009","journal-title":"Proc Int Conf Comput Vis"},{"key":"ref25","first-page":"1","article-title":"Background subtraction via robust dictionary learning","author":"cong","year":"2011","journal-title":"Proc EURASIP J Image Video Process"}],"container-title":["IEEE Transactions on Multimedia"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6046\/6955763\/06888521.pdf?arnumber=6888521","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T03:04:50Z","timestamp":1717297490000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6888521\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":31,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tmm.2014.2353772","relation":{},"ISSN":["1520-9210","1941-0077"],"issn-type":[{"value":"1520-9210","type":"print"},{"value":"1941-0077","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12]]}}}