{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:16:43Z","timestamp":1761621403683,"version":"3.37.3"},"reference-count":67,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"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 J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/jstsp.2018.2869111","type":"journal-article","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T15:33:12Z","timestamp":1536247992000},"page":"1313-1323","source":"Crossref","is-referenced-by-count":14,"title":["Moving Object Detection Through Robust Matrix Completion Augmented With Objectness"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5892-5001","authenticated-orcid":false,"given":"Behnaz","family":"Rezaei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2216-9988","authenticated-orcid":false,"given":"Sarah","family":"Ostadabbas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"612","article-title":"Linearized alternating direction method with adaptive penalty for low-rank representation","volume":"25","author":"lin","year":"2011","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref38","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":"ref33","doi-asserted-by":"crossref","DOI":"10.1201\/b20190","author":"bouwmans","year":"2016","journal-title":"Handbook of Robust Low-Rank and Sparse Matrix Decomposition Applications in Image and Video Processing"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2016.11.001"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854862"},{"key":"ref30","article-title":"Online adaptation of convolutional neural networks for video object segmentation","author":"voigtlaender","year":"0","journal-title":"Proc Brit Mach Vis Conf"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref36","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","volume":"22","author":"wright","year":"2009","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2826566"},{"key":"ref34","first-page":"510","article-title":"Comparison of matrix completion algorithms for background initialization in videos","author":"sobral","year":"0","journal-title":"Proc Int Conf Image Anal Process"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2608834"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2572306"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2536752"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1137\/15M101628X"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.372"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0841-6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.81"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2377715"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37410-4_25"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.64"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995508"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/oxfordjournals.schbul.a033326"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.4103\/0975-7406.124301"},{"key":"ref20","first-page":"670","article-title":"Maximum weight cliques with mutex constraints for video object segmentation","author":"ma","year":"0","journal-title":"Proc IEEE Comput Vis Pattern Recognit"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.87"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539893"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.5244\/C.28.21"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.223"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.565"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00683"},{"key":"ref50","article-title":"pROST: A smoothed Lp-norm robust online subspace tracking method for realtime background subtraction in video","volume":"abs 1302 2073","author":"seidel","year":"2013","journal-title":"CoRR"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-015-0610-z"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2017.221"},{"key":"ref58","first-page":"391","article-title":"Edge boxes: Locating object proposals from edges","author":"zitnick","year":"0","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/15M104726X"},{"key":"ref56","article-title":"Superpixels-based manifold structured sparse RPCA for moving object detection","author":"javed","year":"0","journal-title":"Int Workshop Activity Monitoring Multiple Distrib Sens BMVC"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2746268"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2016.2632302"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33179-4_63"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706961"},{"key":"ref10","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":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.132"},{"key":"ref40","article-title":"Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix","volume":"61","author":"lin","year":"2009","journal-title":"Proc Computational Advances in Multi-Sensor Adaptive Processing"},{"key":"ref12","first-page":"314","article-title":"Foreground segmentation via dynamic tree-structured sparse RPCA","author":"ebadi","year":"0","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/AVSS.2015.7301753"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299099"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2013.12.005"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15555-0_21"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.107"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459242"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126471"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7952497"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11517-018-1816-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247817"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1515982112"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/EMBC.2016.7591837"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.419"},{"key":"ref9","article-title":"Mahnmf: Manhattan non-negative matrix factorization","volume":"1050","author":"guan","year":"2012","journal-title":"Stat"},{"key":"ref46","first-page":"231","article-title":"Fast conical hull algorithms for near-separable non-negative matrix factorization","author":"kumar","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref45","first-page":"343","article-title":"Near-separable non-negative matrix factorization with l1 and Bregman loss functions","author":"kumar","year":"0","journal-title":"Proc SIAM Int Conf Data Mining"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1117\/1.JEI.27.2.023034"},{"key":"ref47","article-title":"Robust asymmetric non-negative matrix factorization","author":"woo","year":"2014","journal-title":"Computational and Applied Mathematics Reports University of California"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2012.700713"},{"key":"ref41","article-title":"Sparse and low-rank matrix decomposition via alternating direction methods","volume":"12","author":"yuan","year":"2009","journal-title":"Pacific J Optim"},{"key":"ref44","first-page":"612","article-title":"Linearized alternating direction method with adaptive penalty for low-rank representation","author":"lin","year":"2011","journal-title":"Advances Neural Inf Process Syst"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2013.6738015"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/8566078\/08456638.pdf?arnumber=8456638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:43:29Z","timestamp":1641987809000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8456638\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":67,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2018.2869111","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"type":"print","value":"1932-4553"},{"type":"electronic","value":"1941-0484"}],"subject":[],"published":{"date-parts":[[2018,12]]}}}