iccv iccv2013 iccv2013-232 iccv2013-232-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Vishal M. Patel, Hien Van Nguyen, René Vidal
Abstract: We propose a novel algorithm called Latent Space Sparse Subspace Clustering for simultaneous dimensionality reduction and clustering of data lying in a union of subspaces. Specifically, we describe a method that learns the projection of data and finds the sparse coefficients in the low-dimensional latent space. Cluster labels are then assigned by applying spectral clustering to a similarity matrix built from these sparse coefficients. An efficient optimization method is proposed and its non-linear extensions based on the kernel methods are presented. One of the main advantages of our method is that it is computationally efficient as the sparse coefficients are found in the low-dimensional latent space. Various experiments show that the proposed method performs better than the competitive state-of-theart subspace clustering methods.
[1] R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin. A simple proof of the restricted isometry property for random matrices. Constructive Approximation, 28(3):253–263, 2008.
[2] R. Basri and D. W. Jacobs. Lambertian reflectance and linear subspaces. IEEE Trans. Pattern Anal. Mach. Intell., 25(2):218–233, 2003.
[3] G. Chen and G. Lerman. Spectral curvature clustering (SCC). International Journal of Computer Vision, 81(3):317–330, 2009.
[4] J. P. Costeira and T. Kanade. A multibody factorization method for independently moving objects. International Journal of Computer Vision, 29(3): 159–179, 1998.
[5] E. Elhamifar and R. Vidal. Sparse subspace clustering. In IEEE Conference on Computer Vision and Pattern Recognition, pages 2790–2797, 2009.
[6] E. Elhamifar and R. Vidal. Sparse subspace clustering: Algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell., 2013.
[7] P. Favaro, R. Vidal, and A. Ravichandran. A closed form solution to robust subspace estimation and clustering. In IEEE Conference on Computer Vision and Pattern Recognition, 2011.
[8] M. A. Fischler and R. C. Bolles. RANSAC random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM, 26:381–395, 1981.
[9] A. Goh and R. Vidal. Segmenting motions of different types by unsupervised manifold clustering. In IEEE Conference on Computer Vision and Pattern Recognition, 2007.
[10] T. Hastie and P. Y. Simard. Metrics and models for handwritten character recognition. Statistical Science, 13(1):54–65.
[11] J. Ho, M. H. Yang, J. Lim, K. Lee, and D. Kriegman. Clustering appearances of objects under varying illumination conditions. In IEEE Conference on Computer Vision and Pattern Recognition, 2003.
[12] K. Kanatani. Motion segmentation by subspace separation and model selection. In IEEE Conference on Computer Vision and Pattern Recognition, volume 2, pages 586–591, 2001.
[13] H. Larochelle, D. Erhan, A. Courville, J. Bergstra, and Y. Bengio. An empirical evaluation of deep architectures on problems with many factors of variation. In International Conference on Machine Learning, pages 473–480. ACM, 2007.
[14] Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradientbased learning applied to document recognition. Proceedings of the IEEE, 86(1 1):2278–2324, 1998.
[15] G. Liu, Z. Lin, and Y. Yu. Robust subspace segmentation by low-rank representation. In International Conference on Machine Learning, 2010.
[16] G. Liu and S. Yan. Latent low-rank representation for subspace segmentation and feature extraction. In IEEE International Conference on Computer Vision, pages 1615–1622, 2011.
[17] J. Mairal, F. Bach, and J. Ponce. Task-driven dictionary learning. IEEE Transactions on Pattern Analysis and Ma-
[18]
[19]
[20]
[21]
[22]
[23]
[24]
[25]
[26]
[27]
[28] chine Intelligence, 34(4):791–804, 2012. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Neural Information Processing Systems, volume 2, pages 849–856, 2002. H. V. Nguyen, V. M. Patel, N. M. Nasrabadi, and R. Chellappa. Sparse embedding: A framework for sparsity promoting dimensionality reduction. In European Conference on Computer Vision, pages 414–427, Oct. 2012. Q. Qiu and G. Sapiro. Learning transformations for clustering and classification. Preprint, 2013. R. Rubinstein, M. Zibulevsky, and M. Elad. Double sparsity: Learning sparse dictionaries for sparse signal approximation. IEEE Transactions on Signal Processing, 58(3): 1553–1564, 2010. A. H. Sameh and J. A. Wisniewski. A trace minimization algorithm for the generalized eigenvalue problem. SIAM J. Numer. Anal., 19(6): 1243–1259, 1982. M. Soltanolkotabi and E. J. Candes. A geometric analysis of subspace clustering with outliers. Annals of Statistics, 40(4):2195–2238, 2011. R. Tron, R. Vidal, and A. Ravichandran. A benchmark for the comparison of 3-d motion segmentation algorithms. In IEEE Conference on Computer Vision and Pattern Recognition, pages 1–8, 2007. R. Vidal. Subspace clustering. IEEE Signal Processing Magazine, 28(2):52–68, 2011. R. Vidal and P. Favaro. Low rank subspace clustering (LRSC). Pattern Recognition Letters, 2013. R. Vidal, Y. Ma, and S. Sastry. Generalized principal component analysis (GPCA). IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(12): 1–15, 2005. J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma. Robust face recognition via sparse representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(2):210–227, 2009.
[29] J. Yan and M. Pollefeys. A general framework for motion segmentation: Independent, articulated, rigid, non-rigid, degenerate and non-degenerate. In European Conf. on Computer Vision, page 94106, 2006.
[30] D. Zhang, M. Yang, Z. Feng, and D. Zhang. On the dimensionality reduction for sparse representation based face recognition. In International Conference on Pattern Recognition, pages 1237–1240, 2010.
[31] T. Zhang, A. Szlam, and G. Lerman. Median k-flats for hybrid linear modeling with many outliers. In Workshop on Subspace Methods, 2009. 232