DocumentCode :
2548076
Title :
Face recognition based on graph kernels
Author :
Qiang-rong, Jiang ; Yuan, Gao
Author_Institution :
Coll. of Comput. Sci. & Technol., BJUT, Beijing, China
fYear :
2010
fDate :
16-18 April 2010
Firstpage :
226
Lastpage :
230
Abstract :
The problem of face recognition was considered the most popular topic in artificial intelligence and computer vision. In this paper, we investigate face recognition based on graph kernels. We define the concept of max spanning tree, six graph kernels and a complicated kernel based on graph kernel and gray kernel. The result of our experiment shows that our spanning-tree kernels have significantly higher classification accuracy than walk-based kernels.
Keywords :
face recognition; image classification; trees (mathematics); artificial intelligence; classification accuracy; computer vision; face recognition; graph kernels; gray kernel; max spanning tree; spanning-tree kernels; walk-based kernels; Artificial intelligence; Artificial neural networks; Construction industry; Electronic mail; Engineering management; Face recognition; Kernel; Subcontracting; Supply chain management; Supply chains; MST; Maximum spanning-tree; face recognition; graph kernel; histogram intersection kernel;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Management and Engineering (ICIME), 2010 The 2nd IEEE International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-5263-7
Electronic_ISBN :
978-1-4244-5265-1
Type :
conf
DOI :
10.1109/ICIME.2010.5477816
Filename :
5477816
Link To Document :
بازگشت