✦ LIBER ✦

Direct kernel neighborhood discriminant analysis for face recognition

✍ Scribed by Haifeng Hu; Ping Zhang; Zhengming Ma

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 329 KB
Volume: 30
Category: Article
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2009.03.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subclass linear discriminant analysis fo

Subclass linear discriminant analysis for video-based face recognition

✍ Aristodemos Pnevmatikakis; Lazaros Polymenakos 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 742 KB

Selecting discriminant eigenfaces for fa

Selecting discriminant eigenfaces for face recognition

✍ Jie Wang; K.N. Plataniotis; A.N. Venetsanopoulos 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 454 KB

Face recognition using kernel entropy co

Face recognition using kernel entropy component analysis

✍ B.H. Shekar; M. Sharmila Kumari; Leonid M. Mestetskiy; Natalia F. Dyshkant 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 638 KB

In this letter, we have reported a new face recognition algorithm based on Renyi entropy component analysis. In the proposed model, kernel-based methodology is integrated with entropy analysis to choose the best principal component vectors that are subsequently used for pattern projection to a lower

Kernel direct discriminant analysis and

Kernel direct discriminant analysis and its theoretical foundation

✍ Zhizheng Liang; Pengfei Shi 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 101 KB

Sparsity preserving discriminant analysi

Sparsity preserving discriminant analysis for single training image face recognition

✍ Lishan Qiao; Songcan Chen; Xiaoyang Tan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 349 KB

Complete neighborhood preserving embeddi

Complete neighborhood preserving embedding for face recognition

✍ Yong Wang; Yi Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 794 KB

Neighborhood preserving embedding (NPE) is a linear approximation to the locally linear embedding algorithm which can preserve the local neighborhood structure on the data manifold. However, in typical face recognition where the number of data samples is smaller than the dimension of data space, it