Multi-class semi-supervised kernel minimum squared error for face recognition

Optik ◽  
2015 ◽  
Vol 126 (23) ◽  
pp. 3496-3500 ◽  
Author(s):  
Haitao Gan
2016 ◽  
Vol 171 ◽  
pp. 149-155 ◽  
Author(s):  
Haitao Gan ◽  
Rui Huang ◽  
Zhizeng Luo ◽  
Yingle Fan ◽  
Farong Gao

2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
Rong Wang

In real-world applications, the image of faces varies with illumination, facial expression, and poses. It seems that more training samples are able to reveal possible images of the faces. Though minimum squared error classification (MSEC) is a widely used method, its applications on face recognition usually suffer from the problem of a limited number of training samples. In this paper, we improve MSEC by using the mirror faces as virtual training samples. We obtained the mirror faces generated from original training samples and put these two kinds of samples into a new set. The face recognition experiments show that our method does obtain high accuracy performance in classification.


2015 ◽  
Vol 20 (8) ◽  
pp. 3177-3187 ◽  
Author(s):  
Changbin Shao ◽  
Xiaoning Song ◽  
Xibei Yang ◽  
Xiaojun Wu

2014 ◽  
Vol 536-537 ◽  
pp. 450-453 ◽  
Author(s):  
Jiang Jiang ◽  
Xi Chen ◽  
Hai Tao Gan

In this paper, a sparsity based model is proposed for feature selection in kernel minimum squared error (KMSE). By imposing a sparsity shrinkage term, we formulate the procedure of subset selection as an optimization problem. With the chosen small portion of training examples, the computational burden of feature extraction is largely alleviated. Experimental results conducted on several benchmark datasets indicate the effectivity and efficiency of our method.


Sign in / Sign up

Export Citation Format

Share Document