{"title":"An incremental principal component pursuit algorithm via projections onto the ℓ1 ball","authors":"P. Rodríguez, B. Wohlberg","doi":"10.1109/INTERCON.2017.8079645","DOIUrl":null,"url":null,"abstract":"Video background modeling, used to detect moving objects in digital videos, is a ubiquitous pre-processing step in computer vision applications. Principal Component Pursuit (PCP) PCP is among the leading methods for this problem. In this paper we proposed a new convex formulation for PCP, substituting the standard ℓ1 regularization with a projection onto the ℓ1-ball. This formulation offers an advantage over the known incremental PCP methods in practical parameter selection and ghosting suppression, while retaining the ability to be implemented in a fully incremental fashion, keeping all the desired properties related to such PCP methods (low memory footprint, adaptation to changes in the background, computational complexity that allows online processing).","PeriodicalId":229086,"journal":{"name":"2017 IEEE XXIV International Conference on Electronics, Electrical Engineering and Computing (INTERCON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE XXIV International Conference on Electronics, Electrical Engineering and Computing (INTERCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTERCON.2017.8079645","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
Video background modeling, used to detect moving objects in digital videos, is a ubiquitous pre-processing step in computer vision applications. Principal Component Pursuit (PCP) PCP is among the leading methods for this problem. In this paper we proposed a new convex formulation for PCP, substituting the standard ℓ1 regularization with a projection onto the ℓ1-ball. This formulation offers an advantage over the known incremental PCP methods in practical parameter selection and ghosting suppression, while retaining the ability to be implemented in a fully incremental fashion, keeping all the desired properties related to such PCP methods (low memory footprint, adaptation to changes in the background, computational complexity that allows online processing).