DeepAI AI Chat
Log In Sign Up

Solving Principal Component Pursuit in Linear Time via l_1 Filtering

by   Risheng Liu, et al.
Dalian University of Technology
Peking University

In the past decades, exactly recovering the intrinsic data structure from corrupted observations, which is known as robust principal component analysis (RPCA), has attracted tremendous interests and found many applications in computer vision. Recently, this problem has been formulated as recovering a low-rank component and a sparse component from the observed data matrix. It is proved that under some suitable conditions, this problem can be exactly solved by principal component pursuit (PCP), i.e., minimizing a combination of nuclear norm and l_1 norm. Most of the existing methods for solving PCP require singular value decompositions (SVD) of the data matrix, resulting in a high computational complexity, hence preventing the applications of RPCA to very large scale computer vision problems. In this paper, we propose a novel algorithm, called l_1 filtering, for exactly solving PCP with an O(r^2(m+n)) complexity, where m× n is the size of data matrix and r is the rank of the matrix to recover, which is supposed to be much smaller than m and n. Moreover, l_1 filtering is highly parallelizable. It is the first algorithm that can exactly solve a nuclear norm minimization problem in linear time (with respect to the data size). Experiments on both synthetic data and real applications testify to the great advantage of l_1 filtering in speed over state-of-the-art algorithms.


page 2

page 7

page 9

page 11


Frequency-Weighted Robust Tensor Principal Component Analysis

Robust tensor principal component analysis (RTPCA) can separate the low-...

Structured Low-Rank Matrix Factorization with Missing and Grossly Corrupted Observations

Recovering low-rank and sparse matrices from incomplete or corrupted obs...

Scalable Robust Matrix Recovery: Frank-Wolfe Meets Proximal Methods

Recovering matrices from compressive and grossly corrupted observations ...

Robust PCA via Nonconvex Rank Approximation

Numerous applications in data mining and machine learning require recove...

A Fast Factorization-based Approach to Robust PCA

Robust principal component analysis (RPCA) has been widely used for reco...

Robust PCA via Outlier Pursuit

Singular Value Decomposition (and Principal Component Analysis) is one o...

Side Information in Robust Principal Component Analysis: Algorithms and Applications

Robust Principal Component Analysis (RPCA) aims at recovering a low-rank...