By Topic

Lower bounds estimation to KL transform in face representation and recognition

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
$33 $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)
Bai-Bo Zhang ; Dept. of Autom., Tsinghua Univ., Beijing, China ; Chang-Shui Zhang

The Karhunen-Loeve (KL) transform is a very important method in data compression and pattern recognition, which has been successfully used in face recognition. Intuitively, the more training samples are used, the better performance would be, but the computation cost increases in proportion to cubic speed. The numbers of training samples and eigenvalues required by the KL method in face representation and recognition are considered. In this paper, we attempt to find the balance points by experiments and analyses.

Published in:

Machine Learning and Cybernetics, 2002. Proceedings. 2002 International Conference on  (Volume:3 )

Date of Conference: