Optimal subset-division based discrimination and its kernelization for face and palmprint recognition

  • Authors:
  • Xiaoyuan Jing;Sheng Li;David Zhang;Chao Lan;Jingyu Yang

  • Affiliations:
  • State Key Laboratory of Software Engineering, Wuhan University, Wuhan, China and College of Automation, Nanjing University of Posts and Telecommunications, China and State Key Laboratory for Novel ...;College of Automation, Nanjing University of Posts and Telecommunications, China;Department of Computing, Hong Kong Polytechnic University, Kowloon, Hong Kong, China;College of Automation, Nanjing University of Posts and Telecommunications, China;College of Computer Science, Nanjing University of Science and Technology, China

  • Venue:
  • Pattern Recognition
  • Year:
  • 2012

Quantified Score

Hi-index 0.01

Visualization

Abstract

Discriminant analysis is effective in extracting discriminative features and reducing dimensionality. In this paper, we propose an optimal subset-division based discrimination (OSDD) approach to enhance the classification performance of discriminant analysis technique. OSDD first divides the sample set into several subsets by using an improved stability criterion and K-means algorithm. We separately calculate the optimal discriminant vectors from each subset. Then we construct the projection transformation by combining the discriminant vectors derived from all subsets. Furthermore, we provide a nonlinear extension of OSDD, that is, the optimal subset-division based kernel discrimination (OSKD) approach. It employs the kernel K-means algorithm to divide the sample set in the kernel space and obtains the nonlinear projection transformation. The proposed approaches are applied to face and palmprint recognition, and are examined using the AR and FERET face databases and the PolyU palmprint database. The experimental results demonstrate that the proposed approaches outperform several related linear and nonlinear discriminant analysis methods.