Robust principal component analysis based on low-rank and block-sparse matrix decomposition

Gongguo Tang, Arye Nehorai

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

69 Scopus citations

Abstract

In this paper, we propose a convex program for low-rank and block-sparse matrix decomposition. Potential applications include outlier detection when certain columns of the data matrix are outliers. We design an algorithm based on the augmented Lagrange multiplier method to solve the convex program. We solve the subproblems involved in the augmented Lagrange multiplier method using the Douglas/Peaceman-Rachford (DR) monotone operator splitting method. Numerical simulations demonstrate the accuracy of our method compared with the robust principal component analysis based on low-rank and sparse matrix decomposition.

Original languageEnglish
Title of host publication2011 45th Annual Conference on Information Sciences and Systems, CISS 2011
DOIs
StatePublished - 2011
Event2011 45th Annual Conference on Information Sciences and Systems, CISS 2011 - Baltimore, MD, United States
Duration: Mar 23 2011Mar 25 2011

Publication series

Name2011 45th Annual Conference on Information Sciences and Systems, CISS 2011

Conference

Conference2011 45th Annual Conference on Information Sciences and Systems, CISS 2011
Country/TerritoryUnited States
CityBaltimore, MD
Period03/23/1103/25/11

Keywords

  • augmented Lagrange multiplier method
  • low-rank and block-sparse matrix decomposition
  • operator splitting method
  • robust principal component analysis

Fingerprint

Dive into the research topics of 'Robust principal component analysis based on low-rank and block-sparse matrix decomposition'. Together they form a unique fingerprint.

Cite this