# Driving Detection Based on the Multifeature Fusion

Authors: Qiufen Yang; Yan Lu
Journal: Journal of Control Science and Engineering
 (2022)

---

## Abstract

In order to solve the problems of facial feature localization and driver fatigue state identification methods in driving fatigue detection, a driving detection method based on the multifeature fusion was proposed. This method uses a supervised descent algorithm to simultaneously locate multiple facial features of drivers. On the basis of blink, yawn and nod judgment, multiple characteristic values of blink frequency, yawn frequency, and nod frequency of drivers were extracted to establish a fatigue detection sample database, and a naive Bayes classifier was constructed to judge fatigue. When the driver appears fatigue driving, warning information is given in time in order to prevent traffic accidents. The experimental results show that two sample videos were selected for testing. The accuracy rate of video sample 1 and video sample 2 was 94.74% and 95.00%, respectively.Conclusion. In the actual driving environment video test results, the discriminant average accuracy of a driver fatigue state reaches 94.87%, which has a good performance.


---

## Body

## 1. Introduction

According to the official website of the National Bureau of Statistics, by the end of 2019, the number of civil cars in China reached 253.7638 million, with a year-on-year growth of 9.23%. The number of car drivers reached 39,7528,600, with a year-on-year increase of 7.66% [1]. Cars greatly facilitate people’s travel. In transportation, its role is irreplaceable, but the popularity of cars also inevitably has caused the frequent occurrence of road traffic accidents. China is one of the countries with the largest number of road traffic accidents in the world, which not only leads to a huge number of casualties, brings irreversible losses to individuals, families, and the country, but also seriously hinders the development of China’s economy and social stability. As can be seen from the data of automobile traffic accidents in China in recent 10 years [2] shown in Figure 1 below, since 2010, the number of accidents and the number of injuries have basically changed simultaneously, and the number of deaths fluctuates slightly. However, it is still not optimistic, the direct loss of property due to accidents is huge, and the overall trend is on the rise.Figure 1
Statistical chart of automobile traffic accidents in China from 2010 to 2019.Fatigue driving is one of the main causes of traffic accidents, and the number of traffic accidents caused by it is increasing year by year [3]. Fatigue driving has a strong concealability, and usually only the driver himself can detect it. Therefore, if the driver can be timely and accurately detected and given some warning after determining the fatigue state of the driver, the injury of fatigue driving can be greatly reduced. Therefore, as an important means to reduce traffic accidents, fatigue driving detection and early warning have gradually become an important technical research hotspot in the academic field and the automobile industry at home and abroad.


## 2. Literature Review

By obtaining the maximum zero speed percentage and the maximum angle standard deviation in the steering wheel rotation process, Nemcova et al. identified the fatigue degree of the driver through the classifier and established the fatigue detection method of the highway under the condition of constant lane change [4]. Bakker et al. studied steering wheel angle and the steering wheel angle rate. Using these two parameters to establish the coordinate system, it is found that when the driver is awake, the sample points obtained are mostly distributed in an ellipse centered on the origin, while when the driver is fatigued, the sample points are located far away from the origin [5]. The fatigue degree was judged by heart rate variability (HRV) by Nowara et al. which refers to the time difference between two heartbeats and the change of the ratio of high and low heartbeats with the fatigue degree [6]. Gonzalez et al. used infrared illumination to produce the bright pupil effect for eye detection. First, a bright pupil image under 850 nm infrared light was taken, and then a dark pupil image under 950 nm infrared light was taken. The position and size of the pupil can be obtained by differential processing of two frames of images. The degree of eye-opening is judged according to the size of the pupil, and the driver’s fatigue degree is judged by using PERCLOS characteristic parameters [7]. Gomez designed a structure with the camera as the center and two circles of LED around it. For odd frames, the inner LED is lit to form coaxial light, while for even frames, the outer LED is lit to form off-axis light. Coaxial light has a strong ability to reflect into the camera through the eye, while off-axis light has a poor ability to reflect into the camera through the eye, resulting in a bright pupil reaction of one bright pupil position and one dark pupil position in two adjacent images. The position and size of the pupil can be obtained through image difference [8]. Guo used edge detection and Hough circle transformed to locate the features of the driver’s mouth for early warning. This method has many constraints and cannot adapt to the randomness and complexity of the driving environment. Therefore, the detection and fusion of multiple facial features has become an inevitable development trend, but in the driving process, the dynamic changes of drivers’ head posture, external environment, illumination, and other factors are still difficult to achieve the positioning of multiple features [9].To solve the above problems, a multifeature fusion algorithm for driver fatigue detection based on machine vision is proposed. A scale invariant feature transform (SIFT) feature value was optimized by the supervised descent method to achieve facial feature localization. The naive Bayes classifier was combined with blink frequency, yawn frequency, and nod frequency for fatigue judgment. Warning messages are given to drivers when they are tired to prevent traffic accidents. (See Figure2).Figure 2
Driving detection with a multifeature fusion.


## 3. The Research Methods

### 3.1. Facial Feature Localization Algorithm

An active shape model mainly studies the contour of the target object, such as face, hands, heart, lungs, and other objects with little change in the individual shape. The building of active shape model is divided into two parts: training and image matching. The first part is the training part of the model, which needs to find enough target object images as training samples, predetermine the number and position of the required feature points, manually mark the target feature points on each training sample, and obtain its target vector. Then, the target vector set obtained from the training sample is statistically analyzed, normalized by the principal component analysis method, and the average shape vector of the training set is obtained as the initial shape, and the change direction of each point in the shape vector is limited. After the training, the target image is matched for the matching part of the image. The trained initial shape is overlapped with the target image by scaling, rotation, and translation, and the position of each point is optimized and adjusted according to the local grayscale model. The optimal position of each point is searched by the iterative method and finally converges to the shape vector corresponding to the target shape. The specific calculation process of the active shape model [10] is shown in Figure 3.Figure 3
Calculation flow of the active shape model.Human face is a kind of unstructured object with complex detail changes, which makes the traditional detection methods based on the facial skin color and shape characteristics cannot be well adapted to the changes of complex environment [11]. Among numerous research algorithms, the positioning algorithm represented by machine learning is based on a large number of data samples, and the internal relationship of the data is mined through certain learning methods, so that the learning model can still show good learning and reasoning ability in the face of complex environmental changes. Therefore, facial feature localization is considered from the perspective of machine learning. SIFT feature values of facial feature points were optimized by the supervised descent algorithm to build a prediction model of facial feature points. The algorithm model is shown in the following formula [12]:(1)fx0+Δx=hdx0+Δx−ϕ22,where, dx is the index value of marked feature points, 68 feature points are selected to mark facial feature positions, and dx∈R68×1 (R68×1 is the index matrix of feature points. hx is nonlinear feature extraction function, representing SIFT feature values of facial feature points. For the 128-dimensional SIFT feature, hdx∈R128×68. In the training, x∗ is the known labeled feature points in the sample database, ϕ∗=hdx∗ is the eigenvalue of labeled feature points, ϕ∗∈R128×68; x0 is the initialization feature point.The model can be regarded as minimizing equation (1) by finding the gradient direction Δx of the feature point. In the process of model training, for the general Newton iteration method, the initial convergence of the feature point x0 to the marked feature point x∗ is only required by obtaining a series of gradient descent directions and updating the scaling coefficient Δxk+1=xk+Δxk. Assuming the second derivative of feature extraction function hx , equation (1) is expanded by the second order Taylor formula to obtain the following equation [13]:(2)fx0+Δx≈fx0+Jfx0TΔx+12ΔxTHx0Δx,where Jfx0, Hx0 are the Hessian and Jacobian matrices of the model at the initial facial feature points. Formula (3) can be obtained by taking the derivative of fx0+Δx=0 against Δx in formula (2).(3)Δx=−H−1Jf=−2H−1JfTϕ0−ϕ∗,where Jf=2JfTϕ0−ϕ∗: let R0=−2H−1JfT, then Δx=R0ϕ0−ϕ∗. In this process, the calculation of R0 will inevitably involve the calculation of Hessian and Jacobian matrices, which will lead to the increase of computational complexity and the existence of strong constraints. Therefore, the supervised descent algorithm is adopted to learn R0 directly through the training data set, as shown in the following equation:(4)Δx=R0ϕ0+b0,where b0 is the offset term, and the training process is as follows:(1)
A set of training set picturedi and corresponding labeled feature point set x∗iwere given, the average facial feature point shape was calculated by normalizing the training sample [14, 15].(2)
A face detection classifier was used to locate the faces of the training samples, and the average facial feature point shape was used to initialize the facial feature pointx0i.(3)
The first descent directionR0 and deviation term b0 were calculated, as shown in the following formula:(5)argminR0,b0∑di∑x0iΔx∗i−R0ϕ0i−b02,x∗i=x∗i−x0i, ϕ0i=hdix0i is the eigenvalue of the initial facial feature point of the image of the ith training sample.(4)
The feature pointxi is updated for the first time, as shown in the following equation:(6)x1=x0+R0ϕ0+b0.(5)
Steps (3) to (4) are repeated until equation (1) converges.In model training,k−1 descent direction Rk−1 and deviation bk−1 are calculated as shown in equation (7). The k update calculation of feature point xi is shown in equation (8).(7)argminRk,bk∑di∑xkiΔx∗k−1i−Rk−1ϕk−1i−bk−12,(8)xk=xk−1+Rk−1ϕk−1+bk−1.LFPW database was used for model training [16].


### 3.2. Extraction of Fatigue Eigenvalues

Numerous studies have shown that yawning, frequent nods, and increased blinking occur when the body is tired. Therefore, on the basis of facial feature localization, blink frequency, yawn frequency, and nod frequency were selected as fatigue characteristic values. Firstly, the state judgment of blinking, yawning, and nodding was analyzed [17], taking blinking judgment as an example, as shown in Figure 4.Figure 4
Diagram of the eye height-to-width ratio.The eye aspect ratioeh/ew was selected as the condition for blinking judgment. When eh/ew≤et , it was closed, otherwise, it was open, where, et is the judgment threshold of open and close eyes. Yawning is similar to blinking. Head pose estimation. A head pose model was established to predict the head pose pk by using the supervised descent algorithm based on the head pose described in the literature. Similar to blinking judgment, when pk≥nt is the nodding state, otherwise, it is the normal state (nt is the threshold of nodding judgment) [18].


### 3.3. Design of a Simple Bayesian Classifier

Classification is an important research content in machine learning, pattern recognition, artificial intelligence, and other fields. Many problems in real life can be essentially classified, such as risk prediction, medical diagnosis, spam, fraud detection, and so on. Classification requires learning to produce an objective function (called a classifier or a classification model) that assigns a sample described by an attribute set to a class tag. A classification problem is a two-stage process [19], including the learning stage and the classification stage. In the first stage, the classification algorithm constructs the classification model by analyzing the learning and training data set. The training set consists of tuple data and class tags are associated with it. In the second stage, the classification model constructed by learning is used to classify and predict the sample set with an unknown class label. In general, it is necessary to evaluate the performance of the classifier before using the model for classification. Only the classifier whose performance evaluation indexes meet the specified requirements can be used to classify unknown sample sets.Due to the excessive optimization effect of the learning algorithm on the training set, the classification model derived from the training set may not be the best, which may mistakenly lead to overoptimistic values of some indexes used to evaluate the model, and researchers are eager to obtain the model with the best classification performance. Therefore, it is very important to compare the performance of different classifiers applied in the same field by calculating evaluation criteria on the test set.The naive Bayes classifier is based on Bayesian theory, which assumes that conditions are independent among variables and classifies samples by obtaining a posterior probability that they belong to a certain category [20]. The judgment of driving fatigue is regarded as a dichotomous problem. Given sample characteristics, x=x1,x2,x3, x1 are blink frequency, x2 are yawn frequency, and 4 x3 are nod frequency. The posterior probability distribution of samples is calculated, and the class with the highest posterior probability is taken as the class of x. The posterior probability can be calculated into the following equation,according to the Bayes formula:(9)pY=ckX=x=pX=xY=ckpY=ck∑kpX=xY=ckpY=ck,where, X is the input feature set, x∈X; Y is the category set, Y∈c1,c2,…,ck,k=1,2,c1=1 indicates normal driving condition, c2=−1 is the fatigue driving state. Formula (10) can be obtained by expanding formula (9) with the full probability formula.(10)pY=ckX=x=pY=ck∏jpXj=xj|Y=ck∑kpY=ck∏jpXj=xj|Y=ck.According to equation (10), the naive Bayes classifier is established in the following equation:(11)y=fx=argmaxckpY=ck∏jpXj=xjY=ck∑kpY=ck∏jpXj=xjY=ck.Since the denominator in equation (11) is the same for all CK, the classifier can be further simplified into the following equation:(12)y=fx=argmaxckPY=ck∏jpXj=xjY=ck.The advantage of the naive Bayes classifier is that the logic of the algorithm is relatively simple and easy to implement. The time and space cost of algorithm implementation is small. It has a stable performance [21], and has little difference in the classification effect for data sets with different data characteristics, that is, the model has good robustness. Naive Bayes classification is not to absolutely assign a sample to a class, but to calculate the posterior probability of the sample belonging to each class, and then map the sample to the class with the maximum posterior probability. And generally, all attributes are in the naive Bayes classifier. In the classification process, all attributes play a direct or indirect role, that is, all attributes participate in the classification, instead of simply deciding the result by one or a few attributes. Although the independence of class conditions between attributes is difficult to be satisfied in practice, it still has a good classification performance, mainly for the following reasons: a relatively few parameter estimates ensure the stability of the estimates. Although the estimated probabilities are biased, the classification principle is based on the order of posterior probabilities, so even if there is a slight deviation in the classification process, it does not matter. In general, data preprocessing is carried out in the early stage of modeling, during which highly correlated variables may be screened, etc., which also improves the data quality for classification to a certain extent.A naive Bayes classifier also has some defects, and it is difficult to satisfy the hypothesis of class condition independence between attributes in practical application. If the conditional attributes in the data set are highly correlated, it is difficult to achieve the expected classification effect by using the naive Bayes classifier directly. On the other hand, when the data set is incomplete or there is extremely unbalanced data, the deviation of the posterior probability of individual attributes may be large, and the final classification result may be inaccurate. In addition, the quasi-prior probability and quasi-conditional probability needed to be calculated in the classification process of this model are estimated by using the training set, and then the class label of unknown samples is specified according to the formula. Therefore, the noise in the data set will also have a certain influence on the classification result.


## 3.1. Facial Feature Localization Algorithm

An active shape model mainly studies the contour of the target object, such as face, hands, heart, lungs, and other objects with little change in the individual shape. The building of active shape model is divided into two parts: training and image matching. The first part is the training part of the model, which needs to find enough target object images as training samples, predetermine the number and position of the required feature points, manually mark the target feature points on each training sample, and obtain its target vector. Then, the target vector set obtained from the training sample is statistically analyzed, normalized by the principal component analysis method, and the average shape vector of the training set is obtained as the initial shape, and the change direction of each point in the shape vector is limited. After the training, the target image is matched for the matching part of the image. The trained initial shape is overlapped with the target image by scaling, rotation, and translation, and the position of each point is optimized and adjusted according to the local grayscale model. The optimal position of each point is searched by the iterative method and finally converges to the shape vector corresponding to the target shape. The specific calculation process of the active shape model [10] is shown in Figure 3.Figure 3
Calculation flow of the active shape model.Human face is a kind of unstructured object with complex detail changes, which makes the traditional detection methods based on the facial skin color and shape characteristics cannot be well adapted to the changes of complex environment [11]. Among numerous research algorithms, the positioning algorithm represented by machine learning is based on a large number of data samples, and the internal relationship of the data is mined through certain learning methods, so that the learning model can still show good learning and reasoning ability in the face of complex environmental changes. Therefore, facial feature localization is considered from the perspective of machine learning. SIFT feature values of facial feature points were optimized by the supervised descent algorithm to build a prediction model of facial feature points. The algorithm model is shown in the following formula [12]:(1)fx0+Δx=hdx0+Δx−ϕ22,where, dx is the index value of marked feature points, 68 feature points are selected to mark facial feature positions, and dx∈R68×1 (R68×1 is the index matrix of feature points. hx is nonlinear feature extraction function, representing SIFT feature values of facial feature points. For the 128-dimensional SIFT feature, hdx∈R128×68. In the training, x∗ is the known labeled feature points in the sample database, ϕ∗=hdx∗ is the eigenvalue of labeled feature points, ϕ∗∈R128×68; x0 is the initialization feature point.The model can be regarded as minimizing equation (1) by finding the gradient direction Δx of the feature point. In the process of model training, for the general Newton iteration method, the initial convergence of the feature point x0 to the marked feature point x∗ is only required by obtaining a series of gradient descent directions and updating the scaling coefficient Δxk+1=xk+Δxk. Assuming the second derivative of feature extraction function hx , equation (1) is expanded by the second order Taylor formula to obtain the following equation [13]:(2)fx0+Δx≈fx0+Jfx0TΔx+12ΔxTHx0Δx,where Jfx0, Hx0 are the Hessian and Jacobian matrices of the model at the initial facial feature points. Formula (3) can be obtained by taking the derivative of fx0+Δx=0 against Δx in formula (2).(3)Δx=−H−1Jf=−2H−1JfTϕ0−ϕ∗,where Jf=2JfTϕ0−ϕ∗: let R0=−2H−1JfT, then Δx=R0ϕ0−ϕ∗. In this process, the calculation of R0 will inevitably involve the calculation of Hessian and Jacobian matrices, which will lead to the increase of computational complexity and the existence of strong constraints. Therefore, the supervised descent algorithm is adopted to learn R0 directly through the training data set, as shown in the following equation:(4)Δx=R0ϕ0+b0,where b0 is the offset term, and the training process is as follows:(1)
A set of training set picturedi and corresponding labeled feature point set x∗iwere given, the average facial feature point shape was calculated by normalizing the training sample [14, 15].(2)
A face detection classifier was used to locate the faces of the training samples, and the average facial feature point shape was used to initialize the facial feature pointx0i.(3)
The first descent directionR0 and deviation term b0 were calculated, as shown in the following formula:(5)argminR0,b0∑di∑x0iΔx∗i−R0ϕ0i−b02,x∗i=x∗i−x0i, ϕ0i=hdix0i is the eigenvalue of the initial facial feature point of the image of the ith training sample.(4)
The feature pointxi is updated for the first time, as shown in the following equation:(6)x1=x0+R0ϕ0+b0.(5)
Steps (3) to (4) are repeated until equation (1) converges.In model training,k−1 descent direction Rk−1 and deviation bk−1 are calculated as shown in equation (7). The k update calculation of feature point xi is shown in equation (8).(7)argminRk,bk∑di∑xkiΔx∗k−1i−Rk−1ϕk−1i−bk−12,(8)xk=xk−1+Rk−1ϕk−1+bk−1.LFPW database was used for model training [16].


## 3.2. Extraction of Fatigue Eigenvalues

Numerous studies have shown that yawning, frequent nods, and increased blinking occur when the body is tired. Therefore, on the basis of facial feature localization, blink frequency, yawn frequency, and nod frequency were selected as fatigue characteristic values. Firstly, the state judgment of blinking, yawning, and nodding was analyzed [17], taking blinking judgment as an example, as shown in Figure 4.Figure 4
Diagram of the eye height-to-width ratio.The eye aspect ratioeh/ew was selected as the condition for blinking judgment. When eh/ew≤et , it was closed, otherwise, it was open, where, et is the judgment threshold of open and close eyes. Yawning is similar to blinking. Head pose estimation. A head pose model was established to predict the head pose pk by using the supervised descent algorithm based on the head pose described in the literature. Similar to blinking judgment, when pk≥nt is the nodding state, otherwise, it is the normal state (nt is the threshold of nodding judgment) [18].


## 3.3. Design of a Simple Bayesian Classifier

Classification is an important research content in machine learning, pattern recognition, artificial intelligence, and other fields. Many problems in real life can be essentially classified, such as risk prediction, medical diagnosis, spam, fraud detection, and so on. Classification requires learning to produce an objective function (called a classifier or a classification model) that assigns a sample described by an attribute set to a class tag. A classification problem is a two-stage process [19], including the learning stage and the classification stage. In the first stage, the classification algorithm constructs the classification model by analyzing the learning and training data set. The training set consists of tuple data and class tags are associated with it. In the second stage, the classification model constructed by learning is used to classify and predict the sample set with an unknown class label. In general, it is necessary to evaluate the performance of the classifier before using the model for classification. Only the classifier whose performance evaluation indexes meet the specified requirements can be used to classify unknown sample sets.Due to the excessive optimization effect of the learning algorithm on the training set, the classification model derived from the training set may not be the best, which may mistakenly lead to overoptimistic values of some indexes used to evaluate the model, and researchers are eager to obtain the model with the best classification performance. Therefore, it is very important to compare the performance of different classifiers applied in the same field by calculating evaluation criteria on the test set.The naive Bayes classifier is based on Bayesian theory, which assumes that conditions are independent among variables and classifies samples by obtaining a posterior probability that they belong to a certain category [20]. The judgment of driving fatigue is regarded as a dichotomous problem. Given sample characteristics, x=x1,x2,x3, x1 are blink frequency, x2 are yawn frequency, and 4 x3 are nod frequency. The posterior probability distribution of samples is calculated, and the class with the highest posterior probability is taken as the class of x. The posterior probability can be calculated into the following equation,according to the Bayes formula:(9)pY=ckX=x=pX=xY=ckpY=ck∑kpX=xY=ckpY=ck,where, X is the input feature set, x∈X; Y is the category set, Y∈c1,c2,…,ck,k=1,2,c1=1 indicates normal driving condition, c2=−1 is the fatigue driving state. Formula (10) can be obtained by expanding formula (9) with the full probability formula.(10)pY=ckX=x=pY=ck∏jpXj=xj|Y=ck∑kpY=ck∏jpXj=xj|Y=ck.According to equation (10), the naive Bayes classifier is established in the following equation:(11)y=fx=argmaxckpY=ck∏jpXj=xjY=ck∑kpY=ck∏jpXj=xjY=ck.Since the denominator in equation (11) is the same for all CK, the classifier can be further simplified into the following equation:(12)y=fx=argmaxckPY=ck∏jpXj=xjY=ck.The advantage of the naive Bayes classifier is that the logic of the algorithm is relatively simple and easy to implement. The time and space cost of algorithm implementation is small. It has a stable performance [21], and has little difference in the classification effect for data sets with different data characteristics, that is, the model has good robustness. Naive Bayes classification is not to absolutely assign a sample to a class, but to calculate the posterior probability of the sample belonging to each class, and then map the sample to the class with the maximum posterior probability. And generally, all attributes are in the naive Bayes classifier. In the classification process, all attributes play a direct or indirect role, that is, all attributes participate in the classification, instead of simply deciding the result by one or a few attributes. Although the independence of class conditions between attributes is difficult to be satisfied in practice, it still has a good classification performance, mainly for the following reasons: a relatively few parameter estimates ensure the stability of the estimates. Although the estimated probabilities are biased, the classification principle is based on the order of posterior probabilities, so even if there is a slight deviation in the classification process, it does not matter. In general, data preprocessing is carried out in the early stage of modeling, during which highly correlated variables may be screened, etc., which also improves the data quality for classification to a certain extent.A naive Bayes classifier also has some defects, and it is difficult to satisfy the hypothesis of class condition independence between attributes in practical application. If the conditional attributes in the data set are highly correlated, it is difficult to achieve the expected classification effect by using the naive Bayes classifier directly. On the other hand, when the data set is incomplete or there is extremely unbalanced data, the deviation of the posterior probability of individual attributes may be large, and the final classification result may be inaccurate. In addition, the quasi-prior probability and quasi-conditional probability needed to be calculated in the classification process of this model are estimated by using the training set, and then the class label of unknown samples is specified according to the formula. Therefore, the noise in the data set will also have a certain influence on the classification result.


## 4. Results Analysis

In order to verify the feasibility of the algorithm, several videos of drivers’ normal driving and fatigue driving were collected to verify the algorithm.Blink frequency, yawn frequency, nod frequency, and other characteristic values in the video of driver fatigue and normal state were counted in the experiment. Firstly, a sample in the driving process was used to illustrate the selection process of positive and negative samples in classifier training, as shown in Figure5. In the part shown, the driver is in the normal driving state, in which the yawn and nod frequency is 0, and the blink frequency is between 0 and 0.06. At this time, the driver is focused and has a good sense of control of the vehicle. In the part, when the driver appeared mild fatigue, he began to yawn and blink frequently. The yawning frequency and blink frequency increased, and the driver appeared distraction phenomenon at this time. With the further deepening of the fatigue degree, in some parts, the driver began to nod, eyes closed for a long time, and other phenomena, at this time, the driver has entered the severe fatigue state, completely lost the consciousness of controlling the vehicle.Figure 5
Sample frequency values.Therefore, according to the value changes of blink frequency, yawn frequency, and nod frequency in the normal state and the fatigue state of the driver [22], corresponding positive and negative samples can be made for training and testing of the naive Bayes classifier. During the experiment, a total of 1520 samples were selected, of which 740 were positive samples (normal driving); 780 negative samples (fatigue driving) [23]. In the training and testing of the naive Bayes classifier, there are 910 training samples, 610 test samples, 30 misclassification numbers, and the classifier accuracy rate is 95.08%, as shown in Table 1 [24].Table 1
Naive Bayes classifier test.
The total number of samplesNumber of training samplesNumber of test samplesNumber of samples incorrectly checkedAccuracy rate (%)15209106103095.08In order to further verify the performance of the naive Bayesian classifier in actual driving, two sample videos were selected for testing in the driver’s operating environment, and the test results are shown in Table2. In video sample 1, a total of 19 times of driver fatigue were detected, including 1 misjudgment with an accuracy of 94.74%; in video sample 2, a total of 20 times of driver fatigue were detected, including 1 misjudgment with an accuracy of 95.00% [25].Table 2
Actual driving environment test.
Test parametersTest video 1Test video 2Total video frames685714Eyes closing frames40772Yawn frames80104Nod frames12472Testing number1920Number of mistakes11Accuracy rate (%)94.7495.00Average accuracy (%)94.87


## 5. Conclusion

(1)
The supervised descent algorithm model is used to locate multiple facial features of drivers, and on the basis of which multiple eigenvalues reflecting the driver fatigue state are extracted to establish the corresponding positive and negative sample data.(2)
The naive Bayes classifier is trained to be used to warn drivers whether they are driving fatigue or not, and the average accuracy is 94.87% in the actual driving test.(3)
The algorithm only discriminates the fatigue state based on facial features, and more factors, such as driver attention, physiological state, weather, and vehicle driving condition, should be further considered in the subsequent work.



---

*Source: 8266295-2022-06-30.xml*