By Topic

On optimal subspaces for appearance-based object 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
$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

6 Author(s)
Wu, Q. ; Adv. Digital Imaging Res., LLC, League City, TX, USA ; Liu, Z. ; Xiong, Z. ; Wang, Y.
more authors

On the subject of optimal subspaces for appearance-based object recognition, it is generally believed that algorithms based on LDA (linear discriminant analysis) are superior to those based on PCA (principal components analysis), provided that relatively large training data sets are available. In this paper, we show that while this is generally true for classification with the nearest-neighbor classifier, it is not always the case with a maximum-likelihood classifier. We support our claim by presenting both intuitively plausible arguments and actual results on a large data set of human chromosomes. Our conjecture is that perhaps only when the underlying object classes are linearly separable would LDA be truly superior to other known subspaces of equal dimensionality.

Published in:

Image Processing. 2002. Proceedings. 2002 International Conference on  (Volume:3 )

Date of Conference:

24-28 June 2002