• DocumentCode
    2338496
  • Title

    Polynomial features for robust face authentication

  • Author

    Sanderson, Conrad ; Paliwal, Kuldip IC

  • Author_Institution
    Sch. of Microelectron. Eng., Griffith Univ., Brisbane, Qld., Australia
  • Volume
    3
  • fYear
    2002
  • fDate
    24-28 June 2002
  • Firstpage
    997
  • Abstract
    We introduce the DCT-mod2 facial feature extraction technique which utilizes polynomial coefficients derived from 2D DCT coefficients of spatially neighbouring blocks. We evaluate its robustness and performance against three popular feature sets for use in an identity verification system subject to illumination changes. Results on the multi-session VidTIMIT database suggest that the proposed feature set is the most robust, followed by (in order of robustness and performance): 2D Gabor wavelets; 2D DCT coefficients; PCA (eigenface) derived features. Moreover, compared to Gabor wavelets, the DCT-mod2 feature set is over 80 times quicker to compute.
  • Keywords
    biometrics (access control); discrete cosine transforms; face recognition; feature extraction; polynomials; 2D DCT coefficients; 2D Gabor wavelets; PCA; access control; eigenface; facial feature extraction; identity verification; polynomial coefficients; robust face authentication; security applications; Authentication; Discrete cosine transforms; Feature extraction; Hidden Markov models; Lighting; Microelectronics; Polynomials; Principal component analysis; Robustness; Spatial databases;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Processing. 2002. Proceedings. 2002 International Conference on
  • ISSN
    1522-4880
  • Print_ISBN
    0-7803-7622-6
  • Type

    conf

  • DOI
    10.1109/ICIP.2002.1039143
  • Filename
    1039143