Feature extraction based on Laplacian bidirectional maximum margin criterion

  • Authors:
  • Wankou Yang;Jianguo Wang;Mingwu Ren;Jingyu Yang;Lei Zhang;Guanghai Liu

  • Affiliations:
  • School of Computer Science & Technology, Nanjing University of Science and Technology, Nanjing 210094, China;Network & Education Center, Tangshan College, Tangshan 063000, China;School of Computer Science & Technology, Nanjing University of Science and Technology, Nanjing 210094, China;School of Computer Science & Technology, Nanjing University of Science and Technology, Nanjing 210094, China;Dept. of Computing, The Hong Kong Polytechnic University, Hong Kong;School Computer Science and Information Technology, Guangxi Normal University, Guangxi, China

  • Venue:
  • Pattern Recognition
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Maximum margin criterion (MMC) based feature extraction is more efficient than linear discriminant analysis (LDA) for calculating the discriminant vectors since it does not need to calculate the inverse within-class scatter matrix. However, MMC ignores the discriminative information within the local structures of samples and the structural information embedding in the images. In this paper, we develop a novel criterion, namely Laplacian bidirectional maximum margin criterion (LBMMC), to address the issue. We formulate the image total Laplacian matrix, image within-class Laplacian matrix and image between-class Laplacian matrix using the sample similar weight that is widely used in machine learning. The proposed LBMMC based feature extraction computes the discriminant vectors by maximizing the difference between image between-class Laplacian matrix and image within-class Laplacian matrix in both row and column directions. Experiments on the FERET and Yale face databases show the effectiveness of the proposed LBMMC based feature extraction method.