A Structured Sparse Plus Structured Low-Rank Framework for Subspace Clustering and Completion

DOI10.1109/TSP.2016.2613070zbMATH Open1414.94340OpenAlexW2527399347MaRDI QIDQ4619680FDOQ4619680

Author name not available (Why is that?)

Publication date: 7 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2016.2613070

Recommendations

• Sparse subspace clustering for data with missing entries and high-rank matrix completion
• A subspace clustering algorithm based on simultaneously sparse and low-rank representation
• Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework
• An efficient matrix factorization based low-rank representation for subspace clustering
• Subspace clustering by \((k,k)\)-sparse matrix factorization
• A subspace clustering method based on class-wise sparse and low-rank representation
• Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
• A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited In (2)

• Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data
• Unsupervised robust discriminative manifold embedding with self-expressiveness

This page was built for publication: A Structured Sparse Plus Structured Low-Rank Framework for Subspace Clustering and Completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4619680)