Laplacian regularized low rank subspace clustering

by   Yu Song, et al.

The problem of fitting a union of subspaces to a collection of data points drawn from multiple subspaces is considered in this paper. In the traditional low rank representation model, the dictionary used to represent the data points is chosen as the data points themselves and thus the dictionary is corrupted with noise. This problem is solved in the low rank subspace clustering model which decomposes the corrupted data matrix as the sum of a clean and self-expressive dictionary plus a matrix of noise and gross errors. Also, the clustering results of the low rank representation model can be enhanced by using a graph of data similarity. This model is called Laplacian regularized low rank representation model with a graph regularization term added to the objective function. Inspired from the above two ideas, in this paper a Laplacian regularized low rank subspace clustering model is proposed. This model uses a clean dictionary to represent the data points and a graph regularization term is also incorporated in the objective function. Experimental results show that, compared with the traditional low rank representation model, low rank subspace clustering model and several other state-of-the-art subspace clustering model, the model proposed in this paper can get better subspace clustering results with lower clustering error.


Subspace clustering based on low rank representation and weighted nuclear norm minimization

Subspace clustering refers to the problem of segmenting a set of data po...

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

Low-Rank Representation (LRR) highly suffers from discarding the localit...

Multilayer Collaborative Low-Rank Coding Network for Robust Deep Subspace Discovery

For subspace recovery, most existing low-rank representation (LRR) model...

Constrained Low-Rank Learning Using Least Squares-Based Regularization

Low-rank learning has attracted much attention recently due to its effic...

Union of Low-Rank Subspaces Detector

The problem of signal detection using a flexible and general model is co...

Robust Recovery of Subspace Structures by Low-Rank Representation

In this work we address the subspace recovery problem. Given a set of da...

Hyperspectral Target Detection Based on Low-Rank Background Subspace Learning and Graph Laplacian Regularization

Hyperspectral target detection is good at finding dim and small objects ...

Please sign up or login with your details

Forgot password? Click here to reset