Fast principal component pursuit via alternating minimization

Paul Rodríguez, Brendt Wohlberg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

104 Scopus citations

Abstract

We propose a simple alternating minimization algorithm for solving a minor variation on the original Principal Component Pursuit (PCP) functional. In computational experiments in the video background modeling problem, the proposed algorithm is able to deliver a consistent sparse approximation even after the first outer loop, (taking approximately 12 seconds for a 640 × 480 × 400 color test video) which is approximately an order of magnitude faster than Inexact ALM to construct a sparse component of the same quality.

Original languageEnglish
Title of host publication2013 IEEE International Conference on Image Processing, ICIP 2013 - Proceedings
PublisherIEEE Computer Society
Pages69-73
Number of pages5
ISBN (Print)9781479923410
DOIs
StatePublished - 2013
Event2013 20th IEEE International Conference on Image Processing, ICIP 2013 - Melbourne, VIC, Australia
Duration: 15 Sep 201318 Sep 2013

Publication series

Name2013 IEEE International Conference on Image Processing, ICIP 2013 - Proceedings

Conference

Conference2013 20th IEEE International Conference on Image Processing, ICIP 2013
Country/TerritoryAustralia
CityMelbourne, VIC
Period15/09/1318/09/13

Keywords

  • Principal Component Pursuit
  • Video Background Modeling

Fingerprint

Dive into the research topics of 'Fast principal component pursuit via alternating minimization'. Together they form a unique fingerprint.

Cite this