Direct sparse nearest feature classifier for face recognition

  • Authors:
  • Ran He;Nanhai Yang;Xiu-Kun Wang;Guo-Zhen Tan

  • Affiliations:
  • School of Computer Science, Dalian University of Technolgoy, Dalian, China;School of Computer Science, Dalian University of Technolgoy, Dalian, China;School of Computer Science, Dalian University of Technolgoy, Dalian, China;School of Computer Science, Dalian University of Technolgoy, Dalian, China

  • Venue:
  • LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and simulation and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part III
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Sparse signal representation proposes a novel insight to solve face recognition problem. Based on the sparse assumption that a new object can be sparsely represented by other objects, we propose a simple yet efficient direct sparse nearest feature classifier to deal with the problem of automatically real-time face recognition. Firstly, we present a new method, which calculates an approximate sparse code to alleviate the extrapolation and interpolation inaccuracy in nearest feature classifier. Secondly, a sparse score normalization method is developed to normalize the calculated scores and to achieve a high receiver operator characteristic (ROC) curve. Experiments on FRGC and PIE face databases show that our method can get comparable results against sparse representation-based classification on both recognition rate and ROC curve.