Abstract
Recently, a discriminant analysis approach on Grassmannian manifolds based on a graph-embedding framework is proposed for image set matching. However, its accuracy critically depends on the number of local neighbours when constructing a similarity graph. In this letter, a novel approach with fixed neighbour numbers is presented to implement graph embedding Grassmannian discriminant analysis. The approach utilizes the ‘low-rank component’ of set to represent each image set. During the manifold mapping, the nearest neighbour structure of nodes with same label and all the different label information are employed to preserve the local geometrical structure. Experiments on two image datasets (15-scenes categories and Caltech101) show that the proposed method outperforms state-of-the-art methods for image sets matching.
This work was supported by National Natural Science Foundation of China(No.61103070).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cevikalp, H., Triggs, B.: Face Recognition Based on Image Sets. In: IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 2567–2573 (2010)
Kim, T., Kittler, J., Cipolla, R.: Discriminative learning and recognition of image set classes using canonical correlations. J. IEEE Trans. Pattern Anal. Mach. Intell. 29(6), 1005–1018 (2007)
Wang, R.P., Shan, S.G., Chen, X.L., Gao, W.: Manifold-Manifold Distance with application to face recognition based on image set. In: IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 2940–2947 (2008)
Harandi, M., Sanderson, C., Shirazi, S., Lovell, B.C.: Graph Embedding Discriminant Analysis on Grassmannian Manifolds for Improved Image Set Matching. In: IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 2705–2712 (2011)
Lazebnik, S., Schmid, C., Ponce, J.: Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories. In: IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 2169–2178 (2006)
Liu, G., Lin, Z., Yu, Y.: Robust subspace segmentation by low-rank representation. In: 27th International Coference on Machine Learning (ICML), pp. 663–670 (2010)
Yan, S., Xu, D., Zhang, B., Zhang, H., Yang, Q., Lin, S.: Graph embedding and extensions: A general framework for dimensionality reduction. J. IEEE Trans. Pattern Anal. Mach. Intell. 29(1), 40–51 (2007)
Li, F.-F., Fergus, R., Perona, P.: Learning Generative Visual Models from Few Training Examples: An Incremental Bayesian Approach Tested on 101 Object Categories. In: IEEE Conf. Computer Vision and Pattern Recognition Workshop (CVPRW), vol. 27(02), pp. 178–186 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lv, X., Chen, G., Wang, Z., Chen, Y., Zhao, W. (2012). Grassmannian Manifolds Discriminant Analysis Based on Low-Rank Representation for Image Set Matching. In: Liu, CL., Zhang, C., Wang, L. (eds) Pattern Recognition. CCPR 2012. Communications in Computer and Information Science, vol 321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33506-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-33506-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33505-1
Online ISBN: 978-3-642-33506-8
eBook Packages: Computer ScienceComputer Science (R0)