Self-regularized fixed-rank representation for subspace segmentation
From MaRDI portal
Publication:778387
DOI10.1016/J.INS.2017.05.007zbMATH Open1435.68333OpenAlexW2612568300MaRDI QIDQ778387FDOQ778387
Authors: D. Kharzeev 
Publication date: 2 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.05.007
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
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A Singular Value Thresholding Algorithm for Matrix Completion
- Generalized transfer subspace learning through low-rank constraint
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
- Hybrid linear modeling via local best-fit flats
- Solution of the matrix equation AX - XB = C
- Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering
Cited In (4)
Uses Software
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)
