Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
535115 | Pattern Recognition Letters | 2007 | 5 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Marcos Faundez-Zanuy, Josep Roure, Virginia Espinosa-Duró, Juan Antonio Ortega,