Efficient algorithm for sparse coding and dictionary learning with applications to face recognition

2015 ◽  
Vol 24 (2) ◽  
pp. 023009 ◽  
Author(s):  
Zhong Zhao ◽  
Guocan Feng
2016 ◽  
Vol 25 (04) ◽  
pp. 1650017 ◽  
Author(s):  
Zhengming Li

Dictionary learning (DL) algorithms have shown very good performance in face recognition. However, conventional DL algorithms exploit only the training samples to obtain the dictionary and totally neglect the test sample in the learning procedure. As a result, if DL is associated with the linear representation of test sample, DL may be able to perform better in classifying the test samples than conventional DL algorithms. In this paper, we propose a test sample oriented dictionary learning (TSODL) algorithm for face recognition. We combine the linear representation (including the [Formula: see text]-norm, [Formula: see text]-norm and [Formula: see text]-norm) of a test sample and the basic model of DL to learn a single dictionary for each test sample. Thus, it can simultaneously obtain the dictionary and representation coefficients of the test sample by minimizing only one objective function. In order to make the learning procedure more efficient, we initialize a dictionary for the new test sample by selecting from the dictionaries of previous test samples. The experimental results show that the TSODL algorithm can classify test samples more accurately than some of the state-of-the-art DL and sparse coding algorithms by using a linear classifier method on three public face databases.


Author(s):  
Dongmei Wei ◽  
Tao Chen ◽  
Shuwei Li ◽  
Dongmei Jiang ◽  
Yuefeng Zhao ◽  
...  

2021 ◽  
Vol 25 (5) ◽  
pp. 1273-1290
Author(s):  
Shuangxi Wang ◽  
Hongwei Ge ◽  
Jinlong Yang ◽  
Shuzhi Su

It is an open question to learn an over-complete dictionary from a limited number of face samples, and the inherent attributes of the samples are underutilized. Besides, the recognition performance may be adversely affected by the noise (and outliers), and the strict binary label based linear classifier is not appropriate for face recognition. To solve above problems, we propose a virtual samples based robust block-diagonal dictionary learning for face recognition. In the proposed model, the original samples and virtual samples are combined to solve the small sample size problem, and both the structure constraint and the low rank constraint are exploited to preserve the intrinsic attributes of the samples. In addition, the fidelity term can effectively reduce negative effects of noise (and outliers), and the ε-dragging is utilized to promote the performance of the linear classifier. Finally, extensive experiments are conducted in comparison with many state-of-the-art methods on benchmark face datasets, and experimental results demonstrate the efficacy of the proposed method.


2017 ◽  
Vol 53 (22) ◽  
pp. 1473-1475 ◽  
Author(s):  
Boxiang Dong ◽  
Jian‐xun Mi

Author(s):  
Ilias Theodorakopoulos ◽  
Ioannis Rigas ◽  
George Economou ◽  
Spiros Fotopoulos

Sign in / Sign up

Export Citation Format

Share Document