Kernel Sparse Subspace Clustering on Symmetric Positive Definite Manifolds
Authors:
- Ming YinMYMing Yin
- Yi GuoYGYi Guo
- Junbin GaoJGJunbin Gao
- Zhaoshui HeZHZhaoshui He
- Shengli XieSXShengli Xie
- 1 June 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5157-5164
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 10 vector data in Euclidean space. Unfortunately there is still no satisfactory approach to solve subspace clustering by self-expressive principle f or 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 un 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 Oft several famous datasets demonstrate that the proposed method achieves better clustering results than the state-of-the-art approaches.Keywords
This publication has 20 references indexed in Scilit:
- Kernel Low-Rank Representation for face recognitionNeurocomputing, 2015
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learningMachine Learning, 2014
- Kernel sparse subspace clustering2014
- Log-Euclidean Kernels for Sparse Representation and Dictionary Learning2013
- Tensor Sparse Coding for Positive Definite MatricesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2013
- Kernel Methods on the Riemannian Manifold of Symmetric Positive Definite Matrices2013
- Clustering on Grassmann manifolds via kernel embedding with application to action analysis2012
- Robust Recovery of Subspace Structures by Low-Rank RepresentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2012
- Learning Discriminative Appearance-Based Models Using Partial Least Squares2009
- A Riemannian Framework for Tensor ComputingInternational Journal of Computer Vision, 2006