Two-phase linear reconstruction measure-based classification for face recognition

2018 ◽  
Vol 433-434 ◽  
pp. 17-36 ◽  
Author(s):  
Jianping Gou ◽  
Yong Xu ◽  
David Zhang ◽  
Qirong Mao ◽  
Lan Du ◽  
...  
2013 ◽  
Vol 423-426 ◽  
pp. 2543-2546 ◽  
Author(s):  
Hector Vargas ◽  
Aldo Martinez

The principal aim was the construction of a face recognition system in order to be implemented in the service robot Donaxi, delimited by the Who is who test which is part of the RoboCups tests set, using an evolutionary development strategy of triple iterations. A two phase hybrid algorithm was developed, the first phase aim was the face detection using the Haar classifiers for face search in an image and the second phase is based on a decision tree whereby the faces characteristics were evaluated by the comparison techniques of phase correlation and histogram comparison. The needed characteristics were identified in order to develop this work as a software engineering project which allowed the algorithm construction and implementation through an evolutionary approach and a personal development process. The evolutionary strategy allowed the prototyping development with functionality and the tracking of the final system construction. A three iterations total was realized during which the needed metrics were registered (time, defects and sizes). The final analysis of results (algorithm and methods) allowed concluding and visualizing the employment advantages of a software engineering formal technique for research and robotics projects realization when improving estimations and software production quality.


Author(s):  
Zhonghua Liu ◽  
Jiexin Pu ◽  
Yong Qiu ◽  
Moli Zhang ◽  
Xiaoli Zhang ◽  
...  

Sparse representation is a new hot technique in recent years. The two-phase test sample sparse representation method (TPTSSR) achieved an excellent performance in face recognition. In this paper, a kernel two-phase test sample sparse representation method (KTPTSSR) is proposed. Firstly, the input data are mapped into an implicit high-dimensional feature space by a nonlinear mapping function. Secondly, the data are analyzed by means of the TPTSSR method in the feature space. If an appropriate kernel function and the corresponding kernel parameter are selected, a test sample can be accurately represented as the linear combination of the training data with the same label information of the test sample. Therefore, the proposed method could have better recognition performance than TPTSSR. Experiments on the face databases demonstrate the effectiveness of our methods.


2019 ◽  
Vol 79 ◽  
pp. 106451 ◽  
Author(s):  
Jianping Gou ◽  
Jun Song ◽  
Weihua Ou ◽  
Shaoning Zeng ◽  
Yunhao Yuan ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document