Sparse Representation Based Classification for Face Recognition by k-LiMapS Algorithm
In this paper, we present a new approach for face recognition that is robust against both poorly defined and poorly aligned training and testing data even with few training samples. Working in the conventional feature space yielded by the Fisher’s Linear Discriminant analysis, it uses a recent algorithm for sparse representation, namely k-LiMapS, as general classification criterion. Such a technique performs a local ℓ0 pseudo-norm minimization by iterating suitable parametric nonlinear mappings. Thanks to its particular search strategy, it is very fast and able to discriminate among separated classes lying in the low-dimension Fisherspace. Experiments are carried out on the FRGC version 2.0 database showing good classification capability even when compared with the state-of-the-art ℓ1 norm-based sparse representation classifier (SRC).
Unable to display preview. Download preview PDF.
- 2.Rabia, J., Hamid, R.: A survey of face recognition techniques. Journal of Information Processing Systems 5 (2009)Google Scholar
- 11.Delac, K., Grgic, M. (eds.): Face Recognition. I-Tech Education and Publishing (2007)Google Scholar
- 14.Viola, P., Jones, M.: Rapid object detection using a boosted cascade of simple features. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 511–518 (2001)Google Scholar
- 15.Campadelli, P., Lanzarotti, R., Lipori, G.: Precise eye and mouth localization. International Journal of Pattern Recognition and Artificial Intelligence 23 (2009)Google Scholar
- 16.Adamo, A., Grossi, G.: A fixed-point iterative schema for error minimization in k-sparse decomposition. In: Proceedings of the IEEE International Symposium on Signal Processing and Information Technology (ISSPIT 2011), pp. 167–172 (2011)Google Scholar
- 17.Phillips, P., Flynn, P., Scruggs, T., Bowyer, K.: Overview of the face recognition grand challenge. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition (2005)Google Scholar