{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:11Z","timestamp":1750306151515,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T00:00:00Z","timestamp":1471564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,19]]},"DOI":"10.1145\/3007669.3007699","type":"proceedings-article","created":{"date-parts":[[2016,12,13]],"date-time":"2016-12-13T14:31:54Z","timestamp":1481639514000},"page":"246-250","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Survey of Background Modeling Based on Robust Subspace Learning via Sparse and Low-rank Matrix Decomposition"],"prefix":"10.1145","author":[{"given":"Chaochao","family":"Xie","sequence":"first","affiliation":[{"name":"Fujian Key Laboratory of Sensing and Computing for Smart City, School of Information Science and Technology, Xiamen University, Fujian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Yan","sequence":"additional","affiliation":[{"name":"Fujian Key Laboratory of Sensing and Computing for Smart City, School of Information Science and Technology, Xiamen University, Fujian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanzi","family":"Wang","sequence":"additional","affiliation":[{"name":"Fujian Key Laboratory of Sensing and Computing for Smart City, School of Information Science and Technology, Xiamen University, Fujian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lili","family":"Lin","sequence":"additional","affiliation":[{"name":"Fujian Key Laboratory of Sensing and Computing for Smart City, School of Information Science and Technology, Xiamen University, Fujian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Information Security Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,8,19]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"153","volume-title":"International Conference on Signal Processing and Multimedia Applications","author":"Baf F. E.","year":"2007","unstructured":"F. E. Baf , T. Bouwmans , and B. Vachon . Comparison of background subtraction methods for a multimedia learning space . In International Conference on Signal Processing and Multimedia Applications , pages 153 -- 158 , July 2007 . F. E. Baf, T. Bouwmans, and B. Vachon. Comparison of background subtraction methods for a multimedia learning space. In International Conference on Signal Processing and Multimedia Applications, pages 153--158, July 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2015.7351462"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2174\/2213275910902030223"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2014.04.001"},{"key":"e_1_3_2_1_5_1","article-title":"Decomposition into low-rank plus additive matrices for background\/foreground separation: A review for a comparative evaluation with a large-scale dataset","author":"Bouwmans T.","year":"2015","unstructured":"T. Bouwmans , A. Sobral , S. Javed , S. K. Jung , and E. H. Zahzah . Decomposition into low-rank plus additive matrices for background\/foreground separation: A review for a comparative evaluation with a large-scale dataset . Computer Science Review , November 2015 . T. Bouwmans, A. Sobral, S. Javed, S. K. Jung, and E. H. Zahzah. Decomposition into low-rank plus additive matrices for background\/foreground separation: A review for a comparative evaluation with a large-scale dataset. Computer Science Review, November 2015.","journal-title":"Computer Science Review"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2013.11.009"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2007.896861"},{"key":"e_1_3_2_1_9_1","volume-title":"Low-rank structure learning via log-sum heuristic recovery. arXiv preprint arXiv:1012.1919","author":"Deng Y.","year":"2010","unstructured":"Y. Deng , Q. Dai , R. Liu , Z. Zhang , and S. Hu . Low-rank structure learning via log-sum heuristic recovery. arXiv preprint arXiv:1012.1919 , 2010 . Y. Deng, Q. Dai, R. Liu, Z. Zhang, and S. Hu. Low-rank structure learning via log-sum heuristic recovery. arXiv preprint arXiv:1012.1919, 2010."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2156801"},{"key":"e_1_3_2_1_11_1","first-page":"404","volume-title":"Annual Conference on Neural Information Processing Systems","author":"Feng J.","year":"2013","unstructured":"J. Feng , H. Xu , and S. Yan . Online robust PCA via stochastic optimization . In Annual Conference on Neural Information Processing Systems , pages 404 -- 412 , December 2013 . J. Feng, H. Xu, and S. Yan. Online robust PCA via stochastic optimization. In Annual Conference on Neural Information Processing Systems, pages 404--412, December 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2009.5413299"},{"key":"e_1_3_2_1_13_1","volume-title":"Mahnmf: Manhattan non-negative matrix factorization. arXiv preprint arXiv: 1207.3438","author":"Guan N.","year":"2012","unstructured":"N. Guan , D. Tao , Z. Luo , and J. Shawe-Taylor . Mahnmf: Manhattan non-negative matrix factorization. arXiv preprint arXiv: 1207.3438 , 2012 . N. Guan, D. Tao, Z. Luo, and J. Shawe-Taylor. Mahnmf: Manhattan non-negative matrix factorization. arXiv preprint arXiv: 1207.3438, 2012."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2197827"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2013.2269011"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10584-0_35"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37410-4_28"},{"key":"e_1_3_2_1_18_1","first-page":"87","volume-title":"Workshop on Perceptual User Interfaces","author":"Horprasert T.","year":"1998","unstructured":"T. Horprasert , I. Haritaoglu , C. Wren , D. Harwood , L. Davis , and A. Pentland . Real-time 3D motion capture . In Workshop on Perceptual User Interfaces , pages 87 -- 90 , 1998 . T. Horprasert, I. Haritaoglu, C. Wren, D. Harwood, L. Davis, and A. Pentland. Real-time 3D motion capture. In Workshop on Perceptual User Interfaces, pages 87--90, 1998."},{"key":"e_1_3_2_1_19_1","first-page":"64","volume-title":"International Conference on Computer Vision","author":"Huang J.","year":"2009","unstructured":"J. Huang , X. Huang , and D. Metaxas . Learning with dynamic group sparsity . In International Conference on Computer Vision , pages 64 -- 71 , 2009 . J. Huang, X. Huang, and D. Metaxas. Learning with dynamic group sparsity. In International Conference on Computer Vision, pages 64--71, 2009."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23234-8_32"},{"key":"e_1_3_2_1_21_1","first-page":"284","volume-title":"Asian Conference on Computer Vision","author":"Javed S.","year":"2014","unstructured":"S. Javed , A. Sobral , S. Oh , T. Bouwmans , and S. Jung . OR-PCA with MRF for robust foreground detection in highly dynamic backgrounds . In Asian Conference on Computer Vision , pages 284 -- 299 , November 2014 . S. Javed, A. Sobral, S. Oh, T. Bouwmans, and S. Jung. OR-PCA with MRF for robust foreground detection in highly dynamic backgrounds. In Asian Conference on Computer Vision, pages 284--299, November 2014."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2003.11.010"},{"key":"e_1_3_2_1_23_1","volume-title":"September","author":"Lin Z.","year":"2010","unstructured":"Z. Lin , M. Chen , L. Wu , and Y. Ma . The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv preprint arXiv:1009.5055 , September 2010 . Z. Lin, M. Chen, L. Wu, and Y. Ma. The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv preprint arXiv:1009.5055, September 2010."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2419084"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2013.11.006"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645549.659161"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706961"},{"key":"e_1_3_2_1_28_1","volume-title":"June","author":"Qiu C.","year":"2011","unstructured":"C. Qiu and N. Vaswani . ReProCS: A missing link between recursive robust PCA and recursive sparse recovery in large but correlated noise. arXiv preprint arXiv:1106.3286 , June 2011 . C. Qiu and N. Vaswani. ReProCS: A missing link between recursive robust PCA and recursive sparse recovery in large but correlated noise. arXiv preprint arXiv:1106.3286, June 2011."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034215"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2013.6738015"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-015-0610-z"},{"key":"e_1_3_2_1_32_1","first-page":"41","volume-title":"Journal of the American Statistical Association","author":"She Y.","year":"2014","unstructured":"Y. She , S. Li , and D. Wu . Robust orthogonal complement principal component analysis . Journal of the American Statistical Association , pages 41 -- 64 , 2014 . Y. She, S. Li, and D. Wu. Robust orthogonal complement principal component analysis. Journal of the American Statistical Association, pages 41--64, 2014."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.495"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1999.784637"},{"key":"e_1_3_2_1_35_1","first-page":"1","volume-title":"Annual Conference on Information Sciences and Systems","author":"Tang G.","year":"2011","unstructured":"G. Tang and A. Nehorai . Robust principal component analysis based on low-rank and block-sparse matrix decomposition . In Annual Conference on Information Sciences and Systems , pages 1 -- 5 , March 2011 . G. Tang and A. Nehorai. Robust principal component analysis based on low-rank and block-sparse matrix decomposition. In Annual Conference on Information Sciences and Systems, pages 1--5, March 2011."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.304"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00555"},{"key":"e_1_3_2_1_38_1","volume-title":"UCLA Computational and Applied Mathematics Reports","author":"Woo H.","year":"2014","unstructured":"H. Woo and H. Park . Robust asymmetric nonnegative matrix factorization . UCLA Computational and Applied Mathematics Reports , October 2014 . H. Woo and H. Park. Robust asymmetric nonnegative matrix factorization. UCLA Computational and Applied Mathematics Reports, October 2014."},{"key":"e_1_3_2_1_39_1","first-page":"2080","volume-title":"Annual Conference on Neural Information Processing Systems","author":"Wright J.","year":"2009","unstructured":"J. Wright , A. Ganesh , S. Rao , Y. Peng , and Y. Ma . Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization . In Annual Conference on Neural Information Processing Systems , pages 2080 -- 2088 , December 2009 . J. Wright, A. Ganesh, S. Rao, Y. Peng, and Y. Ma. Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. In Annual Conference on Neural Information Processing Systems, pages 2080--2088, December 2009."},{"key":"e_1_3_2_1_40_1","first-page":"2496","volume-title":"Annual Conference on Neural Information Processing Systems","author":"Xu H.","year":"2010","unstructured":"H. Xu , C. Caramanis , and S. Sanghavi . Robust PCA via outlier pursuit . In Annual Conference on Neural Information Processing Systems , pages 2496 -- 2504 , December 2010 . H. Xu, C. Caramanis, and S. Sanghavi. Robust PCA via outlier pursuit. In Annual Conference on Neural Information Processing Systems, pages 2496--2504, December 2010."},{"issue":"1","key":"e_1_3_2_1_41_1","first-page":"167","article-title":"Sparse and low-rank matrix decomposition via alternating direction method","volume":"9","author":"Yuan X.","year":"2009","unstructured":"X. Yuan and J. Yang . Sparse and low-rank matrix decomposition via alternating direction method . Pacific Journal of Optimization , 9 ( 1 ): 167 -- 180 , 2009 . X. Yuan and J. Yang. Sparse and low-rank matrix decomposition via alternating direction method. Pacific Journal of Optimization, 9(1):167--180, 2009.","journal-title":"Pacific Journal of Optimization"},{"key":"e_1_3_2_1_42_1","first-page":"33","volume-title":"International Conference on Machine Learning","author":"Zhou T.","year":"2011","unstructured":"T. Zhou and D. Tao . Godec: Randomized low-rank & sparse matrix decomposition in noisy case . In International Conference on Machine Learning , pages 33 -- 40 , 2011 . T. Zhou and D. Tao. Godec: Randomized low-rank & sparse matrix decomposition in noisy case. In International Conference on Machine Learning, pages 33--40, 2011."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018428.1020644"}],"event":{"name":"ICIMCS'16: International Conference on Internet Multimedia Computing and Service","sponsor":["Xidian University"],"location":"Xi'an China","acronym":"ICIMCS'16"},"container-title":["Proceedings of the International Conference on Internet Multimedia Computing and Service"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3007669.3007699","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3007669.3007699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:37Z","timestamp":1750217977000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3007669.3007699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,19]]},"references-count":43,"alternative-id":["10.1145\/3007669.3007699","10.1145\/3007669"],"URL":"https:\/\/doi.org\/10.1145\/3007669.3007699","relation":{},"subject":[],"published":{"date-parts":[[2016,8,19]]},"assertion":[{"value":"2016-08-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}