Spatial distribution preserving-based sparse subspace clustering for hyperspectral image
From MaRDI portal
Publication:4632142
Recommendations
- An efficient superpixel-based sparse representation framework for hyperspectral image classification
- Spatial correlation constrained weighted conditional sparse representation for hyperspectral image classification
- Sparse graph regularized matrix discriminant analysis for hyperspectral image classification
- Robust subspace learning method for hyperspectral image classification
- Subspace learning via local probability distribution for hyperspectral image classification
Cites work
- Algorithm AS 136: A K-Means Clustering Algorithm
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Face Recognition Under Varying Illumination Using Gradientfaces
- Multiscale facial structure representation for face recognition under varying illumination
- New method for feature extraction based on fractal behavior
- On the Volume Elements on a Manifold
- Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework
Cited in
(5)- An efficient superpixel-based sparse representation framework for hyperspectral image classification
- Sparse representation based binary hypothesis model for hyperspectral image classification
- Subspace learning via local probability distribution for hyperspectral image classification
- Hyperspectral image unsupervised classification by robust manifold matrix factorization
- Robust subspace learning method for hyperspectral image classification
This page was built for publication: Spatial distribution preserving-based sparse subspace clustering for hyperspectral image
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632142)