Orthogonal Margin Maximization Projection for Gait Recognition

Article type: Research Article

Authors: Zhang, Shanwen¹ | Zhang, Chuanlei^{2; *}

Affiliations: [1] Department of Electrical and Computer Engineering, Xijing University, Xi’an 710123, China | [2] School of Computer Science and Information Engineering, Tianjin University of Science and Technology, Tianjin 300222, China, e-mail: wjdw716@163.com, 97313114@tust.edu.cn

Correspondence: [*] Corresponding author.

Abstract: An efficient supervised orthogonal nonlinear dimensionality reduction algorithm, namely orthogonal margin maximization projection (OMMP), is presented for gait recognition in this paper. Taking the local neighborhood geometry structure and class information into account, the proposed algorithm aims to find a projecting matrix by maximizing the local neighborhood margin between the different classes and preserving the local geometry structure of the data. After projecting, the data points in the same class are pulled as close as possible, while the data points in different classes are pushed as far as possible. The highlights of OMMP include (1) takes both of the local information and class information of the data into account; (2) considers the effect of the noisy points and outliers; (3) it is supervised and orthogonal; and (4) its physical meaning is very clear. The experimental results on a public gait database show the effectiveness of the proposed method.

Keywords: biometric, gait recognition, nonlinear dimensionality reduction, orthogonal margin maximization projection (OMMP)

Journal: Informatica, vol. 26, no. 2, pp. 357-367, 2015