1 / 12

Comparing Kernel-based Learning Methods for Face Recognition

Comparing Kernel-based Learning Methods for Face Recognition. Zhiguo Li zhli@paul.rutgers.edu. Outline. Objective What is Kernel? Why Kernel? How to Kernel? Principal Component Analysis (PCA) vs. Fisher Discriminant Analysis (FDA) PCA vs. Kernel PCA (KPCA) Experiments

tam
Download Presentation

Comparing Kernel-based Learning Methods for Face Recognition

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Comparing Kernel-based Learning Methods for Face Recognition Zhiguo Li zhli@paul.rutgers.edu

  2. Outline • Objective • What is Kernel? Why Kernel? How to Kernel? • Principal Component Analysis (PCA) vs. Fisher Discriminant Analysis (FDA) • PCA vs. Kernel PCA (KPCA) • Experiments • Discussions and Conclusions

  3. Objective • I want to find out if the kernel versions of Principal Component Analysis (PCA) and Fisher Discriminant Analysis (FDA) are better than linear versions of PCA and FDA for face recognition?

  4. What is Kernel? • Kernel function: For example, polynomial kernel function: What’s special? They can compute the dot products of two feature vectors without even knowing what they are!

  5. Why Kernel? • The original face data maybe not linearly separable, so how about after nonlinear mapping? They may become linearly separable.

  6. How to Kernelize? • Any algorithm which can be expressed solely in terms of dot products, i.e. without explicitly usage of the variables themselves, the kernel method enables us to construct nonlinear versions of it.

  7. PCA vs. FDA • PCA seeks to find the projection that maximize the total scatter across all classes • FDA tries to find discriminant projection that maximize the between-class scatter and minimize the within-class scatter

  8. PCA vs. FDA

  9. Linear PCA vs. Kernel PCA • Kernel PCA: first do kernel mapping, from input space to feature space, then carry out PCA on the kernelized data.

  10. Experiments • Face Databases: public available • AT&T • FERET • Yale

  11. Experiments • AT&T FERET YALE 40 subs, 10 imgs per sub 70 subs, 6 imgs per sub 15 subs, 11 imgs per sub

  12. Discussions and Conclusions • Discussions: • The selection of kernel function lacks theoretic scheme • Instead of using NN as classifier, SVM may achieve higher recognition rate • Conclusions: • For face data, there is no big difference between Linear version methods and kernel version methods • FDA methods are better than PCA methods for face recognition

More Related