Name
Abstract | ||
|---|---|---|
Sparse Subspace Clustering (SSC) is one of the most popular methods for clustering a group of data points lying in a union of low-dimensional subspaces. However, SSC may suffer from heavy computational burden. Applying Orthogonal Matching Pursuit (OMP) on SSC may accelerate the computation but the trade-off is the loss of clustering accuracy. In this letter, we propose a noise-robust algorithm, Re... |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/LSP.2019.2953638 | IEEE Signal Processing Letters |
Keywords | DocType | Volume |
Matching pursuit algorithms,Clustering algorithms,Signal processing algorithms,Sparse matrices,Acceleration,Computer vision,Noise robustness | Journal | 26 |
Issue | ISSN | Citations |
12 | 1070-9908 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenqi Zhu | 1 | 0 | 0.34 |
| Shuai Yang | 2 | 18 | 8.46 |
| Zhu Yuesheng | 3 | 112 | 39.21 |