Multilinear tensor-based non-parametric dimension reduction for gait recognition

8Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The small sample size problem and the difficulty in determining the optimal reduced dimension limit the application of subspace learning methods in the gait recognition domain. To address the two issues, we propose a novel algorithm named multi-linear tensor-based learning without tuning parameters (MTP) for gait recognition. In MTP, we first employ a new method for automatic selection of the optimal reduced dimension. Then, to avoid the small sample size problem, we use multi-linear tensor projections in which the dimensions of all the subspaces are automatically tuned. Theoretical analysis of the algorithm shows that MTP converges. Experiments on the USF Human Gait Database show promising results of MTP compared to other gait recognition methods. © Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Chen, C., Zhang, J., & Fleischer, R. (2009). Multilinear tensor-based non-parametric dimension reduction for gait recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5558 LNCS, pp. 1030–1039). https://doi.org/10.1007/978-3-642-01793-3_104

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