Robust Low-Rank Kernel Subspace Clustering based on the Schatten p-norm and Correntropy

Subspace clustering plays an important role in the tasks such as data processing and pattern recognition. Since the high-dimensional data may contain complex noise, as well as non-linear structure, learning low-dimensional subspace structures is a challenging task. However, the existing methods to deal with both problems relax the original problem convexly. The results of solving by these methods deviate from the solution of the original problem. In this paper, to overcome this deficiency, we propose a robust low-rank kernel subspace clustering model, which coalesces the non-convex Schatten p-norm (0 <; p ≤ 1) regularizer with “kernel trick” and correntropy. Our “kernel trick” extends linear subspace clustering to non-linear counterparts, the Schatten p-norm regularizer can approximate the rank of the data in feature space effectively, and the correntropy is a robust measure to large corruptions. Furthermore, an efficient iterative algorithm (HQ-ADMM) is designed to solve the formulated problem, which coalesces the half-quadratic technique and Alternating Direction Method of Multipliers. This algorithm can ensure the closed form solutions at each iteration, which improves the computation speed of the algorithm. Extensive experiments on face/object clustering and motion segmentation clearly attest the ascendancy of the proposed method over several state-of-the-art methods.