title: Robust DLPP With Nongreedy $\ell _1$ -Norm Minimization and Maximization.
abstract: Recently, discriminant locality preserving projection based on L1-norm (DLPP-L1) was developed for robust subspace learning and image classification. It obtains projection vectors by greedy strategy, i.e., all projection vectors are optimized individually through maximizing the objective function. Thus, the obtained solution does not necessarily best optimize the corresponding trace ratio optimization algorithm, which is the essential objective function for general dimensionality reduction. It results in insufficient recognition accuracy. To tackle this problem, we propose a nongreedy algorithm to solve the trace ratio formula of DLPP-L1, and analyze its convergence. Experimental results on three databases illustrate the effectiveness of our proposed algorithm.
authors.forename: Qianqian
authors.initials: Q
authors.lastname: Wang
authors.forename: Quanxue
authors.initials: Q
authors.lastname: Gao
authors.forename: Deyan
authors.initials: D
authors.lastname: Xie
authors.forename: Xinbo
authors.initials: X
authors.lastname: Gao
authors.forename: Yong
authors.initials: Y
authors.lastname: Wang