Abstract

In this paper, a new face recognition algorithm based on Haar-Like features and Gentle Adaboost (GA) feature selection via sparse representation was proposed. Firstly, all the images including face images and non-face images were normalized to size 20 × 20, then Haar-Like features were extracted from the images after size normalization. The number of the extracted features is more than 125,199. Then, Gentle Adaboost algorithm was exploited to feature selection that reduced the feature dimension and retained the most effective features for face recognition. Finally, the samples were classified and identified for face recognition via sparse representation classification (SRC) algorithm. Comparing it with SRC, Nearest Neighbor (NN), Nearest Subspace (NS), Support Vector Machine (SVM) algorithms, the experiment results on AR database demonstrate that the new proposed algorithm can achieve a higher recognition rate than these traditional algorithms. Even though the increase of the dimension, the new proposed algorithm always got higher recognition rate than SRC and other algorithms, which proved the new algorithm can get better identification effects and stronger stability in the low dimension feature space. Keywords-Haar-Like features; Gentle Adaboost; sparse representation; face recognition

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call