Abstract
Eigenface or Principal Component Analysis (PCA) methods have demonstrated their success in face recognition, detection, and tracking. The representation in PCA is based on the second order statistics of the image set, and does not address higher order statistical dependencies such as the relationships among three or more pixels. Recently Higher Order Statistics (HOS) have been used as a more informative low dimensional representation than PCA for face and vehicle detection. In this paper we investigate a generalization of PCA, Kernel Principal Component Analysis (Kernel PCA), for learning low dimensional representations in the context of face recognition. In contrast to HOS, Kernel PCA computes the higher order statistics without the combinatorial explosion of time and memory complexity. While PCA aims to find a second order correlation of patterns, Kernel PCA provides a replacement which takes into account higher order correlations. We compare the recognition results using kernel methods with Eigenface methods on two benchmarks. Empirical results show that Kernel PCA outperforms the Eigenface method in face recognition.
Original language | English |
---|---|
Pages | 37-40 |
Number of pages | 4 |
Publication status | Published - 2000 |
Event | International Conference on Image Processing (ICIP 2000) - Vancouver, BC, Canada Duration: 2000 Sept 10 → 2000 Sept 13 |
Other
Other | International Conference on Image Processing (ICIP 2000) |
---|---|
Country/Territory | Canada |
City | Vancouver, BC |
Period | 00/9/10 → 00/9/13 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering