Tensor Laplacian Regularized Low-Rank Representation for Non-uniformly Distributed Data Subspace Clustering

by   Eysan Mehrbani, et al.

Low-Rank Representation (LRR) highly suffers from discarding the locality information of data points in subspace clustering, as it may not incorporate the data structure nonlinearity and the non-uniform distribution of observations over the ambient space. Thus, the information of the observational density is lost by the state-of-art LRR models, as they take a constant number of adjacent neighbors into account. This, as a result, degrades the subspace clustering accuracy in such situations. To cope with deficiency, in this paper, we propose to consider a hypergraph model to facilitate having a variable number of adjacent nodes and incorporating the locality information of the data. The sparsity of the number of subspaces is also taken into account. To do so, an optimization problem is defined based on a set of regularization terms and is solved by developing a tensor Laplacian-based algorithm. Extensive experiments on artificial and real datasets demonstrate the higher accuracy and precision of the proposed method in subspace clustering compared to the state-of-the-art methods. The outperformance of this method is more revealed in presence of inherent structure of the data such as nonlinearity, geometrical overlapping, and outliers.



There are no comments yet.


page 4


Laplacian regularized low rank subspace clustering

The problem of fitting a union of subspaces to a collection of data poin...

Tensor Sparse and Low-Rank based Submodule Clustering Method for Multi-way Data

A new submodule clustering method via sparse and low-rank representation...

ℓ_0-Motivated Low-Rank Sparse Subspace Clustering

In many applications, high-dimensional data points can be well represent...

Superpixel Segmentation Based on Spatially Constrained Subspace Clustering

Superpixel segmentation aims at dividing the input image into some repre...

Kernelized Low Rank Representation on Grassmann Manifolds

Low rank representation (LRR) has recently attracted great interest due ...

Transformed Subspace Clustering

Subspace clustering assumes that the data is sepa-rable into separate su...

Low Rank Representation on Grassmann Manifolds: An Extrinsic Perspective

Many computer vision algorithms employ subspace models to represent data...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.