Close category search window
 

A improved method of face recognition by kernel maximum margin criterion

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

2 Author(s)
Yong-zhi Li ; Nanjing Univ. of Sci. & Technol., Nanjing ; Jing-Yu Yang

A improved method of feature extraction based on kernel maximum margin criterion (KMMC) is presented for face recognition in this paper, i.e. a simple algorithm of uncorrected optimal discriminant vectors in kernel feature space is proposed for nonlinear feature extraction. The proposed method has more powerful capability to eliminate the statistical correlation between feature vectors and its mathematical formulation is simple. Experimental results on ORL face database and YALE face database show that the new method is better than KMMC and kernel principal component analysis (KPCA) in terms of recognition rate.

Published in:
Natural Computation, 2007. ICNC 2007. Third International Conference on  (Volume:1 )

Date of Conference: 24-27 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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.