.png){kind=icon}
.png){kind=icon}
Return
Flexible non-greedy discriminant subspace feature extraction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2019.04.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, L-1-norm-based non-greedy linear discriminant analysis (NLDA-L-1) 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 L-1-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-L-1 by maximizing the ratio of L-p-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 (C) 2019 Elsevier Ltd. All rights reserved.
Keywords:
L-1-norm-based non-greedy discriminant analysis
L-p-norm inter-class dispersion
Intra-class dispersion
Robust distance measurement
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
7.8K
Citations:
3.0W
View more organizations