Abstract
In this paper we emphasize the relevance of low-complexity algorithms for biometric recognition and we present to examples with special emphasis on face recognition. Our face recognition application has been implemented on a low-cost fixed point processor and we have evaluated that with 169 integer coefficients per face we achieve better identification results (92%) than the classical eigenfaces approach (86.5%), and close to the DCT (92.5%) with a reduced computational cost. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Faundez-Zanuy, M., Espinosa-Duró, V., & Ortega, J. A. (2007). Low-complexity algorithms for biometric recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4775 LNAI, pp. 275–285). Springer Verlag. https://doi.org/10.1007/978-3-540-76442-7_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
