An efficient face verification method in a transformed domain

In this paper we propose a low-complexity face verification system based on the Walsh-Hadamard transform. This system can be easily implemented on a fixed point processor and offers a good compromise between computational burden and verification rates. We have evaluated that with 36 integer coefficients per face we achieve better Detection Cost Function (6.05%) than the classical eigenfaces approach (minimum value 6.99% with 126 coefficients), with a smaller number of coefficients.

[1]  Anil K. Jain.  Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.

[2]  M. Turk,et al.  Eigenfaces for Recognition , 1991, Journal of Cognitive Neuroscience.

[3]  J.A. Ortega,et al.  A low-cost Webcam & personal computer opens doors , 2005, IEEE Aerospace and Electronic Systems Magazine.

[4]  M. Faundez-Zanuy,et al.  On the vulnerability of biometric security systems , 2004, IEEE Aerospace and Electronic Systems Magazine.

[5]  M. Faundez-Zanuy,et al.  Data fusion in biometrics , 2005, IEEE Aerospace and Electronic Systems Magazine.

[6]  Alvin F. Martin,et al.  The DET curve in assessment of detection task performance , 1997, EUROSPEECH.

[7]  Toby Berger,et al.  Digital Compression For Multimedia Principles And Standards , 1998 .

[8]  Andy Harter,et al.  Parameterisation of a stochastic model for human face identification , 1994, Proceedings of 1994 IEEE Workshop on Applications of Computer Vision.

[9]  Isabelle Guyon,et al.  What Size Test Set Gives Good Error Rate Estimates? , 1998, IEEE Trans. Pattern Anal. Mach. Intell..