International Journal of Soft Computing and Engineering (IJSCE)

ISSN: 2231-2307, olume-2, I!!ue-", No#em$er 2012

1%1


Abstract Face Recognition concept is one of the successful
and important applications of image analysis. Its a holistic
approach towards the technology and have potential applications
in various areas such as Biometrics, Information society, aw
enforcement and !urveillance, !mart cards, Access control etc.
"his paper provides an overview of real time application of Face
Recognition concept by generating a matlab code using image
ac#uisition tool bo$. "he basic approach used is %rincipal
&omponent Analysis using 'igen faces, populari(ed by the
seminal wor) of "ur) and %entland.

Inde$ "erms 'igen faces, 'igenvectors, Face recognition,
%rincipal component analysis *%&A+.
I. INTRODUCTION
A facial recognition system is a computer application for
automatically identifying or verifying a person from a digital
image or a video frame from a video source. One of the ways
to do this is y comparing selected facial features from the
image and a facial dataase. The human face plays a ma!or
role in conveying identity and emotion. It is typically used in
security systems and can e compared to other iometrics
such as fingerprint or eye iris recognition systems. A notale
advantage of facial recognition over other iometric
recognition methods is that it is less cumersome for end
users.
This paper approaches to real time application of face
recognition theory and is formulated ased on still or video
images captured either y digital camera or y a wecam.
The faces considered here for comparison are still faces.
"ere we have developed a #atla code initiali$ing the
wecam of a laptop% capturing the image and comparing it
with the dataase of images present in the laptop.
II. TRADITIONA& T'C"NI(U')
Recognition algorithm can e divided into two main
traditional approaches%
A. ,eometric approach
This is the historical way to recogni$e people. *eometric
features may e generated y segments% perimeters and areas
of some figures formed y the points. The featured set is
studied to compare the recognition result. Distances in the
feature space from a template image to every image in the
dataase were calculated. +ollowing to the +'R'T protocol%
, nearest face images were derived and if there were photos
of the -uery person then the result was considered positive.
'ach image was tested as a -uery and compared with others.
The approach was roust% ut it main prolem is automatic
point location. )ome prolem arises if image is of ad -uality
or several points are covered y hair.


&anu!'ript re'ei#ed on No#em$er, 2012
(andla )rora, 'lectronics and Communication department% #ahamaya
Technical University% Agra% India.

+ig... some facial points and distances etween them are
used in face recognition.
B. %hotometric approach
It is a statistical approach that distills an image into values
and compares the values with templates to eliminate
variances. It relies on the input image in the presence of light
and the geometric location of different angles. The
photometric transformation is implemented on the source
image% does not ta/e into account photometric changes% i.e.
changes in the pi0el. The main restriction in this approach is
that multiple registered images of the same person is re-uired.
)ince it recogni$es the new image y chec/ing that it is
spanned in a linear suspace of the multiple gallery images% it
cannot handle the new images of a different person which is
not included in the gallery set.


+ig.1. '0ample of facial images under different lightning
conditions.
III. 2O2U&AR T'C"NI(U')
According to the new technical era% some advancement has
ta/en place and some techni-ues of facial recognition have
achieved popularity. )ome of the popular face recognition
algorithms are as follows%
Real Time Application of +ace Recognition
Concept
(andla )rora

*eal +ime )ppli'ation of ,a'e *e'ognition Con'ept
1%2
A. %rincipal &omponent Analysis *%&A+ using
'igenfaces.
2CA is the simplest of the true eigenvector ased
multivariate analysis. #athematically% it is an orthogonal
linear transformation that transforms the data to a new
coordinate system. The use of 'igenfaces is commonly called
as 2rincipal Component Analysis. 3ith 2CA% the image must
e used of same si$e and they are normali$ed to line4up the
eyes and mouth of the su!ects within the image. Using 2CA%
dimension of data using data compression asics is reduced
and precisely decompose the face structure into orthogonal
and uncorrelated components /now as 'igenfaces. The face
image can e represented as a weighted sum or feature vector
of the 'igenfaces which can e stored in a .4D array.


+ig.5. )tandard 'igenfaces
B. inear -iscriminant Analysis
&DA is one of the most popular linear pro!ection
techni-ues for feature e0traction. It finds the set of the most
Discriminant pro!ection vectors which can map
high4dimensional samples onto a low4dimensional space.
Using the set of pro!ection vectors determined y &DA as the
pro!ection a0es% all pro!ected samples will form the
ma0imum etween4class scatter and the minimum
within4class scatter simultaneously in the pro!ective feature
space. In +igure 6% where each loc/ represents a class% there
are large variances etween classes% ut little variance within
classes.

+ig.6. '0amples of four classes using &DA.
&. 'lastic Bunch ,raph .atching using the Fisherface
Algorithm
'*# as one of the dynamic lin/ architectures uses not
only face4shape ut also the gray information of image% and
the +isherface algorithm as a class4specific method is roust
aout variations such as lighting direction and facial
e0pression. In the proposed face recognition adopting the
aove two methods% the linear pro!ection per node of an
image graph reduces the dimensionality of laelled graph
vector and provides a feature space to e used effectively for
the classification. In comparison with the conventional
method% the proposed approach could otain satisfactory
results from the perspectives of recognition rates and speeds.
It relies on the concept that real face images have many
non4linear characteristics such as variations in illumination%
pose and e0pression. It uses the *aor wavelet transform.
+igure ,% the *aor !et forms a node on the elastic grid which
descries the ehaviour of the image around a given pi0el. To
detect the shapes and to e0tract the features of the image% the
*aor filter is convolved with the given image.


+ig.,% 'lastic 7unch #ap *raphing.
-. "he /idden .ar)ov model
In "##4ased face recognition system% in which a
scanning strategy is employed to simulate a human4li/e
saccadic se-uence% computed on the asis of the concept of
saliency. The approach converts a face image into an
attention ased 8scanpath%9 that is% a se-uence composed of
two types of information: 3here information% the coordinates
of the salient region in the face% and 3hat information% local
features detected in there. At the core of the scanning
mechanism is the calculation of saliency. This calculation
should e cheap enough that it can e applied to the whole
image without significantly increasing time and space
re-uirements% and it should e informative. 3ith this
approach% a cheap and parallel search for salient features will
drive a serial and detailed analysis.
I;. 2RO2O)'D T'C"NI(U'
There are several techni-ues ehind face recognition% we
would e focusing on real time application of 2rincipal
Component Analysis using 'igen faces. In this method the
difference etween a given face image and a mean image is
weighted% which is otained y averaging a predefined set of
faces. The training set is a group of face images from which
the mean face is calculated. +ace recognition ta/es place y
linearly pro!ecting the image to a low dimensional image
space and weighting the difference with respect to a set of
eigenvectors. If the difference <weight= is ellow certain
threshold% the image is recogni$ed as a /nown face>
otherwise% the face can e classified as an un/nown face or
not a face at all. This is done with the help of matla code
code initiali$ing the wecam of a laptop% capturing the image
and comparing it with the dataase of images <training
images= present in the laptop. To perform face recognition%
the similarity score is calculated etween an input face image
and each of the training images. The matched face is the one
with the highest similarity% and the magnitude of the
similarity score indicates the confidence of the match <with a
unit value indicating an e0act match=. There are various steps

International Journal of Soft Computing and Engineering (IJSCE)
ISSN: 2231-2307, olume-2, I!!ue-", No#em$er 2012

1%3

in performing this face recognition% we will e discussing
step y step% however efore that we will e discussing aout
'igen faces used in this paper.
A. Brief note on 'igenfaces
'igenfaces are a set of eigenvectors used in the computer
vision prolem of human face recognition. )pecifically% the
'igenfaces are the principal components of a distriution of
faces% or e-uivalently% the eigenvectors of the covariance
matri0 of the set of face images% where an image with N 0 N
2i0els is considered a point <or vector= in N14dimensional
space. The idea of using principal components to represent
human faces was developed y )irovich and ?iry @.A
<)irovich and ?iry .BCD= and used y Tur/ and 2entland @1A
<Tur/ and 2entland .BB.= for face detection and recognition.
#athematically% it is simply finding the principal
components of the distriution of faces% or the eigenvectors
of the covariance matri0 of the set of face images% treating an
image as a point or a vector in a very high dimensional space.
The eigenvectors are ordered% each one accounting for a
different amount of the variations among the face images.
These eigenvectors can e imagined as a set of features that
together
Characteri$e the variation etween face images. 'ach
image locations contriute more or less to each eigenvector%
so that we can display the eigenvector as a sort if 8shadowy9
face which we call an eigenface.
B. Approach followed for facial recognition using
'igenfaces
The eigenfaces approach for face recognition involves the
following two operations:
.. Initiali$ation process:
The steps involve in initiali$ation process are
Ac-uire a set of training images.
Calculate the 'igenfaces from the training set% /eeping
only the est M images with the highest eigenvalues.
These M images define the 8face space9. As new faces
are e0perienced% the 'igenfaces can e updated.
Calculate the corresponding distriution in
M4dimensional weight space for each /nown individual
<training image=% y pro!ecting their face images onto the
face.

1. Recognition process:
"aving initiali$ed the system% ne0t process involves is
recognition process and the steps involves in this process are%
*iven an image to e recogni$ed% calculate a set of
weights of the M 'igenfaces y pro!ecting the it onto
each of the 'igenfaces.
Determine if the image is a face at all y chec/ing to see
if the image is sufficiently close to the face space.
If it is a face% classify the weight pattern as either a
/nown person or as un/nown.
<Optional= Update the 'igenfaces andEor weight patterns.
<Optional= Calculate the characteristic weight pattern of
the new face image% and incorporate into the /nown
faces.

;. A22&ICATION O+ 2CA IN +ACIA& R'CO*NITION
Assume a face image I<0%y= e a two4dimensional # y N
array of intensity values% or a vector of dimension #0N. +or
simplicity the face images are assumed to e of si$e N0N
resulting in a point in N1 dimensional space. An ensemle of
images% then% maps to a collection of points in this huge
space.
The steps involved are as follows%
.. Otain a set with # face images% in our e0ample #F5.
'ach image is transformed into a vector of si$e N and
placed into the set.



+ig.G. The training images set for the analysis

1. Otain the mean image -%




+ig.D. The mean image of the training set

5. +ind the difference . etween the input image and the
mean image

6. #a/e a set of # orthonormal vectors% u
n,
which est
descries the distriution of the data. The /th vector% u
n
%
is chosen such that

Is a ma0imum% su!ect to


"ere% u
/
and 0
/
are the eigenvectors and eigenvalues of
the covariance matri0 C
,. The covariance matri0 C is otained in the following
way


G. A
T



*eal +ime )ppli'ation of ,a'e *e'ognition Con'ept
1%1

D. Once we have found the eigenvectors% #
l
% u
l






+ig.C. 'igenfaces of the corresponding training images set
;I. R'CO*NITION 2ROC'DUR'
The recognition procedure involves the following steps
which are as follows%
.. A new face is transformed into its 'igenface
components. 3e compare our input image with our
mean image and multiply their difference with each
eigenvector of the & matri0. 'ach value would represent
a weight and would e saved on a vector H.


1. Now we determine which face class provides the est
description for the input image. This is done y
minimi$ing the 'uclidean distance

5. The input face is considered to elong to a class if 2
)
is
elow an estalished threshold 3
2,
i.e. 2
) <
3
2
Then the
face image is considered to e a /nown face.
6. If the difference is aove the given threshold% ut ellow
a second threshold% the image can e determined as a
un/nown face.
,. If the input image is aove these two thresholds% the
image is determined NOT to e a face.
;II. I#2&'#'NTATION IN #AT&A7
The aove discussed methods have een implemented in
#atla. The algorithm which we have generated and
implemented in face recognition procedure involves
following steps which are as follows%
A. .atlab code
I code to open the wecam of laptop and to capture image
Clear all
Close all
clc
uttonFinput<Jwould you li/e to open the cameraK<y L
n=MJ%JsJ=>
if strcmp<utton%JyJ=
disp<utton=
vidFvideoinput<JwinvideoJ%.%JNUN1O51P016PJ=>
I code to convert image to R*7 format
set<vid%JReturnedColor)paceJ%JrgJ=>
preview<vid=
start<vid=>
imFgetdata<vid%.=>
figure%imshow<im=
imwrite<im%JC:LUsersL/andlaLDes/topL2ro!ectL..!pgJ=>
I numer of images on your training set.
#F5>
IChosen std and mean.
umF.PP>
ustdFCP>
Iread and show images <!pg=>
)F@A>
figure<.=>
for iF.:#
strFstrcat<JC:LUsersL/andlaLDes/topL2ro!ectLJ%int1str<i=%J.!pgJ=>
eval<JimgFimread<str=>J=>
suplot<ceil<s-rt<#==%ceil<s-rt<#==%i=
imshow<img=
if iFF5
title<JTraining setJ%Jfontsi$eJ%.C=
end
drawnow>
@irow icolAFsi$e<img=>
img<irow%icol= >
tempFreshape<img%irowQicol%.=>
)F@) tempA>
'nd
I"ere we change the mean and std of all images. 3e
normali$e all images.
for iF.:si$e<)%1=
tempFdoule<)<:%i==>
mFmean<temp=>
stFstd<temp=>
)<:%i=F<temp4m=QustdEstRum>
'nd
Ishow normali$ed images
figure<1=>
for iF.:#
strFstrcat<JC:LUsersL/andlaLDes/topL2ro!ectLphotoLJ%int1str<i=
%J.!pgJ=>
imgFreshape<)<:%i=%icol%irow=>
imgFimgJ>
eval<Jimwrite<img%str=J=>
suplot<ceil<s-rt<#==%ceil<s-rt<#==%i=
imshow<img=
drawnow>
if iFF5
title<JNormali$ed Training )etJ%Jfontsi$eJ%.C=
end
end
Imean image>
mFmean<)%1=>
Iotains the mean of each row instead of each column
tmimgFuintC<m=>
imgFreshape<tmimg%icol%irow=>
imgFimgJ>
figure<5=>
imshow<img=>
title<J#ean ImageJ%Jfontsi$eJ%.C=
I Change image for manipulation
d0F@A>
for iF.:#
tempFdoule<)<:%i==>
d0F@d0 tempA>
end
ICovariance matri0 CFAJA% &FAAJ
AFd0J>
&FAQAJ>

International Journal of Soft Computing and Engineering (IJSCE)
ISSN: 2231-2307, olume-2, I!!ue-", No#em$er 2012

1%"

I vv are the eigenvector for &
I dd are the eigenvalue for oth &Fd0JQd0 and
CFd0Qd0J>
@vv ddAFeig<&=>
I )ort and eliminate those whose eigenvalue is $ero
vF@A>
dF@A>
for iF.:si$e<vv%1=
if<dd<i%i=S.e46=
vF@v vv<:%i=A>
dF@d dd<i%i=A>
end
end
Isort% will return an ascending se-uence
@7 inde0AFsort<d=>
indF$eros<si$e<inde0==>
dtempF$eros<si$e<inde0==>
vtempF$eros<si$e<v==>
lenFlength<inde0=>
for iF.:len
dtemp<i=F7<lenR.4i=>
ind<i=FlenR.4inde0<i=>
vtemp<:%ind<i==Fv<:%i=>
end
dFdtemp>
vFvtemp>
INormali$ation of eigenvectors
for iF.:si$e<v%1=
//Fv<:%i=>
tempFs-rt<sum<//.T1==>
v<:%i=Fv<:%i=.Etemp>
end
I'igenvectors of C matri0
uF@A>
for iF.:si$e<v%1=
tempFs-rt<d<i==>
uF@u <d0Qv<:%i==.EtempA>
end
INormali$ation of eigenvectors
for iF.:si$e<u%1=
//Fu<:%i=>
tempFs-rt<sum<//.T1==>
u<:%i=Fu<:%i=.Etemp>
end
I show eigenfaces>
figure<6=>
for iF.:si$e<u%1=
imgFreshape<u<:%i=%icol%irow=>
imgFimgJ>
imgFhiste-<img%1,,=>
suplot<ceil<s-rt<#==%ceil<s-rt<#==%i=
imshow<img=
drawnow>
if iFF5
title<J'igenfacesJ%Jfontsi$eJ%.C=
end
end
I +ind the weight of each face in the training set.
omega F @A>
for hF.:si$e<d0%1=
33F@A>
for iF.:si$e<u%1=
t F u<:%i=J>
3eightOfImage F dot<t%d0<:%h=J=>
33 F @33> 3eightOfImageA>
end
omega F @omega 33A>
end
I Note: the input image must have a mp or !pg e0tension.
I code to read input image that have een captured y the
I wecam as discussed aove
InputImageF
imread<strcat<JC:LUsersL/andlaLDes/topL2ro!ectLphotoL..!pgJ=
=>
figure<,=
suplot<.%1%.=
imshow<InputImage=>
colormap<JgrayJ=>title<JInput imageJ%Jfontsi$eJ%.C=
InImageFreshape<doule<InputImage=J%irowQicol%.=>
tempFInImage>
meFmean<temp=>
stFstd<temp=>
tempF<temp4me=QustdEstRum>
NormImage F temp>
Difference F temp4m>
NormImage F Difference>
p F @A>
aaFsi$e<u%1=>
for i F .:aa
pare F dot<NormImage%u<:%i==>
p F @p> pareA>
end
ReshapedImage F m R u<:%.:aa=Qp>
Im is the mean image% u is the eigenvector
ReshapedImage F reshape<ReshapedImage%icol%irow=>
ReshapedImage F ReshapedImageJ>
Ishow the reconstructed image. KKKKKKK
suplot<.%1%1=
imagesc<ReshapedImage=> colormap<JgrayJ=>
title<JReconstructed imageJ%Jfontsi$eJ%.C=
InIm3eight F @A>
for iF.:si$e<u%1=
t F u<:%i=J>
3eightOfInputImage F dot<t%DifferenceJ=>
InIm3eight F @InIm3eight> 3eightOfInputImageA>
end
ll F .:#>
figure<G=>
suplot<.%1%.=
stem<ll%InIm3eight=
title<J3eight of Input +aceJ%Jfontsi$eJ%.6=
I +ind 'uclidean distance KK'uclideanKK
eF@A>
for iF.:si$e<omega%1=
- F omega<:%i=>
Diff3eight F InIm3eight4->
mag F norm<Diff3eight=>
e F @e magA>
end
// F .:si$e<e%1=>
suplot<.%1%1=
stem<//%e=
title<J'ucledian distance of input imageJ%Jfontsi$eJ%.6=
#a0imum;alueFma0<e=>
#inimum;alueFmin<e=>
avgFmean<e=>
display<@JaverageFJ%num1str<avg=A=>
if <avgUCPPPP=
display<J u succeededJ=>
else

*eal +ime )ppli'ation of ,a'e *e'ognition Con'ept
1%4
display<J face authentication failedJ=>
end
elseif strcmp<utton%JnJ=
disp<utton=
disp<JgudyeJ=
end
;III. R')U&T
The results from the aove matla implementation are
-uite successful. 7elow mentioned a tale showing the
success and error rates of face recognition on self created
image dataase in various conditions.

CONDITION )UCC')) 'RROR
NOR#A& C5I .DI
&I*"T
;ARIATION)
G.I 5BI
)IV'
;ARIATION)
,,I 6,I
IW. &I#ITATION) O+ T"I) A22ORAC" AND
CONC&U)ION
As the result shows that the various test conducted in
different environment have certain limitations over the si$e%
light and the head orientation. 7ut as the real time application
is done this method showed very good classification of faces.
&imitation also depends on the -uality of wecam used. It
should e of high -uality and precision so that all of your
facial e0pressions can e easily read out. A noisy image or
partially occluded face causes recognition performance to
degrade. This recognition system is made for the still images
ut for the future scope more wor/ can e done on this
system.
R'+'R'NC')
@.A #.A. Tur/ and A.2. 2entland. 8Face recognition using Eigenfaces. In
2roc. of Computer ;ision and 2attern Recognition% pages ,CG4,B..
I'''% Xune .BB..
@1A #.Tur/ and A. 2entland% Y'igenfaces for RecognitionY% Journal of
Cognitive Neuroscience, #arch .BB..
@5A &.I. )mith. 8A tutorial on principal components analysis9
@6A Delac ?.% *rgic #.% *rgic ).% 8Independent Comparative Study of
CA, ICA, and !"A on t#e FE$E% "ata Set9% International Xournal of
Imaging )ystems and Technology% ;ol. .,% Issue ,% 1PPG% pp. 1,141GP.
@,A ". #oon% 2.X. 2hillips% 8Computational and erformance aspects of
CA&'ased Face $ecognition Algorit#ms9% 2erception% ;ol. 5P% 1PP.%
pp. 5P5451..
@GA #atla tutorials and learning resources
http:EEwww.mathwor/s.inEacademiaEstudentOcenterEtutorialsElaunchpa
d.html
@DA #atla image ac-uisition tool o0.
http:EEwww.mathwor/s.inEproductsEima-E