Release Time:2019-03-09  Hits:

Indexed by: Journal Papers

Date of Publication: 2014-10-22

Journal: NEUROCOMPUTING

Included Journals: Scopus、EI、SCIE

Volume: 142

Issue: ,SI

Page Number: 529-541

ISSN: 0925-2312

Key Words: Robust principal component analysis; Principal component Pursuit; l(1) minimization; Subspace learning; Incremental learning

Abstract: 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 and pattern recognition. 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 (SVDs) 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 x 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, if 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). As a preliminary investigation, we also discuss the potential extensions of PCP for more complex vision tasks encouraged by l(1) filtering. Experiments on both synthetic data and real tasks testify the great advantage of l(1) filtering in speed over state-of-the-art algorithms and wide applications in computer vision and pattern recognition societies.