Boosting a haar-like feature set for face verification

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describe our ongoing work in the field of face verification. We propose a novel verification method based on a set of haar-like features which is optimized using AdaBoost. Seven different types of generic kernels constitute the starting base for the feature extraction process. The convolution of the different kernels with the face image, each varying in size and aspect-ratio, leeds to a high-dimensional feature space (270000 for an image of size 64×64). As the number of features quadruples the number of pixels in the original image we try to determine only the most discriminating features for the verification task. The selection of a few hundred of the most discriminative features is performed using the Ada-Boost training algorithm. Experimental results are presented on the M2VTS-database according to the Lausanne-Protocol, where we can show that a reliable verification system can be realized representing a face with only 200 features. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

Fröba, B., Stecher, S., & Küblbeck, C. (2003). Boosting a haar-like feature set for face verification. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2688, 617–624. https://doi.org/10.1007/3-540-44887-x_73

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free