Category guided sparse preserving projection for biometric data dimensionality reduction

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In biometric recognition tasks, dimensionality reduction is an important pre-process which might influence the effectiveness and efficiency of subsequent procedure. Many manifold learning algorithms arise to preserve the optimal data structure by learning a projective maps and achieve great success in biometric tasks like face recognition. In this paper, we proposed a new supervised manifold learning dimensionality reduction algorithm named Category Guided Sparse Preserving Projection (CG-SPP) which combines the global category information with the merits of sparse representation and Locality Preserving Projection (LPP). Besides the sparse graph Laplacian which preserves the intrinsic data structure of samples, a category guided graph is introduced to assist in better preserving the intrinsic data structure of subjects. We apply it to face recognition and gait recognition tasks in several datasets, namely Yale, FERET, ORL, AR and OA-ISIR-A. The experimental results show its power in dimensionality reduction in comparison with the state-ofthe-art algorithms.

Cite

CITATION STYLE

APA

Huang, Q., Wu, Y., Zhao, C., Zhang, X., & Yang, D. (2016). Category guided sparse preserving projection for biometric data dimensionality reduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9967 LNCS, pp. 539–546). Springer Verlag. https://doi.org/10.1007/978-3-319-46654-5_59

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free