© 2017 SPIE. Low-rank representation (LRR) has been successfully applied to subspace clustering. However, the nuclear norm in the standard LRR is not optimal for approximating the rank function in many real-world applications. Meanwhile, the L21 norm in LRR also fails to characterize various noises properly. To address the above issues, we propose an improved LRR method, which achieves low rank property via the new formulation with weighted Schatten-p norm and Lq norm (WSPQ). Specifically, the nuclear norm is generalized to be the Schatten-p norm and different weights are assigned to the singular values, and thus it can approximate the rank function more accurately. In addition, Lq norm is further incorporated into WSPQ to model different n...
Low rank matrix approximation (LRMA), which aims to recover the underlying low rank matrix from its ...
In this paper, we address the subspace clustering problem. Given a set of data samples (vectors) app...
In this paper, we address the subspace clustering problem. Given a set of data samples (vectors) app...
© 2017 IEEE. Low rank representation (LRR) is powerful for subspace clustering due to its strong abi...
In many applications, high-dimensional data points can be well represented by low-dimensional subspa...
Low-rank representation (LRR) has been successfully applied in exploring the subspace structures of ...
In the global low rank spectral subspace clustering model, the rank minimization problem is relaxed ...
In this paper, we propose a low-rank representation with symmetric constraint (LRRSC) method for rob...
Low-rank matrix is desired in many machine learning and computer vision problems. Most of the recent...
Sparse Subspace Clustering (SSC) and Low-Rank Representation (LRR) are both considered as the state-...
Sparse Subspace Clustering (SSC) and Low-Rank Representation (LRR) are both considered as the state-...
Subspace clustering aims to partition the data points drawn from a union of subspaces according to t...
Subspace clustering aims to partition the data points drawn from a union of subspaces according to ...
An important problem in analyzing big data is subspace clustering, i.e., to represent a collection o...
We propose a low-rank transformation-learning framework to robustify sub-space clustering. Many high...
Low rank matrix approximation (LRMA), which aims to recover the underlying low rank matrix from its ...
In this paper, we address the subspace clustering problem. Given a set of data samples (vectors) app...
In this paper, we address the subspace clustering problem. Given a set of data samples (vectors) app...
© 2017 IEEE. Low rank representation (LRR) is powerful for subspace clustering due to its strong abi...
In many applications, high-dimensional data points can be well represented by low-dimensional subspa...
Low-rank representation (LRR) has been successfully applied in exploring the subspace structures of ...
In the global low rank spectral subspace clustering model, the rank minimization problem is relaxed ...
In this paper, we propose a low-rank representation with symmetric constraint (LRRSC) method for rob...
Low-rank matrix is desired in many machine learning and computer vision problems. Most of the recent...
Sparse Subspace Clustering (SSC) and Low-Rank Representation (LRR) are both considered as the state-...
Sparse Subspace Clustering (SSC) and Low-Rank Representation (LRR) are both considered as the state-...
Subspace clustering aims to partition the data points drawn from a union of subspaces according to t...
Subspace clustering aims to partition the data points drawn from a union of subspaces according to ...
An important problem in analyzing big data is subspace clustering, i.e., to represent a collection o...
We propose a low-rank transformation-learning framework to robustify sub-space clustering. Many high...
Low rank matrix approximation (LRMA), which aims to recover the underlying low rank matrix from its ...
In this paper, we address the subspace clustering problem. Given a set of data samples (vectors) app...
In this paper, we address the subspace clustering problem. Given a set of data samples (vectors) app...