Exact Subspace Segmentation and Outlier Detection by Low-Rank Representation

Abstract

In this work, we address the following matrix recovery problem: suppose we are given a set of data points containing two parts, one part consists of samples drawn from a union of multiple subspaces and the other part consists of outliers. We do not know which data points are outliers, or how many outliers there are. The rank and number of the subspaces are unknown either. Can we detect the outliers and segment the samples into their right subspaces, efficiently and exactly? We utilize a so-called {\em Low-Rank Representation} (LRR) method to solve this problem, and prove that under mild technical conditions, any solution to LRR exactly recovers the row space of the samples and detect the outliers as well. Since the subspace membership is provably determined by the row space, this further implies that LRR can perform exact subspace segmentation and outlier detection, in an efficient way.

Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2012

References in corpus (1)

• Robust PCA via Outlier Pursuit

Cited by in corpus (10)

• A geometric analysis of subspace clustering with outliers
• Fixed-Rank Representation for Unsupervised Visual Learning
• Robust Subspace Clustering with Compressed Data
• Noisy Sparse Subspace Clustering
• Recovery of Coherent Data via Low-Rank Dictionary Pursuit
• Robust Subspace Clustering via Tighter Rank Approximation
• A Counterexample for the Validity of Using Nuclear Norm as a Convex Surrogate of Rank
• Advancing Matrix Completion by Modeling Extra Structures beyond Low-Rankness
• Distributed Low-rank Subspace Segmentation
• Occluded Face Recognition Using Low-rank Regression with Generalized Gradient Direction