Sciweavers

ICIP
2002
IEEE

Polynomial features for robust face authentication

15 years 14 days ago
Polynomial features for robust face authentication
In this paper we introduce the DCT-mod2 facial feature extraction technique which utilizes polynomial coefficients derived from 2-D 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): 2-D Gabor wavelets, 2-D DCT coefficients and PCA (eigenface) derived features. Moreover, compared to Gabor wavelets, the DCT-mod2 feature set is over 80 times quicker to compute.
Conrad Sanderson, Kuldip K. Paliwal
Added 24 Oct 2009
Updated 27 Oct 2009
Type Conference
Year 2002
Where ICIP
Authors Conrad Sanderson, Kuldip K. Paliwal
Comments (0)