Gillis, Nicolas ; Université de Mons > Faculté Polytechnique > Service de Mathématique et Recherche opérationnelle
Rahmati, Mohammad
Language :
English
Title :
Scalable and Robust Sparse Subspace Clustering Using Randomized Clustering and Multilayer Graphs
Publication date :
19 May 2019
Journal title :
Signal Processing
ISSN :
0165-1684
eISSN :
1872-7557
Publisher :
Elsevier, Netherlands
Volume :
163
Pages :
166-180
Peer reviewed :
Peer Reviewed verified by ORBi
Research unit :
F151 - Mathématique et Recherche opérationnelle
Research institute :
R300 - Institut de Recherche en Technologies de l'Information et Sciences de l'Informatique R450 - Institut NUMEDIART pour les Technologies des Arts Numériques
Jolliffe, I.T., Principal component analysis and factor analysis. Principal Component Analysis, 1986, Springer, 115–128.
Basri, R., Jacobs, D.W., Lambertian reflectance and linear subspaces. IEEE Trans. Pattern Anal. Mach. Intell. 25:2 (2003), 218–233.
Vidal, R., Subspace clustering. IEEE Signal Process. Mag. 28:2 (2011), 52–68.
Zhang, T., Szlam, A., Lerman, G., Median k-flats for hybrid linear modeling with many outliers. IEEE 12th Int. Conf. on Computer Vision Workshops, 2009, IEEE, 234–241.
Tseng, P., Nearest q-flat to m points. J. Optim. Theory Appl. 105:1 (2000), 249–252.
Ho, J., Yang, M.H., Lim, J., Lee, K.C., Kriegman, D., Clustering appearances of objects under varying illumination conditions. Proc. of the Conf. on Computer Vision and Pattern Recognition, 1, 2003, IEEE.
Tipping, M.E., Bishop, C.M., Mixtures of probabilistic principal component analyzers. Neural Comput. 11:2 (1999), 443–482.
Sugaya, Y., Kanatani, K.i., Geometric structure of degeneracy for multi-body motion segmentation. ECCV Workshop SMVP, 2004, Springer, 13–25.
Vidal, R., Ma, Y., Sastry, S., Generalized principal component analysis (GPCA). IEEE Trans. Pattern Anal. Mach. Intell. 27:12 (2005), 1945–1959.
Ma, Y., Yang, A.Y., Derksen, H., Fossum, R., Estimation of subspace arrangements with applications in modeling and segmenting mixed data. SIAM Rev. 50:3 (2008), 413–458.
Luxburg, U.V., A tutorial on spectral clustering. Stat. Comput. 17:4 (2007), 395–416.
Ng, A.Y., Jordan, M.I., Weiss, Y., On spectral clustering: analysis and an algorithm. Advances in Neural Information Processing Systems, 2002, 849–856.
Yan, J., Pollefeys, M., A general framework for motion segmentation: independent, articulated, rigid, non-rigid, degenerate and non-degenerate. European Conf. on Computer Vision, 2006, Springer, 94–106.
Goh, A., Vidal, R., Segmenting motions of different types by unsupervised manifold clustering. Computer Vision and Pattern Recognition, 2007. CVPR’07. IEEE Conference on, 2007, IEEE, 1–6.
Bruckstein, A.M., Donoho, D.L., Elad, M., From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 51:1 (2009), 34–81.
Elhamifar, E., Vidal, R., Sparse subspace clustering. Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on, 2009, IEEE, 2790–2797.
Elhamifar, E., Vidal, R., Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 35:11 (2013), 2765–2781.
Liu, G., Lin, Z., Yu, Y., Robust subspace segmentation by low-rank representation. Proceedings of the 27th International Conference on Machine Learning (ICML-10), 2010, 663–670.
Lu, C.Y., Min, H., Zhao, Z.Q., Zhu, L., Huang, D.S., Yan, S., Robust and efficient subspace segmentation via least squares regression. Computer Vision–ECCV 2012, 2012, 347–360.
Soltanolkotabi, M., Candes, E.J., A geometric analysis of subspace clustering with outliers. Ann. Stat. 40:4 (2012), 2195–2238.
Soltanolkotabi, M., Elhamifar, E., Candès, E.J., Robust subspace clustering. Ann. Stat. 42:2 (2014), 669–699.
You, C., Vidal, R., Geometric conditions for subspace-sparse recovery. Proceedings of the 32nd International Conference on Machine Learning (ICML-15), 2015, 1585–1593.
Wang, Y.X., Xu, H., Leng, C., Provable subspace clustering: when LRR meets SSC. Advances in Neural Information Processing Systems, 2013, 64–72.
Dong, X., Frossard, P., Vandergheynst, P., Nefedov, N., Clustering on multi-layer graphs via subspace analysis on Grassmann manifolds. IEEE Trans. Signal Process. 62:4 (2014), 905–918.
Peng, X., Zhang, L., Yi, Z., Scalable sparse subspace clustering. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2013, 430–437.
You, C., Robinson, D., Vidal, R., Scalable sparse subspace clustering by orthogonal matching pursuit. Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, 2016, 3918–3927.
Dyer, E.L., Sankaranarayanan, A.C., Baraniuk, R.G., Greedy feature selection for subspace clustering. J. Mach. Learn. Res. 14:1 (2013), 2487–2517.
Chen, Y., Li, G., Gu, Y., Active orthogonal matching pursuit for sparse subspace clustering. IEEE Signal Process. Lett. 25:2 (2018), 164–168.
Panagakis, Y., Kotropoulos, C., Elastic net subspace clustering applied to pop/rock music structure analysis. Pattern Recognit. Lett. 38 (2014), 46–53.
You, C., Li, C.G., Robinson, D.P., Vidal, R., Oracle based active set algorithm for scalable elastic net subspace clustering. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2016, 3928–3937.
S. Tierney, Y. Guo, J. Gao, Efficient sparse subspace clustering by nearest neighbour filtering, arXiv: 1704.03958.
Nasihatkon, B., Hartley, R., Graph connectivity in sparse subspace clustering. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), 2011, 2137–2144.
Donoho, D.L., Neighborly Polytopes and Sparse Solution of Underdetermined Linear Equations, Tech. Rep, 2005, Stanford University.
Wang, J., Zhou, J., Wonka, P., Ye, J., Lasso screening rules via dual polytope projection. Advances in Neural Information Processing Systems, 2013, 1070–1078.
Tibshirani, R., Bien, J., Friedman, J., Hastie, T., Simon, N., Taylor, J., Tibshirani, R.J., Strong rules for discarding predictors in lasso-type problems. J. R. Stat. Soc.: Ser. B 74:2 (2012), 245–266.
Kaufman, L., Rousseeuw, P., Clustering by Means of Medoids. 1987, North-Holland.
Frey, B.J., Dueck, D., Mixture modeling by affinity propagation. Advances in Neural Information Processing Systems, 2006, 379–386.
Frey, B.J., Dueck, D., Clustering by passing messages between data points. Science 315:5814 (2007), 972–976.
Chan, T.F., Rank revealing QR factorizations. Linear Algebra Appl. 88–89 (1987), 67–82.
Boutsidis, C., Mahoney, M.W., Drineas, P., An improved approximation algorithm for the column subset selection problem. Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009, SIAM, 968–977.
Papailiopoulos, D., Kyrillidis, A., Boutsidis, C., Provable deterministic leverage score sampling. Proceedings of the 20th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining - KDD 14, 2014.
Boutsidis, C., Mahoney, M.W., Drineas, P., Unsupervised feature selection for principal components analysis. Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD 08, 2008.
Chen, J., Huo, X., Theoretical results on sparse representations of multiple-measurement vectors. IEEE Trans. Signal Process. 54:12 (2006), 4634–4643.
Elhamifar, E., Sapiro, G., Vidal, R., See all by looking at a few: Sparse modeling for finding representative objects. 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012, IEEE, 1600–1607.
Gillis, N., Kuang, D., Park, H., Hierarchical clustering of hyperspectral images using rank-two nonnegative matrix factorization. IEEE Trans. Geosci. Remote Sens. 53:4 (2015), 2066–2078.
Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J., Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends® Mach. Learn. 3:1 (2011), 1–122.
Lehoucq, R.B., Sorensen, D.C., Yang, C., ARPACK Users’ Guide Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. 1997, Society for Industrial and Applied Mathematics.
You, C., Li, C., Robinson, D.P., Vidal, R., A scalable exemplar-based subspace clustering algorithm for class-imbalanced data. European Conference on Computer Vision, 2018, Springer, 68–85.
Candès, E.J., Li, X., Ma, Y., Wright, J., Robust principal component analysis?. J. ACM, 58(3), 2011, 11.
You, C., Robinson, D.P., Vidal, R., Provable selfrepresentation based outlier detection in a union of subspaces. Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition, 2017, 4323–4332.
Liu, R., Lin, Z., Su, Z., Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning. Asian Conference on Machine Learning, 2013, 116–132.
Vedaldi, A., Fulkerson, B., Vlfeat: an open and portable library of computer vision algorithms. Proceedings of the 18th ACM International Conference on Multimedia, 2010, ACM, 1469–1472.
