Robust Subspace Learning

Abstract

Subspace learning is widely used in extracting discriminative features for classification. However, when data are contaminated with severe noise, the performance of most existing subspace learning methods would be limited. Recent advances in low-rank modeling provide effective solutions for removing noise or outliers contained in sample sets, which motivates us to take advantages of low-rank constraints in order to exploit robust and discriminative subspace for classification. In this chapter, we introduce a discriminative subspace learning method named Supervised Regularization based Robust Subspace (SRRS) approach, by incorporating the low-rank constraint. SRRS seeks low-rank representations from the noisy data, and learns a discriminative subspace from the recovered clean data jointly. A supervised regularization function is designed to make use of the class label information and therefore to enhance the discriminability of subspace. Our approach is formulated as a constrained rank minimization problem. We design an inexact augmented Lagrange multiplier (ALM) optimization algorithm to solve it. Unlike the existing sparse representation and low-rank learning methods, our approach learns a low-dimensional subspace from recovered data, and explicitly incorporates the supervised information. Our approach and some baselines are evaluated on the COIL-100, ALOI, Extended YaleB, FERET, AR, and KinFace databases. Experimental results demonstrate the effectiveness of our approach, especially when the data contain considerable noise or variations.