Abstract

Currently, sparse representation was widely used in face recognition. However, traditional sparse representation method cannot effectively consider the effect of different weight of training samples When reconstruct the test samples. In this paper, a weighted sparse neighbor representation based on Gaussian kernel function model is presented to resolve above problems. Firstly, K nearest training samples is selected for constructing a new training dictionary according to the Euclidean distances between the test samples and training samples. Then, a weight is given to each sparse coefficient of new training sample. Above sparse coefficient is solved by norm L1 minimization method. Finally, recognition task is performed by the minimum reconstruction error of sparse coefficient. Experimental results illustrate that, the proposed algorithm achieves 96.64% correct recognition rate, which is significantly higher than the various existing comparison methods.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.