A rank-constrained matrix representation for hypergraph-based subspace clustering
Summary: This paper presents a novel, rank-constrained matrix representation combined with hypergraph spectral analysis to enable the recovery of the original subspace structures of corrupted data. Real-world data are frequently corrupted with both sparse error and noise. Our matrix decomposition model separates the low-rank, sparse error, and noise components from the data in order to enhance robustness to the corruption. In order to obtain the desired rank representation of the data within a dictionary, our model directly utilizes rank constraints by restricting the upper bound of the rank range. An alternative projection algorithm is proposed to estimate the low-rank representation and separate the sparse error from the data matrix. To further capture the complex relationship between data distributed in multiple subspaces, we use hypergraph to represent the data by encapsulating multiple related samples into one hyperedge. The final clustering result is obtained by spectral decomposition of the hypergraph Laplacian matrix. Validation experiments on the Extended Yale Face Database B, AR, and Hopkins 155 datasets show that the proposed method is a promising tool for subspace clustering.
- Block diagonal representation learning for robust subspace clustering
- An efficient matrix factorization based low-rank representation for subspace clustering
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
- Robust subspace clustering
- Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
This page was built for publication: A rank-constrained matrix representation for hypergraph-based subspace clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1666026)
