$\ell_0$ -Motivated Low-Rank Sparse Subspace Clustering

Abstract

In many applications, high-dimensional data points can be well represented by low-dimensional subspaces. To identify the subspaces, it is important to capture a global and local structure of the data which is achieved by imposing low-rank and sparseness constraints on the data representation matrix. In low-rank sparse subspace clustering (LRSSC), nuclear and l₁ -norms are used to measure rank and sparsity. However, the use of nuclear and l₁ -norms leads to an overpenalized problem and only approximates the original problem. In this paper, we propose two l₀ quasi-norm-based regularizations. First, this paper presents regularization based on multivariate generalization of minimax-concave penalty (GMC-LRSSC), which contains the global minimizers of a l₀ quasi-norm regularized objective. Afterward, we introduce the Schatten-0 ( S₀ ) and l₀ -regularized objective and approximate the proximal map of the joint solution using a proximal average method ( S₀/l₀ -LRSSC). The resulting nonconvex optimization problems are solved using an alternating direction method of multipliers with established convergence conditions of both algorithms. Results obtained on synthetic and four real-world datasets show the effectiveness of GMC-LRSSC and S₀/l₀ -LRSSC when compared to state-of-the-art methods.