Kernel sparse representation with local patterns for face recognition
Authors:
- 1 September 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15224880,p. 3009-3012
Abstract
In this paper we propose a novel kernel sparse representation classification (SRC) framework and utilize the local binary pattern (LBP) descriptor in this framework for robust face recognition. First we develop a kernel coordinate descent (KCD) algorithm for 11 minimization in the kernel space, which is based on the covariance update technique. Then we extract LBP descriptors from each image and apply two types of kernels (χ 2 distance based and Hamming distance based) with the proposed KCD algorithm under the SRC framework for face recognition. Experiments on both the Extended Yale B and the PIE face databases show that the proposed method is more robust against noise, occlusion, and illumination variations, even with small number of training samples.Keywords
This publication has 8 references indexed in Scilit:
- Regression Shrinkage and Selection via The Lasso: A RetrospectiveJournal of the Royal Statistical Society Series B: Statistical Methodology, 2011
- Sparse representation of (Multiscale) histograms for face recognition robust to registration and illumination problems2010
- Visual classification with multi-task joint sparse representation2010
- SENSC: a Stable and Efficient Algorithm for Nonnegative Sparse CodingActa Automatica Sinica, 2009
- Robust Face Recognition via Sparse RepresentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- Acquiring linear subspaces for face recognition under variable lightingIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- The CMU Pose, Illumination, and Expression (PIE) database2003
- A comparative study of texture measures with classification based on featured distributionsPattern Recognition, 1996