Self-regularized fixed-rank representation for subspace segmentation
From MaRDI portal
Publication:778387
Recommendations
- A subspace clustering algorithm based on simultaneously sparse and low-rank representation
- Robust subspace segmentation via nonconvex low rank representation
- Subspace segmentation by dense block and sparse representation
- Nonnegative self-representation with a fixed rank constraint for subspace clustering
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
Cites work
- A Singular Value Thresholding Algorithm for Matrix Completion
- Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering
- Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
- Generalized transfer subspace learning through low-rank constraint
- Hybrid linear modeling via local best-fit flats
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Solution of the matrix equation AX - XB = C
Cited in
(4)
This page was built for publication: Self-regularized fixed-rank representation for subspace segmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778387)