This paper proposes a novel nonlinear discriminant analysis method named by kernerlized maximum average margin criterion (KMAMC), which has combined the idea of support vector machine with the kernel fisher discriminant analysis (KFD). We also use a simple method to prove the relationship between both kernel methods. The difference of KMAMC from traditional KFD methods include: (1) the within-class and between-class scatter matrices are computed based on the support vectors instead of all the samples; (2) multiple centers are exploited instead of the single center in computing the two scatter matrices; (3) the discriminant criteria is formulated as subtracting the trace of within-class scatter matrix from that of the between-class scatter matrix, therefore, the tedious singularity problem is avoided. These features have made KMAMC more practical for real-world applications. Our experiments on two face databases, the FERET and CAS-PEAL face database, have illustrated its excellent performance compared with some traditional methods such as Eigenface, Fisherface, and KFD.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Nonlinear face recognition based on maximum average margin criterion


    Contributors:
    Baochang Zhang, (author) / Xilin Chen, (author) / Shiguang Shan, (author) / Wen Gao, (author)


    Publication date :

    2005-01-01


    Size :

    208698 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Nonparametric Maximum Margin Criterion for Face Recognition

    Qiu, X. / Wu, L. | British Library Conference Proceedings | 2005




    Face Recognition by Stepwise Nonparametric Margin Maximum Criterion

    Qiu, X. / Wu, L. / IEEE | British Library Conference Proceedings | 2005


    Discriminant feature extraction for image recognition using complete robust maximum margin criterion

    Chen, X. / Cai, Y. / Chen, L. et al. | British Library Online Contents | 2015