Professional Documents
Culture Documents
A Project Report on
FACE RECOGNITION SYSTEM
Submi ed by :
Rishabh Lal (200107066)
Adarsh Kumar (200107004)
Ashutosh Kumar (200107011)
ACKNOWLEDGMENT
We are grateful to the Almighty for gran ng us the for tude and
persistence to finish the main project. The ini a ve itself serves as a thank you
to everyone who has donated their hear elt co-opera on in making this
project a grand success.
We are greatly indebted to project guide Mr. Mihir Purkait,Professor and Mr.
Anweshan, Research Scholar, Chemical Engineering, for providing valuable
guidance at every stage of the project work.We are profoundly grateful towards
the unmatched services rendered by him.
Finally, but certainly not least, we would like to express our sincere gra tude
and apprecia on to our beloved parents for their spiritual support and genuine
assistance in carrying out the primary project.
IIT GUWAHATI
ABSTRACT
There are two different types of approaches that have been created for
facial recogni on pa erns, the Eigenface method and Fisherface method.
Image recogni on of face : The Eigenface approach is based on the Principal
Component Analysis (PCA) of facial data to reduce the face-dimensional space.
Facial space (face recogni on u lizing Eigen faces) was created for the primary
usage of PCA by iden fying the facial image's eigenvector that corresponds to
its biggest eigenvalue. the region of image processing is being used in this
project's face detec on and face recogni on systems.
IIT GUWAHATI
INDEX
1. INTRODUCTION……………………………………………………………………………..4
1.1 FACE RECOGNITION......................................................................4
1.2 FACE DETECTION..........................................................................6
2. FACE DETECTION METHODS.............................................................8
2.1 FEATURE BASED APPROACH........................................................9
2.1.1 SNAKES...............................................................................9
2.1.2 DEFORMABLE TEMPLATES.................................................10
2.2 LOW-LEVEL ANALYSIS..................................................................10
2.3 MOTION BASE.............................................................................12
2.3.1 GRAY SCLAE BASE..............................................................12
2.4 FEATURE ANALYSIS......................................................................13
2.4.1 VIOLA JONES METHOD......................................................13
3. FACE RECOGNITION……………………………………………………………………..15
3.1 FACE RECOGNITION USING GEOMETRICAL FEATURES……………..15
3.1.1 FACE RECOGNITION USING TEMPLATE MATCHING…………16
3.2 PROBLEM SCOPE AND SYSTEM SPECIFICATIONS……………………..16
3.3 DIFFICULTIES IN FACE RECOGNITION……………………………………….17
3.4 IMPROVING FACE DETECTION USING RECONSTRUCTION………..18
4. PROBLEM SOLVED USING FACE RECOGNITION SYSTEM……………….20
5. CONCLUSION……………………………………………………………………………….22
6. REFERENCE………………………………………………………………………………….23
IIT GUWAHATI
4
1. INTRODUCTION
IIT GUWAHATI
5
IIT GUWAHATI
6
Popular recogni on algorithms include:
1. Principal Component Analysis using Eigenfaces, (PCA)
2. Linear discriminant analysis,
3. Elas c Bunch Graph Matching using the Fisherface algorithm,
Therefore, the perfect face detector would be able to iden fy any face
against any background, in any ligh ng situa on. There are two steps to the
face detec on task. In the first stage, a classifica on task is used to determine
whether there are any faces in an input image. This task accepts any image as
input and outputs a binary value of yes or no. The face localiza on task, which
is the second phase, outputs the loca on of any face or faces inside an image
as a bounding box containing (x, y, width, height).
The face detec on system can be divided into the following steps:-
1. Pre-Processing: Before being sent into the network, the photos are
processed to lessen the variability in the faces. We collected all instances that
are favourable by cropping the photographs of faces. Frontal faces on page 5
should only be seen from the front. The clipped photos are then all
light-adjusted using industry-standard methods.
2. Classifica on: Neural networks are implemented to classify the images
as faces or nonfaces by training on these examples. We use both our
implementa on of the neural network and the Matlab neural network toolbox
IIT GUWAHATI
7
for this task. Different network configura ons are experimented with to
op mise the results.
3. Localiza on: When looking for faces in an image, the trained neural
network locates them within a bounding box. Several facial features that have
been studied include: Posi on Scale Orienta on Illumina on.
IIT GUWAHATI
8
IIT GUWAHATI
9
IIT GUWAHATI
10
2.1.2 Deformable Templates:
In order to improve the performance of snakes and account for the a
priori of facial features, Yuille et al. proposed deformable templates. It is
challenging to arrange the local evidence of facial edges into a logical global
en ty using generic contours, making it difficult to locate a facial feature
boundary. The edge recogni on technique is complicated by the low brightness
contrast surrounding some of these objects. By using global informa on from
the eye to increase the accuracy of the extrac on process, Yuille et al.
expanded on the idea of snakes.
Approaches using deformable templates are created to address this issue. Local
valley, edge, peak, and brightness are the basis for deforma on. The extrac on
of salient features (eyes, nose, mouth, and brows), in addi on to the facial
border, is a significant challenge in face recogni on. E = Ev + Ee + Ep + Ei +
Einternal, where Ev, Ee, Ep, Ei, Einternal are internal energy and exterior energy
resul ng from the valley, edges, peak, and image brightness.
IIT GUWAHATI
11
This method also has the restric on that the skin region in the image
must only be on the face. To dis nguish skin patches from the backdrop in the
HSV colour space, Kjeldson and Kender created a colour predicate.
IIT GUWAHATI
12
The classifica on of skin colour in HSI colour space is iden cal to that in
YCbCr colour space, however here the relevant values are hue (H) and
satura on (S). A pixel is categorised as having skin tone if the values [H,S] lie
inside the threshold, similar to above the threshold be chosen as [H1, S1] and
[H2, S2], and this distribu on provides the localised facial image. This algorithm
is subject to the same constraint as the previous two.
IIT GUWAHATI
13
IIT GUWAHATI
14
IIT GUWAHATI
15
3. FACE RECOGNITION
Over the previous couple of many years many strategies were proposed
for face reputa on. Many of the strategies proposed throughout the early
ranges of laptop imagina ve and prescient can't be taken into considera on
successful, however nearly all the latest methods to the face reputa on trouble
were creditable. According to the studies through Brunelli and Poggio (1993) all
methods to human face reputa on may be divided into strategies: (1)
Geometrical func ons and (2) Template matching
IIT GUWAHATI
16
IIT GUWAHATI
17
IIT GUWAHATI
18
faces with intra-subject differences in ligh ng, expression, accessories, colour,
occlusions, and brightness.
The face iden fica on system checks prospec ve face loca ons it has
discovered (the best face loca ons it could find during its search) to see if a face
is there. This method of iden fying a face will work effec vely if the threshold
level (the largest difference between the reconstruc on and the original for the
original to be a face) is set correctly. The search space of probable face
placements can be condensed to a small number of spots by the quick
deformable template technique.
Then, a reconstruc on is used to verify these. By instruc ng the face
detec on system to output any loca on with a "faceness" value that is, for
example, at least 0.9 mes the best heuris c value that has been found thus
far, rather than just the best face loca ons it has discovered thus far, it is
possible to alter the number of loca ons the system finds. The next step is to
use reconstruc on to assess a large number of addi onal probable face sites.
Making judgments about these and other speed versus accuracy trade-offs
requires taking into account the pla orm that the system will be used on.
IIT GUWAHATI
19
The output of the face detec on system can be examined for correla on
with the typical face rather than reconstruc on to ensure accuracy. There is
probably a face in the divided areas with a high correla on. Once more, a
threshold value will need to be set in order to dis nguish between faces and
non-faces. Like reconstruc on, resizing the segmented area and figuring out its
associa on with the average face is far too expensive to be u lised by itself for
face detec on, but it is acceptable for confirming the results of the face
detec on system.
IIT GUWAHATI
20
IIT GUWAHATI
21
agencies, security agencies, systems for individual iden fica on, and
applica ons for widespread surveillance. Due to various aspects, including face
size, image size, type, and other circumstances involved, human face detec on
has historically been a difficult undertaking. Faces may be depicted in
photographs in a variety of posi ons and perspec ves, and there are wide
varia ons across photographs and images in terms of quality and contrast.
IIT GUWAHATI
22
Conclusion
IIT GUWAHATI
23
REFERENCES
IIT GUWAHATI