Flexible non-greedy discriminant subspace feature extraction

Neural Netw. 2019 Aug:116:166-177. doi: 10.1016/j.neunet.2019.04.006. Epub 2019 Apr 16.

Abstract

Recently, L1-norm-based non-greedy linear discriminant analysis (NLDA-L1) for feature extraction has been shown to be effective for dimensionality reduction, which obtains projection vectors by a non-greedy algorithm. However, it usually acquires unsatisfactory performances due to the utilization of L1-norm distance measurement. Therefore, in this brief paper, we propose a flexible non-greedy discriminant subspace feature extraction method, which is an extension of NLDA-L1 by maximizing the ratio of Lp-norm inter-class dispersion to intra-class dispersion. Besides, we put forward a powerful iterative algorithm to solve the resulted objective function and also conduct theoretical analysis on the algorithm. Finally, experimental results on image databases show the effectiveness of our method.

Keywords: Intra-class dispersion; L-norm inter-class dispersion; L-norm-based non-greedy discriminant analysis; Robust distance measurement.

MeSH terms

  • Algorithms*
  • Databases, Factual / standards
  • Discriminant Analysis
  • Goals
  • Pattern Recognition, Automated / methods*
  • Pattern Recognition, Automated / standards