Journal:In The IEEE Conference on Computer Vision and Pattern Recognition(CVPR) 2016

Abstract:Sparse subspace clustering (SSC), as one of the most successful subspace clustering methods, has achieved notable clustering accuracy in computer vision tasks. However, SSC applies only to vector data in Euclidean space. As such, there is still no satisfactory approach to solve subspace clustering by self−expressive principle for symmetric positive definite (SPD) matrices which is very useful in computer vision. In this paper, by embedding the SPD matrices into a Reproducing Kernel Hilbert Space (RKHS), a kernel subspace clustering method is constructed on the SPD manifold through an appropriate Log-Euclidean kernel, termed as kernel sparse subspace clustering on the SPD Riemannian manifold (KSSCR). By exploiting the intrinsic Riemannian geometry within data, KSSCR can effectively characterize the geodesic distance between SPD matrices to uncover the underlying subspace structure. Experimental results on two famous database demonstrate that the proposed method achieves better clustering results than the state-of-the-art approaches.

Co-author:Yi Guo,Junbin Gao,Shengli Xie,Zhaoshui He

First Author:Ming Yin

Indexed by:会议论文

Page Number:pages 5157-5164, (CCF A类会议)

Translation or Not:no

Date of Publication:2016-06-27