title: Fisher discriminant analysis with L1-norm.
abstract: Fisher linear discriminant analysis (LDA) is a classical subspace learning technique of extracting discriminative features for pattern recognition problems. The formulation of the Fisher criterion is based on the L2-norm, which makes LDA prone to being affected by the presence of outliers. In this paper, we propose a new method, termed LDA-L1, by maximizing the ratio of the between-class dispersion to the within-class dispersion using the L1-norm rather than the L2-norm. LDA-L1 is robust to outliers, and is solved by an iterative algorithm proposed. The algorithm is easy to be implemented and is theoretically shown to arrive at a locally maximal point. LDA-L1 does not suffer from the problems of small sample size and rank limit as existed in the conventional LDA. Experiment results of image recognition confirm the effectiveness of the proposed method.
authors.forename: Haixian
authors.initials: H
authors.lastname: Wang
authors.forename: Xuesong
authors.initials: X
authors.lastname: Lu
authors.forename: Zilan
authors.initials: Z
authors.lastname: Hu
authors.forename: Wenming
authors.initials: W
authors.lastname: Zheng