COMPARATIVE ANALYSIS OF MACHINE LEARNING ALGORITHMS ON FACE RECOGNITION DATASET

(1)

COMPARATIVE ANALYSIS OF MACHINE LEARNING ALGORITHMS ON FACE RECOGNITION DATASET

Samriddh Kohli¹, Prarthna², Paras Modi³, Pradeep Singh Rathour´, Chhavi Sharmaµ

¹Department of Information Technology, Inderprastha Engineering College Ghaziabad, Uttar Pradesh, India

²Department of Information Technology, Inderprastha Engineering College Ghaziabad, Uttar Pradesh, India

³Department of Information Technology, Inderprastha Engineering College Ghaziabad, Uttar Pradesh, India

⁴Department of Information Technology, Inderprastha Engineering College Ghaziabad, Uttar Pradesh, India

⁵Professor, Department of Information Technology, Inderprastha Engineering College Ghaziabad, Uttar Pradesh, India

---***--- ABSTRACT: AI computations can sort out how to

perform basic tasks by summarizing from representations. This examination targets looking at changed calculations utilized in AI. AI can be both experience and clarification based learning. In this examination, the most mainstream calculations were utilized like (LBPH), (SVM), (LDA), and (KNN). The datasets were utilized to check the viability of calculations. Near assessment of the classifiers shows that KNN is better than different techniques with high exactness.

Keywords: FaceRecognition; (KNN); (LBPH); Linear Discriminant Analysis (LDA); (PCA); (SVM).

1. INTRODUCTION

Face recognition is one of the latest relevant applications of image analysis. This is a genuine test:

fabricating a robotized framework, like an individual's capacity to perceive individuals' appearances. Even though people are reasonably well-defined and well- known personalities, but we aren’t as talented as systems are, at the point when we need to manage countless obscure people we utilize all around prepared frameworks. We can say that computers have almost infinite memory, and computational speed which overcomes human limitations.

Face acknowledgment of an individual to perceive the face has likewise become a mainstream space of exploration in PC vision, which is quite possibly the best use of picture examination and comprehension.

As you know, the face is a fundamental space of examination in the field of machine information on handling, or the force, the vision, the shape, the plan of the apparent, and to play in full power and impact to apply on the noticed photon.

2. LITERATURE REVIEW

In the previous years, many have finished up the theoretical pot of AI calculations executed for different foundations like logical exploration and discoveries. In the year 2017,[1] they have concluded a refined and detailed study of machine learning along with its section of ml algos. being implemented for various scientific research and findings. Moreover, a tactful study of supervised and unsupervised algorithms is described along with a comparative study of each. To better understand we have inculcated the learnings from the prescribed paper above and to learned its implementation over the vast concept of facerecognition and detection.[2] Here, they explained the overall concept of face-detection and recognition with proper aspect knowledge with valuable and knowledgeable cited sources for suited judgment by the viewer/reader. In 2014,[3] introduced many algos like PCA, LDA, and ICA for a detailed peek into different face recognition algorithms and how they perform with yielding results under general conditions. Also in 2018,[4] gave a decent and more explained survey for many techniques used under face recognition, which is referred to as a source of evaluation and reference, including many algorithms likeSVM, HMM, etc. tested over well recognized and trusted datasets like yale face- dataset, FERET, etc. In addition to this, in 2019,[5] they presented the new and centered examination for the LBP algo where they clarified the execution of this strategy over the space of face acknowledgment and how it very well may be utilized for broadened applications for face acknowledgment.

3. FACE RECOGNITION SYSTEM

When in doubt, the construction of a face acknowledgment framework comprises three principal stages: data on the essences of the Concentrate of the facial highlights, and facial highlights. These means are explained as follows: -

(2)

A. Acquisition of Face Data

The assortment and preparing of the face is the initial phase in any face acknowledgment framework; at this stage, the face is caught with the assistance of one source, like a camera, and an encounter of an ordinary picture in the data set. The captured image is converted to a grayscale image and resized to eliminate the posed problem to gather real-time images from your webcam, or maybe at the static time.

Accumulating the pictures of the face, it ought to incorporate the posture, light, demeanor, etc. the varieties, to test the face acknowledgment framework, we need to work under these conditions. Preparing a face information base is fundamental in a couple of cases or, in all likelihood, causes a critical impact on the presentation of face acknowledgment framework depending on the progressions in the lighting, the foundation, the lighting conditions, the distance to the camera, and the size and direction of your head. So, the photo is simplified, and the photolog is applied to any image conversion techniques.

B. Extracting Face Feature

We can define this process as the process of extracting the relevant data from a image data.At the point when you get a sign to be made by math, as numerical portrayal of unique picture introduced as a purported

" biometric format or biometric certification put away in the information base and will fill in as a reason for the heading of the perceiving of the main job. Later on, extracted features were used for recognition. After that, the pixel which was shaded as grey, is considered to be the initial item.

C. Recognition of Face

In this process, after selecting the extracted features, images are classified. Grouping Strategies like SVM, LDA, and Fisher Face are utilized for that appearance- based face acknowledgment calculations. While grouping, the appearances are thought about for the likenesses between countenances of a similar individual and others after all the face pictures in the data set are addressed with pertinent highlights. Now and again highlight extraction and acknowledgment measures are done at the same time.

ADVANTAGES AND DISADVANTAGES OF FACE RECOGNITION SYSTEM

Advantages:

1.Quick and non-intrusive character confirmation 2.Better laborer participation framework.

3.Inexpensive techniques of identification.

Disadvantages:

1.Helpless Picture Quality Cutoff points Facial Acknowledgment's Viability

2.Small Image Sizes Make Facial Recognition More Difficult.

3.Little Picture Sizes Make Facial Acknowledgment More Troublesome.

Fig -1: Block Diagram of Process[6]

TABLE 1. Confusion Matrix

Where, TP= Number of Genuine Positive forecastFP= Nu mber of Bogus positive expectations

TN=Number of Genuine Negative expectations FN= Number of Bogus negative expectations 1.Precision= TP/TP+FP

2.Accuracy=TP+TN/TP+TN+FP+FN 3.Recall = TP/TP+FN

4. ALGORITHMS FOR FACE RECOGNITION SYSTEM A portion of the sorts of calculations that can be utilized for face acknowledgment are recorded underneath:

(3)

1. Local binaryPattern Histogram (LBPH).

2. SupportVector Machine (SVM).

3. Linear DiscriminantAnalysis (LDA).

4. k-Nearest-Neighbors (KNN).

1. Local Binary Pattern Histogram (LBPH): - LBPH Algorithm

//LocalBinaryPatterns (LBP) is a visual descriptor utilized in PC vision that is viewed as an incredible asset for surface grouping. It was first portrayed in 1994. Further, it had been determined that if LBP is combined with HistogramsofGradient (HOG) descriptor, it improves detection performance for some datasets.

The LBPH algorithm uses four parameters:

● Radius: It fabricates a roundabout neighborhood twofold example and addresses the radius(R) around focal pixel.

● Neighbor: It portrays the quantity of test points(P) to assemble the round straight parallel example. The more number of neighbors, more the computational expense.

● Grid X: Number of cells level way.

● Grid Y:Number of cells vertical way.

Fig -2: Grid-cell display A.Face Detection

The OpenCV library provides several classifiers named Haarcascade_classifiers, which are used for face detection. Different facial highlights are identified by the Haar Course Classifier that utilized the AdaBoost algo for facial location.

B.Applying LBP operation and Extracting Histograms For featuring the facial attributes, the sliding window idea, in view of boundaries – span and neighbor, is utilized by the LBP administrator that makes a moderate picture to depict the first picture. Originally, the LBP operator used the 3x3 window that contains the intensity of each pixel (0-255). Assume, on the off chance that it takes a grayscale picture, it creates a 3x3 lattice thinking about focus esteem as a limit, then, at that point contrasts the nearby 8 pixels and the middle worth. In the event that it is more prominent than or equivalents to worth of the focal pixel, it will be supplanted with 1; in any case, 0.

At this point, the matrix only has the decimal values except for the central pixel value. We concatenate all binary values line by line into a single binary number (e.g.-10001101), convert it into a decimal number, and assign it as the central pixel of the matrix.

Fig -3: Facevalue to matrix representation[7]

Using the Grid X and Grid Y parameters, the current image will be divided into multiple grids. Each sub- region makes its statistical histogram that contains 256 positions (0-255), representing the occurrence of each pixel intensity. Then, at that point it builds up a solitary histogram by linking every one of the histograms of sub- districts.

Fig -4: Histogram breakdown[7]

B.1 Face Recognition

● The above same advances are performed with the new information picture and make a factual histogram addressing the picture.

● Utilizing various methodologies (like total worth, Euclidean distance, chi-square, and so forth), the histogram is contrasted and the dataset and returns the picture (or result, can be any name or ID) with the nearest histogram.

(4)

2. Support Vector Machine (SVM)

SVM is a controlled administered AI model and with the assistance of this calculation we can characterize issues into two-bunch order. It works with the named information, and it is a quick and solid order calculation, which functions admirably with a restricted measure of information to be dissected. You may have burrowed somewhat deeper and got over the things that are to be isolated, lines, wagers, and the fundamental highlights and capacities.

The fundamental objective of the SVM calculation is to make a choice limit of a n-dimensional space of the classes, and this choice limit is known as a hyperplane.

The SVM chooses the limit focuses which will help the hyperplanes, and these limit focuses are known as the help vectors.

The experience with the SVM algorithm

1. Let's imagine that we have two of the tags; the red, the blue, and we have two of this feature of the data: x and y. We have a group, since a number of the coordinates (x, y),if its either, red, or blue. We are building a schedule, as we have already seen the training, the information, the on-board:

Fig -5: OurLabeled data

2. SVM is to take the information from this point of view, and is the result of a hyperplane (of the two- dimensional-it's just one line, which is most clearly marked with a tag. This line is the line of the dynamic, all that falls on its side, is assigned as a blue, and all that is then again, is named a warning.

Fig. 6. Hyperplane segregation

3. For the SVM, this option increases both the range and the tags. At the end of the day, the hyperplane (note that for this situation, direct) in which the distance is to the closest component of every one of the tag, is most noteworthy.

Fig -6(a).

LIMITATION

SVM doesn't function admirably when the informational index has a ton of commotion, i.e[8]The objective classes are covered.

3. Linear Discriminant Analysis (LDA)

LDA is a ‘linear discriminant algorithm’ which is also known as fisher-face algorithm. [9]It is a technique , which depends on appearance, it is utilized for dimensional decrease and recorded an exceptional execution in face acknowledgment innovation.

LDA uses projections of training images into a subspace defined by fisher face known as fisher space.Recognition involves projecting a new face onto the fisher space.

Face recognition from images is a subarea of the general object recognition problem. It is of particular interest in the wide variety of applications.

[10]It is discovering the focal point of the primary highlights that best recognize the classes. All of the samples from all of the brands, particularly the inter- class of the matrix, were in the SB and the intra-class

(5)

matrix (the SW).The goal is to build the worth of SB while decreasing the worth of SW, or we can say, expand the proportion (det|SB|/det|SW|). This proportion is expanded when segment vectors of the projection framework are the eigenvectors of (SW^-1

× SB). LDA is attempting to disclose to them the distinction between the classes of information. LDA is an incredible method for face location, which defeats the impediments of head segment examination, utilizing a direct discriminant investigation basis. This basis works by expanding the determinant of the grid between the classes of the extended examples to the determinant of the framework in the class of a planned test. The straight discriminant examination holds photographs, as a class, and the photos and various types of pictures.

Calculates the spread between classes (Sb) and grade n Ni

Sw = Σ Σ Ni (xj − Ψj)(xj − Ψj)T i=1 i=1 n

Sb = Σ Ni (ψi − ψ)(ψi − ψ)T i=1

Fig -7: FLDA Description:

Ni = The number of data training in class i n = The number of different class

Ψ = The average total of vector to a sample to the i

ψi = The average of the sample on to the i xj = vector of PCA from pictures to i and results from classroom to j

Fig -7(a): 3-D model FLDA FEW IMPORTANT POINTS

1. Although LDA has shown excellent performance in face recognition tasks, traditional LDA algorithms have problems handling a degenerated Sw. Probably the most trademark measurements are conceivably lost by erasing the invalid space of Sw. [11]The complete rank requirement of Sw can be transferred to Sbwhen applying a simultaneous diagonalization procedure. It will now no longer lose any precious info via way of means of deleting the null area from Sb.

2. The first step of the new algorithm includes a dual purpose: dimensionality reduction and sub-space mapping. This step, in fact, directly brings raw image knowledge onto the face sub-space, given that sample pictures are aligned. Therefore, we are able to safely delete the null space that doesn't contribute to face recognition.

3. The new formula has the foremost discriminant projection direction embedded within the topological space of Sw. The algorithm will profit of all useful info within and out of doors of Sw' null space.

LIMITATION

The main disadvantage of LDA is that it may run into the issue of small size. The scatter matrix becomes unique when the small size problem arises within a class. The projection vector that can achieve the objective of an LDA process is the one that can maximise the between- class scatter, because the within-class scatter of all the samples is zero in the null space of Sw.

4. k-Nearest Neighbours (KNN)

All KNN is a decent set of rules that shops all handy suitcases and classifies new suitcases primarily based totally on a similarity measure. KNN has symmetrical names (a) Memory-Based Reasoning (b) Example-Based Reasoning (c) Instance-Based Learning (d) Case-Based Reasoning and (e) Lazy Learning. (KNN applied for relapse and grouping for prescient issues. Be that because it may, it's far widely applied as an element of grouping issues withinside the business. To investigate

(6)

any procedure, we with the aid of using and massive take a gander at three essential angles:

1. Simplicity in the elucidation of outputs.

2. Calculation time.

3. Predictive Power.

K-NN is also known as the "non-parametric algorithm"

which indicates that it won't make judgments based on the underlying or fed data at an instant to it. Being a lazy learner algorithm doesn't act instantaneously instead it stores the data for evaluation and comparison at the time of actual classification and then retrieves the accurate results.

KNN set of rules on the education segment simply shops the dataset and whilst it receives new records, then it classifies that records into a class this is tons just like the brand new records.

Example: Suppose, we've got a photo of someone and in addition, we need to pick out the individual is trusted/recognized one or intruder/stranger so KNN can pivotal function through distinguishing the variations and assist us well known with proper and correct results. As KNN is primarily based totally on similarity measures, for this reason, it by no means appears to amaze with results. The KNN version will discover the closest attributes from the brand new records set that with the dataset used for education and making the version aware about the authentic or fake datasets primarily based totally at the maximum not unusual place functions for every take a look at the case[12].

Also, it uses Euclidean Distance for the nearest neighbor distance calculation for further evaluation and determination of results. The formula or euclidean distance under simplified and mathematical version /format can be represented as:

D(distance) = sqrt((x2-x1)^2 + (y2-y1)^2)

Besides that, the optimal method of choosing K-value suggests that better accuracy or results wielded by algorithm, the K-value is usually taken around 5(for many instances of implementation and study of instances concluded so far) because more the K value lesser the accuracy of results and very less value may lead to noisy data evaluation affecting the whole report status.

In addition to that, The proper desire for okay has an enormous effect on the diagnostic overall performance of the KNN algorithm. A large value reduces the effect of fluctuations due to random error, however runs the threat of disregarding small however vital pattern. The key to picking the suitable okay fee is to strike a stability among overfitting and

underfitting. Some authors endorse to set okay identical to the rectangular root of the variety of observations with inside the schooling dataset.

5. COMPARISON

Dissecting every one of the calculations there should be a way that can legitimately give results dependent on some quantifiable calculation in a reasonable/unprejudiced path workable for us to all more likely yield the result from it. Every calculation allows classes to the perceptions in the test dataset contrasted with the perceptions in the preparation dataset. Knowing the unmistakable class of perceptions in the test dataset permits you to assess the exhibition of your model in a more derive way. An ordinarily utilized boundary is the normal accuracy controlled by the accompanying condition:

Fig -8: Average/Aggregate accuracy[13]

We have executed a model utilizing LBPH technique to get exceptionally exact outcomes.

TABLE 2. LBPH CONFUSION MATRIX Category Predicted/Kno

wn Unknown/Intru

der Predicted/Kno

wn 7 2

Unknown/Intru

der 3 4

Based on this, the Average Accuracy is 0.687500 We have executed a model utilizing SVM technique to get exceptionally exact outcomes.

TABLE 3. SVM CONFUSION MATRIX Category Predicted/Kn

own Unknown/Intr

uder Predicted/Kno

wn 8 1

Unknown/Intr

uder 1 6

Based on this, the Average Accuracy is 0.875000.

(7)

Besides this, a graphical representation can provide a better understanding of the comparison stating the average accuracy for each algorithm respectively.

We have executed a model utilizing LDA technique to get exceptionally exact outcomes.

TABLE 4. LDA CONFUSION MATRIX Category Predicted/Kn

own Unknown/Intr

uder Predicted/Kno

wn 7 2

Unknown/Intr

uder 2 5

We have executed a model utilizing KNN technique to get exceptionally exact outcomes.

TABLE 5. KNN CONFUSION MATRIX

Category Predicted/Kn

own Unknown/Intr

uder Predicted/Kno

wn 8 1

Unknown/Intr

uder 0 7

Chart -1: Accuracy Comparison Chart

6. CONCLUSIONS

[14]The study covers a range of algorithms that may be used to construct a facial recognition system, and we've compared a number of them, as well as discussed their benefits and drawbacks.

In this paper, we will examine how each of the algorithms was implemented, with the conclusion that KNN is perhaps one of the best face-recognition methodologies amongst the four. Based on the assessment, it is not one specific algorithm that is well- suited for good accuracy rates, or even the features of different techniques that have been well for various network requirements. Face recognition is mostly to the technology, in - THE, with the K - nn. The prediction accuracy for attaining to the K - nn for measuring the overall state of the user is 0.9375 on mean, that is superior than most of the other approaches.

At first, the basis vectors, K - nn is memory-efficient and highly efficient. This method achieves a reasonable degree of facial expression recognition performance which can be incorporated for security applications as well.

REFERENCES

1. Kapil Sethi, Ankit Gupta, Gaurav Gupta, Varun Jaiswal, “Comparative Analysis of Machine Learning Algorithms on Different Datasets”, Circulation in Computer Science International Conference on Innovations in Computing (ICIC 2017), pp:87-91.

2. Colmenarez A.J., Huang T.S. (1998) Face Detection and Recognition. In: Wechsler H., Phillips P.J., Bruce V., Soulié F.F., Huang T.S. (eds) Face Recognition. NATO ASI Series (Series F: Computer and Systems Sciences), vol 163. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642- 72201-1_9.

3. Rakesh Saini, Abhishek Saini , Deepak Agarwal ,

“Analysis of Different Face Recognition Algorithms”, International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 www.ijert.orgIJERTV3IS111235 (This work is licensed under a Creative Commons Attribution 4.0 International License.)Vol. 3 Issue 11, November-2014.

4. Madan Lal, Kamlesh Kumar, Rafaqat Hussain Arain, Abdullah Maitlo, Sadaquat Ali Ruk, Hidayatullah Shaikh, “Study of Face Recognition Techniques: A Survey”, (IJACSA) International Journal of Advanced Computer Science and Applications, Vol.

9, No. 6, 2018.

(8)

5. Aftab Ahmed, Farah Deeba, Fayaz Ali, Jiandong Guo, “LBPH Based Improved Face Recognition At

Low Resolution”,

https://www.researchgate.net/publication/327 980768_LBPH_Based_Improved_Face_Recognitio n_At_Low_Resolution

6. “Face Recognition Homepage”, http://www.face- rec.org/algorithms/#Comparisons.

7. Suresh, S.Prem kumar, “Attendance Monitoring System By LBPH Algorithm”, International Journal of Advanced Science and Technology Vol.

29, No. 5, (2020), pp. 3602 - 3606.

8. Sushma Jaiswal, Dr. (Smt.) Sarita Singh Bhadauria, Dr. Rakesh Singh Jadon3,

“Comparison Between Face Recognition Algorithm-Eigenfaces, Fisherfaces And Elastic Bunch Graph Matching,” Journal of Global Research in Computer Science , Volume 2, No. 7, July 2011.

9. Suman Kumar Bhattacharyya, Kumar Rahul,“Face Recognition by Linear Discriminant Analysis,” unpublished.

10. G. J. Alvarado, W. Pedrycz, M. Reformat, Keun- Chang Kwak “Deterioration of visual information in face classification using Eigenfaces and Fisherfaces,” Machine Vision and Applications, Vol.17, No. 1, pp. 68-82. Springer- Verlag 2006.

11. A. Alfalou and C. Brosseau, “A New Robus Discriminating Method for Face Recognition Base Correlation Technique and Independent Compone Analysis Model,” Optics Letters 36 2011 645-647.

12. Pooja K S, R N Shreya, Sree Lakshmi M, Yashika B C , Mrs. Rekha B N, “Color Recognition using K- Nearest Neighbors Machine Learning classification algorithm trained with Color Histogram Features.”, International Research Journal of Engineering and Technology (IRJET) e- ISSN: 2395-0056 Volume: 08 Issue: 01 | Jan 2021 www.irjet.net p-ISSN: 2395-0072.

13. “Breast Cancer Detection Using Machine Learning”,

https://randerson112358.medium.com/breast- cancer-detection-using-machine-learning- 38820fe98982

14. Mohammed Javed, Bhaskar Gupta “Performance Comparison of Various Face Detection Techniques,” IJSERT Vol 2 Issue 1 pp019-0027 April 2007.