Low Rank Matrix Recovery with Simultaneous Presence of Outliers and Sparse Corruption
arXiv:1702.01847 · doi:10.1109/JSTSP.2018.2876604
Abstract
We study a data model in which the data matrix D can be expressed as D = L + S + C, where L is a low rank matrix, S an element-wise sparse matrix and C a matrix whose non-zero columns are outlying data points. To date, robust PCA algorithms have solely considered models with either S or C, but not both. As such, existing algorithms cannot account for simultaneous element-wise and column-wise corruptions. In this paper, a new robust PCA algorithm that is robust to simultaneous types of corruption is proposed. Our approach hinges on the sparse approximation of a sparsely corrupted column so that the sparse expansion of a column with respect to the other data points is used to distinguish a sparsely corrupted inlier column from an outlying data point. We also develop a randomized design which provides a scalable implementation of the proposed approach. The core idea of sparse approximation is analyzed analytically where we show that the underlying ell_1-norm minimization can obtain the representation of an inlier in presence of sparse corruptions.
References in corpus (17)
- Robust Recovery of Subspace Structures by Low-Rank Representation
- Sparsity and Incoherence in Compressive Sampling
- Rank-Sparsity Incoherence for Matrix Decomposition
- A geometric analysis of subspace clustering with outliers
- Robust PCA via Outlier Pursuit
- Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis
- A Novel M-Estimator for Robust PCA
- Robust computation of linear models by convex relaxation
- High Dimensional Low Rank plus Sparse Matrix Decomposition
- Randomized Robust Subspace Recovery for High Dimensional Data Matrices
- Robust recovery of multiple subspaces by geometric l_p minimization
- Innovation Pursuit: A New Approach to Subspace Clustering
- Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling
- Fast, Robust and Non-convex Subspace Recovery
- Algorithms and Hardness for Robust Subspace Recovery
- Screen Content Image Segmentation Using Sparse-Smooth Decomposition
- Solving Principal Component Pursuit in Linear Time via Filtering