Image sets and videos can be modeled as subspaces which are actually points on Grassmann manifolds. Clustering of such visual data lying on Grassmann manifolds is a hard issue based on the fact that the state-of-the-art methods are only applied to vector space instead of non-Euclidean geometry. In this paper, we propose a novel algorithm termed as kernel sparse subspace clustering on the Grassmann manifold (GKSSC) which embeds the Grassmann manifold into a Reproducing Kernel Hilbert Space (RKHS) by an appropriate Gaussian projection kernel. This kernel is applied to obtain kernel sparse representations of data on Grassmann manifolds utilizing the self-expressive property and exploiting the intrinsic Riemannian geometry within data. Although...
In video based face recognition, great success has been made by representing videos as linear subspa...
It is a challenging problem to cluster multi- and high-dimensional data with complex intrinsic prope...
Abstract—This paper addresses the problem of identifying a very small subset of data points that bel...
Image sets and videos can be modeled as subspaces which are actually points on Grassmann manifolds. ...
Image sets and videos can be modeled as subspaces, which are actually points on Grassmann manifolds....
With the aim of improving the clustering of data (such as image sequences) lying on Grassmann manifo...
The higher-order clustering problem arises when data is drawn from multiple subspaces or when observ...
Sparse subspace clustering (SSC), as one of the most successful subspace clustering methods, has ach...
An important tool in high-dimensional, explorative data mining is given by clustering methods. They ...
An important tool in high-dimensional, explorative data mining is given by clustering methods. They ...
Modelling video sequences by subspaces has recently shown promise for recognising human actions. Sub...
Image clustering methods are efficient tools for applications such as content-based image retrieval ...
Modeling videos and image-sets as linear subspaces has proven beneficial for many visual recognition...
Abstract. Modeling videos and image-sets as linear subspaces has proven beneficial for many visual r...
Grassmann manifold based sparse spectral clustering is a classification technique that consists in l...
In video based face recognition, great success has been made by representing videos as linear subspa...
It is a challenging problem to cluster multi- and high-dimensional data with complex intrinsic prope...
Abstract—This paper addresses the problem of identifying a very small subset of data points that bel...
Image sets and videos can be modeled as subspaces which are actually points on Grassmann manifolds. ...
Image sets and videos can be modeled as subspaces, which are actually points on Grassmann manifolds....
With the aim of improving the clustering of data (such as image sequences) lying on Grassmann manifo...
The higher-order clustering problem arises when data is drawn from multiple subspaces or when observ...
Sparse subspace clustering (SSC), as one of the most successful subspace clustering methods, has ach...
An important tool in high-dimensional, explorative data mining is given by clustering methods. They ...
An important tool in high-dimensional, explorative data mining is given by clustering methods. They ...
Modelling video sequences by subspaces has recently shown promise for recognising human actions. Sub...
Image clustering methods are efficient tools for applications such as content-based image retrieval ...
Modeling videos and image-sets as linear subspaces has proven beneficial for many visual recognition...
Abstract. Modeling videos and image-sets as linear subspaces has proven beneficial for many visual r...
Grassmann manifold based sparse spectral clustering is a classification technique that consists in l...
In video based face recognition, great success has been made by representing videos as linear subspa...
It is a challenging problem to cluster multi- and high-dimensional data with complex intrinsic prope...
Abstract—This paper addresses the problem of identifying a very small subset of data points that bel...