m Introduction

m Face recognition Problem

m Face detection method
9 PCA
9 FLD
9 Face detection step
9 PCA vs LDA
m ñ periment and result
m Conclusion
m Future work
m Face recognition has recently received
significant attention, especially during
the past several years
m Face recognition is one method of
identity authentication on biometrics
study.
m Face recognition has several
characteristics that are advantageous
for consumer
m Wide range of applications
m ©hese methods are most widely used
and have relative simple processing
steps that could be advantageous when
it is applied to embedded systems
m ©he challenges of face recognition are
the rapid and accurate identification or
classification of a query image.
m Rapid can be associated to speed, and
accuracy actually refers to recognition
rate.
m Principle Component Analysis (PCA)
m Linear Discriminant Analysis (LDA)
m PCA
= ©he Hotelling
= ñigenspace Projection
= Karhunen and Leove (KL) transform
m ñigenfaces technique : implementation
of the PCA method in face recognition
m PCA has become one of the most
successful approaches in face
recognition
m It was presented by ©urk and Pentland in
1991
m ©hey projecting Face images onto a face
space defined by the ¶eigenfaces· and the
eigenvectors of the set of faces not
necessary corresponded to isolated
features (eyes, ears, and noses).
m ©hey use PCA for dimensionality reduction in
order to find the best account of vectors for
the distribution of face images within the
entire image space
m ëensitive to illumination and e pression,
m Difficult to evaluate the covariance
matri accurately.
m Could not capture even the simplest
invariance unless this information is
e plicitly provided in the training data.
m LDA or Fisher·s Linear Discriminant (FLD) is a
dimensionality reduction technique which is
used for classification problems.

m ©his approach tries to find the projection

direction in which, images belonging to
different classes are separated ma imally
m ©he within-class scatter matri (intra-
personal), represents variations in
appearance of the same individual due to
different lighting and face e pression.

m ©he between-class scatter matri (e tra-

personal), represents variations in
appearance due to a difference in identity
m ©raining Phase
9 ©he image samples are taken as grayscale images.
9 ©ransformed from 2D matri to 1D column vector
9 Centered the vector of data matri X with subtracting by
the mean vector
9 Compute the covariance matri of the column vectors
9 Compute the eigenvalues and corresponding
eigenvectors
9 Projecting the data matri X onto the eigenspace,
m Recognize Phase
9 Convert the image 6 that will be recognized into 1D vector,
and subtracting by mean.
9 Projecting on to same eigenspace.
9 Compute the ñuclidean distance
9 Choose the minimum ñuclidean distance value
 ?


optimal discrimination
 © ©  ©  



 



’
 ©   ’  ©  

Covariance


  ( è )( è  è )©
computation
1  [


©
 (  è )(  è )©


1  
 [ (è è )( è è )©

1

ë
ëë
©he eigenvectors

 ë 
 ë
ë
calculation
m ñach algorithm has been generated
using Matlab.
m ëample training and test databases are
parts of 'face94' ñsse face database
9 10 faces image,
9 each face image has three different
variations
9 the total number is 30 sample images.
9 RGB
9 180 200 pi els.
m ñ periment was conducted for five times.
9 Ê
 : used 5 images in both test and training
database.
9 ë
 : used 10 images in both test and
training database.
9 ©
 : used 10 images in test database and 20
images in training database.
9 Ê
 : used 20 images in test database and 10
images in training database.
9 Ê  : used both 20 images in test and training
databases
m
m ©he speed or time taken measures the
process of covariance computation until
the minimum ñuclidian distance yielded.

m While the recognition rate shows the

accuracy of the methods.
  
 
  

d
   
    
     
     
1.2

0.8

0.6
pca
0.4
fld
0.2

0
5 10 20 10 20

5 10 20
  
 
  

d
   
    
     
     
0.4
0.35
0.3
0.25
0.2
0.15 pca

0.1 fld

0.05
0
5 10 20 10 20

5 10 20
m A comparative performance analysis of PCA and
LDA was conducted on face recognition using
different number of training and test images in five
e periments
m Performance evaluations cover the speed and
recognition rate for both methods.
m ©he results of the e periments show that PCA is
better than LDA in recognition rate.
m In term of speed, PCA tend to be much better then
LDA for few sample of images.
m However, for the larger number of sample use LDA
outperforms to PCA
m ©he future works can be conducted by
combining PCA and LDA.
m ©he idea of applying PCA and LDA is
based on the fact that combined both
methods may compensate for the
drawbacks of each other
m ©hank You.