• PDF / 1,898,526 Bytes
• 23 Pages / 439.37 x 666.142 pts Page_size
• 68 Downloads / 233 Views

DOWNLOAD

REPORT

---

Fast single sample face recognition based on sparse representation classification Meng-Jun Ye 1 & Chang-Hui Hu 2

1

& Li-Guang Wan & Gai-Hui Lei

1

Received: 31 March 2020 / Revised: 26 August 2020 / Accepted: 9 September 2020 # Springer Science+Business Media, LLC, part of Springer Nature 2020

Abstract

The extended sparse representation classification (ESRC) is one of the benchmark classification algorithms in the field of single sample face recognition (SSFR). However, when there are many single training samples, the execution time of ESRC cannot be acceptable in real face recognition systems. We assume the similarity principle of sparse representation under valid SSFR as that, if the test image is more similar to certain single training sample, the corresponding sparse coefficient of this single training sample may be larger, and the representation residual of this single training sample may be smaller. Based on this assumption, we propose the fast ESRC method to tackle many single training samples problem. Firstly, we propose the positive sparse coefficient based ESRC (PESRC) that selects to compute representation residuals of single training samples whose sparse coefficients of ESRC are positive. Then, we propose the statistical analysis of the sparse coefficient ratio, which is used to develop the large positive sparse coefficient based ESRC (LESRC) that calculates representation residuals of the single training samples corresponding to large positive sparse coefficients of PESRC. Finally, the experiment results on Extended Yale B, AR, CMU PIE and VGGFace2 face databases indicate that the proposed PESRC and LESRC can significantly improve the computation efficiency of ESRC. On our platform, the execution time of recognizing only one test image for ESRC or VGG + ESRC is over 130 s (the execution time of ESRC and VGG + ESRC are 562.71 s and 135.02 s) under 9125 single training samples, whereas the execution times of PESRC, LESRC, VGG + PESRC, and VGG + LESRC are 2.20s, 0.23 s, 0.71 s, and 0.03 s respectively. Keywords Single sample face recognition . ESRC . Positive sparse coefficient based ESRC . Large positive sparse coefficient based ESRC

* Chang-Hui Hu [email protected]

1

College of Mechatronics Control Engineering, Hubei Normal University, Huangshi 435002, China

2

College of Automation & College of Artificial Intelligence, Nanjing University of Posts and Telecommunications, Nanjing 210023, China

Multimedia Tools and Applications

1 Introduction Face recognition has been a hot research topic for decades [19]. Single sample face recognition (SSFR) is an arduous task in the field of face recognition [12]. The kernel of the SSFR problem is the lack of intra-class variation information for single sample per class, which can be formulated by the prior knowledge or the generic images. Accordingly, the SSFR approach can be roughly divided into two categories: the prior knowledge based approach, and the generic images based approach. As the literature of SSFR is wide and various, some significant works ar