کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
849441 | 909265 | 2014 | 7 صفحه PDF | دانلود رایگان |
With the rapid development of the face recognition technology, more and more optical products are applied in people's real life. The recognition accuracy can be improved by increasing the number of training samples, but the colossal training samples will result in the increase of computational complexity. In recent years, sparse representation method becomes a research hot spot on face recognition. In this paper we propose an energy constrain orthogonal matching pursuit (ECOMP) algorithm for sparse representation to select the few training samples and a hierarchical structure for face recognition. We filter the training samples with ECOMP algorithm and then we compute the weights by all selected training samples. At last we find the closest recovery sample to the test sample. Simultaneously the experimental results in AR, ORL and FERET database also show that our proposed method has better recognition performance than the LRC and SRC_OMP method.
Journal: Optik - International Journal for Light and Electron Optics - Volume 125, Issue 17, September 2014, Pages 4729–4735