Face Recognition Based on Maximum Spanning Tree Kernel and Gray Kernel

Abstract:

Face Recognition has been recognized as a major research field in pattern recognition and computer vision. This technique is widely adopted, because of its unique convenience, economy and high accuracy compared to other biological recognition techniques. An interesting and important challenge is thus to investigate high-efficient recognition algorithm. The introduction of kernel methods in pattern recognition has been received significant attentions in the recent several years, and gray kernel and graph kernel are two popular approaches. The paper proposes maximum spanning tree kernel and region histogram intersection kernel; moreover, experiments demonstrate that higher face recognition accuracy can be achieved by multiple kernels which are the combination of them.

• Periodical: Applied Mechanics and Materials (Volumes 513-517)
• Pages: 1387-1391
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.513-517.1387
• Online since: February 2014
• Authors: Qiang Rong Jiang*, Zhe Wu
• Keywords: Face Recognition, Graph Kernel, Gray Kernel, Multiple Kernels

References

[1] Scholkopf, B., Smola, A, Learning with Kernels. MIT Press (2002).

[2] Shawe-Taylor, J., Cristianini, N, Kernel Methods for Pattern Analysis. Cambridge University Press (2004).

[3] A. Airola, S. Pyysalo, J. Bj¨orne, T. Pahikkala, F. Ginter, and T. Salakoski. A graph kernel for protein-protein interaction extraction. In Proceedings of the Workshop on Current Trends in Biomedical Natural Language Processing, p.1–9 (2008).

DOI: 10.3115/1572306.1572308

[4] H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In Proceedings of the 20th International Conference on Machine Learning (ICML), Washington, DC, United states (2003).

[5] Karsten M. Borgwardt and Hans-Peter Kriegel. Shortest-path kernels on graphs. In Proceedings of the Fifth IEEE International Conference on Data Mining (ICDM'05) (2005).

DOI: 10.1109/icdm.2005.132

[6] T. Gärtner, J. Ramon, Expressivity versus efficiency of graph kernels. Technical report, First International Workshop on Mining Graphs, Trees and Sequences (held with ECML/PKDD'03) (2003).

[7] Jiang Qiang-rong, Gao Yuan. Spanning-tree Kernels on graphs. IEEE International Conference on Measuring Technology and Mechatronics Automation. Vol. 3, pp.422-426 (2010).

DOI: 10.1109/icmtma.2010.69

[8] Jiang Qiang-rong, Gao Yuan. Face Recognition Based on Detail Histogram Intersection Kernel. IEEE International Conference on Intelligent Computing and Intelligent Systems. Vol. 4, pp.71-74 (2009).

DOI: 10.1109/icicisys.2009.5357743

[9] M. Nilsson, J. Nordberg and I. Claesson. Face Detection using Local SMQT Features and Split up Snow Classifier. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP). Vol. 2, pp.589-592 (2007).

DOI: 10.1109/icassp.2007.366304

[10] M. Everingham, J. Sivic and A, Ziseerman. Automatic Naming of Characters in TV Video. Proceedings of the 17th British Machine Vision Conference (BMVC'06)(2006).

DOI: 10.5244/c.20.92

[11] D. Haussler. Convolutional kernels on discrete structures. Technical Report UCSC-CRL-99 - 10, Computer Science Department, UC Santa Cruz (1999).

[12] Rakotomamonjy A, Bach F R, Canu S, Grandvalet Y. Simple MKL. The Journal of Machine Learning Research, 2008, 9(11): 2491-2521.