Back to Search
Start Over
Sparse representation with dense matching for face recognition from single sample per person
- Source :
- 2017 Chinese Automation Congress (CAC).
- Publication Year :
- 2017
- Publisher :
- IEEE, 2017.
-
Abstract
- Many face recognition tasks encounter the problem of having only one sample for each subject, which is known as the single sample per person (SSPP) problem. To tackle the problem, we propose a strategy of sparse representation with dense matching method. First, an external training set is used to form an intra-class variation dictionary. Then, noting that captured facial features will vary with facial expression and pose, dense matching is applied to preprocess facial patches. This offers a courtesy way to overcome this obstacle and improves coherence of facial features. Finally, we make decision by extended sparse representation based classification (ESRC) based on the learned dictionary. Experiments on AR, Extended Y ale B, CMU PIE and FERET datasets demonstrate that our proposed method outperforms many state-of-the-art methods on face recognition with SSPP.
- Subjects :
- Facial expression
Matching (statistics)
Computer science
business.industry
Feature extraction
020206 networking & telecommunications
Pattern recognition
02 engineering and technology
Sparse approximation
Coherence (statistics)
Facial recognition system
Sample (graphics)
Face (geometry)
0202 electrical engineering, electronic engineering, information engineering
020201 artificial intelligence & image processing
Artificial intelligence
business
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- 2017 Chinese Automation Congress (CAC)
- Accession number :
- edsair.doi...........60ce4b0430d0ac6cc94f777a7fab8cec