1 / 12

FACE IMAGE RETRIEVAL BY PROJECTION-BASED FEATURES

FACE IMAGE RETRIEVAL BY PROJECTION-BASED FEATURES. Chaur-Chin Chen, Yu-Shu Shieh, Hsueh-Ting Chu Department of Computer Science Institute of Information Systems & Applications National Tsing Hua University, Hsinchu,Taiwan 30013 E-mail: cchen@cs.nthu.edu.tw. ABSTRACT.

kalona
Download Presentation

FACE IMAGE RETRIEVAL BY PROJECTION-BASED FEATURES

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. FACE IMAGE RETRIEVAL BY PROJECTION-BASED FEATURES Chaur-Chin Chen, Yu-Shu Shieh, Hsueh-Ting Chu Department of Computer Science Institute of Information Systems & Applications National Tsing Hua University, Hsinchu,Taiwan 30013 E-mail: cchen@cs.nthu.edu.tw

  2. ABSTRACT Face and fingerprint image have been used as an access control for the entry and exit of countries such as in Japan and America. The issues storage space and computations are as important as the accuracy of verification and/or identification. This paper reviews five projection-based face recognition methods: PCA, LDA, 2DPCA, 2DLDA, and SVD. We give a mathematical review of the aforementioned methods, discuss the usage of storage space, practicality of computation. Experimental Results of Comparison on three databases: ORL, UMIST, and NTHU show that SVD, 2DPCA, 2DLDA are superior to PCA and LDA.

  3. PROJECTION-BASED METHODS • The five methods based on the following projections are reviewed and compared. • Principal Component Analysis (PCA) • Linear Discriminant Analysis (LDA) • 2D PCA • 2D LDA • Singular Value Decomposition (SVD)

  4. Table 1: Statistics on NTHU Faces

  5. Fig. 4. Retrieval Rates on ORL

  6. Fig. 5. Retrieval Rates on UMIST

  7. (SVD) Training Face Images • Let Fij be the ith face image of m by n from the jth subject, 1≦i≦Nj and 1≦j≦K, N1+N2+….+Nk=Nbe thetraining face images. Define the mean image S as

  8. Singular Value Decomposition S=UDVt • Do S=UDVt where U and V are orthogonal. • Select r,c with r≦m, c≦n such that d11+d22+…+dhh ≧ 85% of trace(D), where h=min{r,c} • Let Ur =[u1,u2,...,ur], Vc =[v1,v2,…,vc] • Where U is an m by m orthogonal matrix • V is an n by n orthogonal matrix

  9. Convert a face image into features • For each training image Ak, we represent this Ak as xk =(Ur)tAVc , an r by c feature image • For each test image T, we represent T by y=(Ur)tTVc , an r by c feature image

  10. Distance between training feature images and a test feature image • Compute d(y,xk) by Fröbenius norm • The smaller Fröbenius norm, the closer • Rank the norms in an ascending order • Determine the recognition rates from ranks 1, 2, 3, ...,8 and plot the curve

  11. Part of 5*40 Training Faces (ORL)

  12. Missed Face Images and Their Wrongly-Best Matched Images

More Related