Generalized linear discriminant analysis based on euclidean norm for gait recognition

35Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

One of the key issues in gait recognition is how to extract the low dimensional feature. Linear Discriminant Analysis (LDA) is a commonly used method for linear dimension reduction. This paper proposed a generalized LDA based on Euclidean norm (ELDA) for gait recognition. By redefining a better between-class scatter matrix to separate the neighboring samples that overcome the drawbacks existing in the traditional LDA method. Firstly, the contour is unwrapped counterclockwise by the distance from the uppermost pixel to transformed 2D features into 1D. Secondly, we use ELDA to obtain more discriminative feature space. Finally, multi-class Support Vector Machine (SVM) is applied to implement gait classification. Experimental results show that this algorithm achieves better results in terms of accuracy and efficiency than other gait recognition methods at present.

Cite

CITATION STYLE

APA

Wang, H., Fan, Y., Fang, B., & Dai, S. (2018). Generalized linear discriminant analysis based on euclidean norm for gait recognition. International Journal of Machine Learning and Cybernetics, 9(4), 569–576. https://doi.org/10.1007/s13042-016-0540-0

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