Robust Subspace Segmentation by Low-Rank Representation
Explore this paper's citation graph
Summary
Both theoretical and experimental results show that low-rank representation is a promising tool for subspace segmentation from corrupted data.
- Type
- article
- Published
- 2010-06-21
- Cited by
- 1,753
- References
- 28
- OpenAlex
- https://openalex.org/W79405465
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:8329460
Keywords
Linear subspace, Subspace topology, Representation (politics), Pattern recognition (psychology), Rank (graph theory)
References
- Robust Recovery of Signals From a Union of Subspaces
- Robust Algebraic Segmentation of Mixed Rigid-Body and Planar Motions from Two Views
- Sparse subspace clustering
- Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
- Median K-Flats for hybrid linear modeling with many outliers
- Matrix Completion With Noise
- A Benchmark for the Comparison of 3-D Motion Segmentation Algorithms
- Classification via Minimum Incremental Coding Length
- Combined central and subspace clustering for computer vision applications
- Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography
- Multibody factorization with uncertainty and missing data using the EM algorithm
- A Singular Value Thresholding Algorithm for Matrix Completion
- A Multibody Factorization Method for Independently Moving Objects
- Robust Statistical Estimation and Segmentation of Multiple Subspaces
- Exact Matrix Completion via Convex Optimization
- Clustering appearances of objects under varying illumination conditions
- Acquiring linear subspaces for face recognition under variable lighting
- Robust Face Recognition via Sparse Representation
- Normalized cuts and image segmentation
- Robust principal component analysis?
Cited by
- Motion-based segmentation of objects using overlapping temporal windows
- Point cloud normal estimation via low-rank subspace clustering
- General Subspace Learning With Corrupted Training Data Via Graph Embedding
- Flexible Affinity Matrix Learning for Unsupervised and Semisupervised Classification
- Robust Principal Component Analysis with Complex Noise
- Efficient Subspace Segmentation via Quadratic Programming
- Subspace clustering using a symmetric low-rank representation
- Analyzing the Subspace Structure of Related Images: Concurrent Segmentation of Image Sets
- Clustering Consistent Sparse Subspace Clustering
- Nuclei/Cell Detection in Microscopic Skeletal Muscle Fiber Images and Histopathological Brain Tumor Images Using Sparse Optimizations
- A Convex Model for Matrix Factorization and Dimensionality Reduction on Physical Space and Its Application to Blind Hyperspectral Unmixing
- A non-negative representation learning algorithm for selecting neighbors
- Bilinear low-rank coding framework and extension for robust image recovery and feature representation
- Multi-View Low-Rank Analysis for Outlier Detection
- Robust facial representation for recognition
- Segmentation of Subspaces in Sequential Data
- A Local Non-Negative Pursuit Method for Intrinsic Manifold Structure Preservation
- Robust image hashing with tampering recovery capability via low-rank and sparse representation
- Temporally Coherent Bayesian Models for Entity Discovery in Videos by Tracklet Clustering
- Low-Rank Preserving Projections
Related papers
- Subspace Clustering
- Generalized principal component analysis (GPCA)
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Robust principal component analysis?
- Latent Low-Rank Representation for subspace segmentation and feature extraction
- Robust Face Recognition via Sparse Representation
- Acquiring linear subspaces for face recognition under variable lighting
- From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose
- Normalized cuts and image segmentation