DeepAI AI Chat
Log In Sign Up

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

by   Yu Song, et al.

Subspace clustering refers to the problem of segmenting a set of data points approximately drawn from a union of multiple linear subspaces. Aiming at the subspace clustering problem, various subspace clustering algorithms have been proposed and low rank representation based subspace clustering is a very promising and efficient subspace clustering algorithm. Low rank representation method seeks the lowest rank representation among all the candidates that can represent the data points as linear combinations of the bases in a given dictionary. Nuclear norm minimization is adopted to minimize the rank of the representation matrix. However, nuclear norm is not a very good approximation of the rank of a matrix and the representation matrix thus obtained can be of high rank which will affect the final clustering accuracy. Weighted nuclear norm (WNN) is a better approximation of the rank of a matrix and WNN is adopted in this paper to describe the rank of the representation matrix. The convex program is solved via conventional alternation direction method of multipliers (ADMM) and linearized alternating direction method of multipliers (LADMM) and they are respectively refer to as WNNM-LRR and WNNM-LRR(L). Experimental results show that, compared with low rank representation method and several other state-of-the-art subspace clustering methods, WNNM-LRR and WNNM-LRR(L) can get higher clustering accuracy.


page 13

page 14


LogDet Rank Minimization with Application to Subspace Clustering

Low-rank matrix is desired in many machine learning and computer vision ...

Laplacian regularized low rank subspace clustering

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

ℓ_0-Motivated Low-Rank Sparse Subspace Clustering

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

Efficient Online Minimization for Low-Rank Subspace Clustering

Low-rank representation (LRR) has been a significant method for segmenti...

Connections Between Nuclear Norm and Frobenius Norm Based Representations

A lot of works have shown that frobenius-norm based representation (FNR)...

Fast Graph Filters for Decentralized Subspace Projection

A number of inference problems with sensor networks involve projecting a...

Robust Subspace Clustering via Smoothed Rank Approximation

Matrix rank minimizing subject to affine constraints arises in many appl...