Cart (Loading....) | Create Account
Close category search window

Constructing Support Vector Machine Kernels from Orthogonal Polynomials for Face and Speaker Verification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Feng Zhou ; Zhejiang Univ., Hangzhou ; Zhigang Fang ; Jie Xu

This paper presents an alternative to construct support vector machine (SVM) kernels from orthogonal polynomials. After describing some knowledge about orthogonal polynomials, we construct kernels from orthogonal polynomials according to Mercer's condition. The elegant and fascinating characteristics of the orthogonal polynomials promise the minimum data redundancy in feature space and make it possible to represent the data with less support vectors. Experimental results show that the SVMs with orthogonal polynomial kernels outperform that with traditional kernels in terms of generalization power and less support vectors.

Published in:

Image and Graphics, 2007. ICIG 2007. Fourth International Conference on

Date of Conference:

22-24 Aug. 2007

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.