p





   

 


‡ In the 1960s,scientistsbegan work on using the
computerto recognize human faces
‡ Facial recogtnition software is basedon the
ability torecognizea faceand then measure the
variousfeatures of the face
‡ Every face has numerous,distinguishable
landmarks,thedifferent peaksand valleys.
 4
 


‡ Its measures distance between the eyes

‡ Width of the nose
‡ Depth of the eye socket
‡ The shape of the cheek bone
‡ The length of the jaw line
These creates numerical code,called a faceprint
,represting the facein the database.
p

 
 Ä 4

‡   
‡


   
pp
 
‡  Ä p
   Ä 


p

 
4


  
 
 

 
 

 






 p
   Ä 
 p

‡ Facial parameters are independent of illumination problem caused by various

lighting conditions
‡ First the center of the pupil is located for both the eyes.
‡ When the located points are joined, a horizontal line is being
formed then the tip of the nose is located and length of nose is
represented by vertical line
This forms a ¶T· Shape and we calculate d1 and d2 and
finally the ratio d1/d2.
‡ This forms a rotated ¶T· structure.
d1=¥((x2--x1)²+(y2-
d1=¥((x2 x1)²+(y2-y1)²)
d2=¥((x3--x4)²+(y3-
d2=¥((x3 x4)²+(y3-y4)²)
where x1 y1 and x2 y2 are the coordinates of pupil of both
the eyes,also x3y3 and x4y4 are the coordinates of centre
of the pupils of both the eyes and tip of the nose respectively.
 





‡ Each face image is a random vector
‡ Each component in this vector is a pixel
‡ The most correlated components best
describe the faces distribution
Find the components that describe the
highest variance
 







‡ 
 


(PCA),



(PCA), or 




 

 
,
, is a data-
data-reduction method that finds an
alternative set of parameters for a set of raw data (or features)
such that most of the variability in the data is compressed down
to the first few parameters
ü The transformed PCA parameters are orthogonal
ü The PCA diagonalizes the covariance
matrix, and the resulting diagonal elements are
the variances of the transformed PCA parameters
 

‡ A   defines a point in the high-
 defines high-dimensional
image space
‡ Different face images share a number of
similarities
with each other
‡ They can be described by a relatively
low--dimensional subspace
low
‡ They can be projected into an appropriately
chosen subspace of  
 and
classification can be performed by similarity
computation (distance)
  
 
 


 

‡ Developed in 1991 by M.Turk

‡ Based on PCA
‡ Relatively simple
‡ Fast
&
‡ Robust
  

‡ PCA seeks directions that are efficient for
representing the data
‡ PCA reduces the dimension of the data
‡ Speeds up the computational time

V
 V


V
 V

  

 
 
‡ Original Images

X
X X






Ñ 

Ñ  

Ñ
 ùù

Ä
Ä
Ä








aÑ   aÑ   aÑ 
  

 
 
‡ The mean face can be Mean--Face
Mean
computed as:

X
ü ü` ü




Ñ ü Ñ ü` ü Ñ 

  


 Ä Ä Ä 




aÑ ü aÑ ü` ü aÑ 
  

 
 
‡ Then subtract it from the training faces
X
  X   X   X  






Ñ
 Ñ 
Ñ   Ñ 
Ñ   Ñ 
Ñ   Ñ 







Ä Ä  

Ä Ä 
Ä Ä 
Ä Ä 











 aÑ   aÑ   aÑ   aÑ 

 aÑ   aÑ 

 aÑ   aÑ 

X   X   X   X  






Ñ  Ñ 
Ñ  Ñ 
 Ñ  Ñ 

Ñ  Ñ 




Ä Ä 
Ä Ä 
Ä Ä  

Ä Ä 









 a Ñ   a Ñ   a Ñ  a Ñ    a Ñ  a Ñ   a Ñ  a Ñ 
  

 
 
‡ Now we build the matrix which is a by 

ù
          

‡ The covariance matrix which is a by a

V
  '
  

 
 
‡ Find eigenvalues of the covariance matrix
The matrix is very large
The computational effort is very big

‡ We are interested in at most   eigenvalues

And in the given problem we have taken 99 most
significant Eigen directions to represents the data.

 

  
 


@ 
 
 



‡ Global projection suppresses local
information, and it is not resilient to
face illumination condition and facial
expression variations
‡ It does not take discriminative task into
account
² ideally, we wish to compute features that
allow good discrimination
² not the same as largest variance
 p

 
 
ü Photos of faces are widely used in passports and driverv
drivervs
licenses where the possession authentication protocol is
augmented with a photo for manual inspection purposes;
there is wide public acceptance for this biometric identifier
ü Face recognition systems are the least intrusive from a
biometric sampling point of view, requiring no contact, nor
even the awareness of the subject
ü The biometric works, or at least works in theory, with legacy
photograph data-
data-bases, videotape, or other image sources
ü Face recognition can, at least in theory, be used for screening
of unwanted individuals in a crowd, in real time
ü It is a fairly good biometric identifier for small-
small-scale
verification applications
p


 


 
‡ A face needs to be well lighted by controlled light
sources in automated face authentication systems.
This is only a first challenge in a long list of
technical challenges that are associated with robust
face authentication
‡ Face currently is a poor biometric for use in a pure
identification protocol
‡ An obvious circumvention method is disguise
‡ There is some criminal association with face
identifiers since this biometric has long been used
by law enforcement agencies (A (Amugshots
mugshotsvv).




‡ In this proposed work, a wavelet analysis is used to

decompose the original image.
‡ DCT
DCT--based unique normalized face recognition is motivated
by the desire to combine the advantage of generalization
ability of Principle component analysis (PCA) and advantages
of maximizing class separation by feature image generation
‡ One of the major advantages of DCT-
DCT-based unique
normalized face recognition is the case of implementation
and unique feature image generation. Furthermore,no
knowledge of geometry or specific feature of the image is
required and only a small amount of work is needed.
 
 



 
 ?
 



   


  

  !"# "$%&&'
 *(!"# ((%#*'


!#( ' 
!#( '

 &"##!& ( $ %) '  &  !& ( $#%" '


  &!&&) %#"' 
  !&&) '

 #"%$ '  #"%" '

 
 ?
 



    

 

 

 &*!"# "$%&&'
 &"!"# *(%)*'

(

&!#( ' 
* !#( (*%)('
(
 &($!& ( $ %) '  &*&$!& ( %"'
&"$)

  &$!&&) %#"' 
  ((!&&) *#%"$'
&
  &%"$'  "%# '
 
 ã  

    
  
   & &*%)'    #  &'
  &$## &'   &$## &'
     

 $$%"'  &'

        

    # '    ( ) ( %)'
  &$## &'  & &$# $$%$'
     

 $$%$'  $$%"$'

 
 Ä
 
 

    
  
 &)"*  &'  &)"& & $$%$('
Ä

4 Ä

4

(  ' * $#%(#'

Ä

4 Ä

4

  #%*)'  $$%)$'

        

 (#* )* ##%&'  ("" "# #%(('

Ä

4 Ä

4

&** & $*%&#' * &(** #%"('

Ä

4 Ä

4

 $&%*#'  #%)"'

 
 ÷
 

    
  
  &$# & $$%$'   &$##  &'
  #  '    # &'

 $$%)'  &'

        

  &$" *# $#%)$'   &$)) (( $#%('
  & &%*#'   ) ( ( %)'

 $#%*'  $#%$'

 
 ã
  

    
  
  & & &$ $#%#$'   & *  &'
  * ) & %("'    * " &'

 #)%* '  &'

        

  &"$" * $#%"'   &"## (* $#%&('
  * & ) &%#'   "& *&) %#$'

 #)%**'  $)%('