Sparse Representation Based Classification for Face Recognition by k-LiMapS Algorithm
- Cite this paper as:
- Adamo A., Grossi G., Lanzarotti R. (2012) Sparse Representation Based Classification for Face Recognition by k-LiMapS Algorithm. In: Elmoataz A., Mammass D., Lezoray O., Nouboud F., Aboutajdine D. (eds) Image and Signal Processing. ICISP 2012. Lecture Notes in Computer Science, vol 7340. Springer, Berlin, Heidelberg
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.