In order to avoid traffic accidents caused by driver fatigue, smoking and talking on the phone, it is necessary to design an effective fatigue detection algorithm. Firstly, this paper studies the detection algorithms of driver fatigue at home and abroad, and analyzes the advantages and disadvantages of the existing algorithms. Secondly, a face recognition module is introduced to crop and align the acquired faces and input them into the Facenet network model for feature extraction, thus completing the identification of drivers. Thirdly, a new driver fatigue detection algorithm based on deep learning is designed based on Single Shot MultiBox Detector (SSD) algorithm, and the additional layer network structure of SSD is redesigned by using the idea of reverse residual. By adding the detection of drivers' smoking and making phone calls, adjusting the size and number of prior boxes of SSD algorithm, improving FPN network and SE network, the identification and verification of drivers can be realized. The experimental results showed that the number of parameters decreased from 96.62 MB to 18.24 MB. The average accuracy rate increased from 89.88% to 95.69%. The projected number of frames per second increased from 51.69 to 71.86. When the confidence threshold was set to 0.5, the recall rate of closed eyes increased from 46.69% to 65.87%, that of yawning increased from 59.72% to 82.72%, and that of smoking increased from 65.87% to 83.09%. These results show that the improved network model has better feature extraction ability for small targets.
Citation: Yuhua Ma, Ye Tao, Yuandan Gong, Wenhua Cui, Bo Wang. Driver identification and fatigue detection algorithm based on deep learning[J]. Mathematical Biosciences and Engineering, 2023, 20(5): 8162-8189. doi: 10.3934/mbe.2023355
[1] | Jagan Mohan Jonnalagadda . On a nabla fractional boundary value problem with general boundary conditions. AIMS Mathematics, 2020, 5(1): 204-215. doi: 10.3934/math.2020012 |
[2] | Lakhdar Ragoub, J. F. Gómez-Aguilar, Eduardo Pérez-Careta, Dumitru Baleanu . On a class of Lyapunov's inequality involving λ-Hilfer Hadamard fractional derivative. AIMS Mathematics, 2024, 9(2): 4907-4924. doi: 10.3934/math.2024239 |
[3] | Wei Zhang, Jifeng Zhang, Jinbo Ni . New Lyapunov-type inequalities for fractional multi-point boundary value problems involving Hilfer-Katugampola fractional derivative. AIMS Mathematics, 2022, 7(1): 1074-1094. doi: 10.3934/math.2022064 |
[4] | Jaganmohan Jonnalagadda, Basua Debananda . Lyapunov-type inequalities for Hadamard type fractional boundary value problems. AIMS Mathematics, 2020, 5(2): 1127-1146. doi: 10.3934/math.2020078 |
[5] | Shuqin Zhang, Lei Hu . The existence of solutions and generalized Lyapunov-type inequalities to boundary value problems of differential equations of variable order. AIMS Mathematics, 2020, 5(4): 2923-2943. doi: 10.3934/math.2020189 |
[6] | Dumitru Baleanu, Muhammad Samraiz, Zahida Perveen, Sajid Iqbal, Kottakkaran Sooppy Nisar, Gauhar Rahman . Hermite-Hadamard-Fejer type inequalities via fractional integral of a function concerning another function. AIMS Mathematics, 2021, 6(5): 4280-4295. doi: 10.3934/math.2021253 |
[7] | Jonas Ogar Achuobi, Edet Peter Akpan, Reny George, Austine Efut Ofem . Stability analysis of Caputo fractional time-dependent systems with delay using vector lyapunov functions. AIMS Mathematics, 2024, 9(10): 28079-28099. doi: 10.3934/math.20241362 |
[8] | Chantapish Zamart, Thongchai Botmart, Wajaree Weera, Prem Junsawang . Finite-time decentralized event-triggered feedback control for generalized neural networks with mixed interval time-varying delays and cyber-attacks. AIMS Mathematics, 2023, 8(9): 22274-22300. doi: 10.3934/math.20231136 |
[9] | Yitao Yang, Dehong Ji . Properties of positive solutions for a fractional boundary value problem involving fractional derivative with respect to another function. AIMS Mathematics, 2020, 5(6): 7359-7371. doi: 10.3934/math.2020471 |
[10] | Tingting Guan, Guotao Wang, Haiyong Xu . Initial boundary value problems for space-time fractional conformable differential equation. AIMS Mathematics, 2021, 6(5): 5275-5291. doi: 10.3934/math.2021312 |
In order to avoid traffic accidents caused by driver fatigue, smoking and talking on the phone, it is necessary to design an effective fatigue detection algorithm. Firstly, this paper studies the detection algorithms of driver fatigue at home and abroad, and analyzes the advantages and disadvantages of the existing algorithms. Secondly, a face recognition module is introduced to crop and align the acquired faces and input them into the Facenet network model for feature extraction, thus completing the identification of drivers. Thirdly, a new driver fatigue detection algorithm based on deep learning is designed based on Single Shot MultiBox Detector (SSD) algorithm, and the additional layer network structure of SSD is redesigned by using the idea of reverse residual. By adding the detection of drivers' smoking and making phone calls, adjusting the size and number of prior boxes of SSD algorithm, improving FPN network and SE network, the identification and verification of drivers can be realized. The experimental results showed that the number of parameters decreased from 96.62 MB to 18.24 MB. The average accuracy rate increased from 89.88% to 95.69%. The projected number of frames per second increased from 51.69 to 71.86. When the confidence threshold was set to 0.5, the recall rate of closed eyes increased from 46.69% to 65.87%, that of yawning increased from 59.72% to 82.72%, and that of smoking increased from 65.87% to 83.09%. These results show that the improved network model has better feature extraction ability for small targets.
The well-known classical Lyapunov inequality [15] states that, if u is a nontrivial solution of the Hill's equation
u′′(t)+q(t)u(t)=0, a<t<b, | (1.1) |
subject to Dirichlet-type boundary conditions:
u(a)=u(b)=0, | (1.2) |
then
∫ba|q(t)|dt>4b−a, | (1.3) |
where q:[a,b]→R is a real and continuous function.
Later, in 1951, Wintner [24], obtained the following inequality:
∫baq+(t)dt>4b−a, | (1.4) |
where q+(t)=max{q(t),0}.
A more general inequality was given by Hartman and Wintner in [12], that is known as Hartman Wintner-type inequality:
∫ba(t−a)(b−t)q+(t)dt>b−a, | (1.5) |
Since maxt∈[a,b](t−a)(b−t)=(b−a)24, then, (1.5) implies (1.4).
The Lyapunov inequality and its generalizations have many applications in different fields such in oscillation theory, asymptotic theory, disconjugacy, eigenvalue problems.
Recently, many authors have extended the Lyapunov inequality (1.3) for fractional differential equations [1,2,3,4,5,6,7,8,9,10,11,12,13,15,18,20,22,23,24]. For this end, they substituted the ordinary second order derivative in (1.1) by a fractional derivative or a conformable derivative. The first result in which a fractional derivative is used instead of the ordinary derivative in equation (1.1), is the work of Ferreira [6]. He considered the following two-point Riemann-Liouville fractional boundary value problem
Dαa+u(t)+q(t)u(t)=0, a<t<b, 1<α≤2 |
u(a)=u(b)=0. |
And obtained the Lyapunov inequality:
∫ba|q(t)|dt>Γ(α)(4b−a)α−1. |
Then, he studied in [7], the Caputo fractional differential equation
CDαa+u(t)+q(t)u(t)=0, a<t<b, 1<α≤2 |
under Dirichlet boundary conditions (1.2). In this case, the corresponding Lyapunov inequality has the form
∫ba|q(t)|dt>ααΓ(α)((α−1)(b−a))α−1. |
Later Agarwal and Özbekler in [1], complimented and improved the work of Ferreira [6]. More precisely, they proved that if u is a nontrivial solution of the Riemann-Liouville fractional forced nonlinear differential equations of order α∈(0,2]:
Dαa+u(t)+p(t)|u(t)|μ−1u(t)+q(t)|u(t)|γ−1u(t)=f(t), a<t<b, |
satisfying the Dirichlet boundary conditions (1.2), then the following Lyapunov type inequality
(∫ba[p+(t)+q+(t)]dt)(∫ba[μ0p+(t)+γ0q+(t)+|f(t)|]dt)>42α−3Γ2(α)(b−a)2α−2. |
holds, where p, q, f are real-valued functions, 0<γ<1<μ<2, μ0=(2−μ)μμ/(2−μ)22/(μ−2) and γ0=(2−γ)γγ/(2−γ)22/(γ−2).
In 2017, Guezane-Lakoud et al. [11], derived a new Lyapunov type inequality for a boundary value problem involving both left Riemann-Liouville and right Caputo fractional derivatives in presence of natural conditions
−CDαb−Dβa+u(t)+q(t)u(t)=0, a<t<b, 0<α,β≤1 |
u(a)=Dβa+u(b)=0, |
then, they obtained the following Lyapunov inequality:
∫ba|q(t)|dt>(α+β−1)Γ(α)Γ(β)(b−a)α+β−1. |
Recently, Ferreira in [9], derived a Lyapunov-type inequality for a sequential fractional right-focal boundary value problem
CDαa+Dβa+u(t)+q(t)u(t)=0, a<t<b |
u(a)=Dγa+u(b)=0, |
where 0<α,β,γ≤1, 1<α+β≤2, then, they obtained the following Lyapunov inequality:
∫ba(b−s)α+β−γ−1|q(t)|dt>1C, |
where
C=(b−a)γmax{Γ(β−γ+1)Γ(α+β−γ)Γ(β+1),1−αβΓ(α+β)(Γ(β−γ+1)Γ(α+β−1)Γ(α+β−γ)Γ(β))α+β−1α−1, with α<1} |
Note that more generalized Lyapunov type inequalities have been obtained for conformable derivative differential equations in [13]. For more results on Lyapunov-type inequalities for fractional differential equations, we refer to the recent survey of Ntouyas et al. [18].
In this work, we obtain Lyapunov type inequality for the following mixed fractional differential equation involving both right Caputo and left Riemann-Liouville fractional derivatives
−CDαb−Dβa+u(t)+q(t)u(t)=0, a<t<b, | (1.6) |
satisfying the Dirichlet boundary conditions (1.2), here 0<β≤α≤1, 1<α+β≤2, CDαb− denotes right Caputo derivative, Dβa+ denotes the left Riemann-Liouville and q is a continuous function on [a,b].
So far, few authors have considered sequential fractional derivatives, and some Lyapunov type inequalities have been obtained. In this study, we place ourselves in a very general context, in that in each fractional operator, the order of the derivative can be different. Such problems, with both left and right fractional derivatives arise in the study of Euler-Lagrange equations for fractional problems of the calculus of variations [2,16,17]. However, the presence of a mixed left and right Caputo or Riemann-Liouville derivatives of order 0<α<1 leads to great difficulties in the study of the properties of the Green function since in this case it's given as a fractional integral operator.
We recall the concept of fractional integral and derivative of order p>0. For details, we refer the reader to [14,19,21]
The left and right Riemann-Liouville fractional integral of a function g are defined respectively by
Ipa+g(t)=1Γ(p)∫tag(s)(t−s)1−pds,Ipb−g(t)=1Γ(p)∫btg(s)(s−t)1−pds. |
The left and right Caputo derivatives of order p>0, of a function g are respectively defined as follows:
CDpa+g(t)=In−pa+g(n)(t),CDpb−g(t)=(−1)nIn−pb−g(n)(t), |
and the left and right Riemann-Liouville fractional derivatives of order p>0, of a function g\ are respectively defined as follows:
Dpa+g(t)=dndtn(In−pa+g)(t),Dpb−g(t)=(−1)ndndtnIn−pb−g(t), |
where n is the smallest integer greater or equal than p.
We also recall the following properties of fractional operators. Let 0<p<1, then:
1- IpCa+Dpa+f(t)=f(t)−f(a).
2- IpCb−Dpb−f(t)=f(t)−f(b).
3- (Ipa+c)(t)=c(t−a)pΓ(p+1),c∈R
4- Dpa+u(t)=CDpa+u(t), when u(a)=0.
5- Dpb−u(t)=CDpb−u(t), when u(b)=0.
Next we transform the problem (1.6) with (1.2) to an equivalent integral equation.
Lemma 1. Assume that 0<α,β≤1. The function u is a solution to the boundary value problem (1.6) with (1.2) if and only if u satisfies the integral equation
u(t)=∫baG(t,r)q(r)u(r)dr, | (2.1) |
where
G(t,r)=1Γ(α)Γ(β)(∫inf{r,t}a(t−s)β−1(r−s)α−1ds |
−(t−a)β(b−a)β∫ra(b−s)β−1(r−s)α−1ds) | (2.2) |
is the Green's function of problem (1.6) with (1.2).
Proof. Firstly, we apply the right side fractional integral Iαb− to equation (1.6), then the left side fractional integral Iβa+ to the resulting equation and taking into account the properties of Caputo and\Riemann-Liouville fractional derivatives and the fact that Dβa+u(t)=CDβa+u(t), we get
u(t)=Iβa+Iαb−q(t)u(t)+c(t−a)βΓ(β+1). | (2.3) |
In view of the boundary condition u(b)=0, we get
c=−Γ(β+1)(b−a)βIβa+Iαb−q(t)u(t)∣t=b. |
Substituting c in (2.3), it yields
u(t)=Iβa+Iαb−q(t)u(t)−(t−a)β(b−a)βIβa+Iαb−q(t)u(t)∣t=b=1Γ(α)Γ(β)∫ta(t−s)β−1(∫bs(r−s)α−1q(r)u(r)dr)ds−(t−a)βΓ(α)Γ(β)(b−a)β∫ba(b−s)β−1(∫bs(r−s)α−1q(r)u(r)dr)ds. |
Finally, by exchanging the order of integration, we get
u(t)=1Γ(α)Γ(β)∫ta(∫ra(t−s)β−1(r−s)α−1ds)q(r)u(r)dr+1Γ(α)Γ(β)∫bt(∫ta(t−s)β−1(r−s)α−1ds)q(r)u(r)dr−(t−a)βΓ(α)Γ(β)(b−a)β∫ba(∫ra(b−s)β−1(r−s)α−1ds)q(r)u(r)dr, |
thus
u(t)=∫baG(t,r)q(r)u(r)dr, |
with
G(t,r)=1Γ(α)Γ(β){∫ra(t−s)β−1(r−s)α−1ds−(t−a)β(b−a)β∫ra(b−s)β−1(r−s)α−1ds,a≤r≤t≤b,∫ta(t−s)β−1(r−s)α−1ds−(t−a)β(b−a)β∫ra(b−s)β−1(r−s)α−1ds,a≤t≤r≤b. |
that can be written as
G(t,r)=1Γ(α)Γ(β)(∫inf{r,t}a(t−s)β−1(r−s)α−1ds−(t−a)β(b−a)β∫ra(b−s)β−1(r−s)α−1ds). |
Conversely, we can verify that if u satisfies the integral equation (2.1), then u is a solution to the boundary value problem (1.6) with (1.2). The proof is completed.
In the next Lemma we give the property of the Green function G that will be needed in the sequel.
Lemma 2. Assume that 0<β≤α≤1,1<α+β≤2, then the Green function G(t,r) given in (2.2) of problem (1.6) with (1.2) satisfies the following property:
|G(t,r)|≤1Γ(α)Γ(β)(α+β−1)(α+β)(α(b−a)(β+α))α+β−1, |
for all a≤r≤t≤b.
Proof. Firstly, for a≤r≤t≤b, we have G(t,r)≥0. In fact, we have
G(t,r)=1Γ(α)Γ(β)(∫ra(t−s)β−1(r−s)α−1ds−(t−a)β(b−a)β∫ra(b−s)β−1(r−s)α−1ds)≥1Γ(α)Γ(β)(∫ra(b−s)β−1(r−s)α−1ds−(t−a)β(b−a)β∫ra(b−s)β−1(r−s)α−1ds) |
=1Γ(α)Γ(β)(1−(t−a)β(b−a)β)∫ra(b−s)β−1(r−s)α−1ds≥0 | (2.4) |
in addition,
G(t,r)≤1Γ(α)Γ(β)(∫ra(r−s)β−1(r−s)α−1ds−(r−a)β(b−a)β∫ra(b−s)β−1(r−s)α−1ds)≤1Γ(α)Γ(β)((r−a)α+β−1(α+β−1)−(r−a)β(b−a)β∫ra(b−a)β−1(r−s)α−1ds) |
=1Γ(α)Γ(β)((r−a)α+β−1(α+β−1)−(r−a)β+αα(b−a)). | (2.5) |
Thus, from (2.4) and (2.5), we get
0≤G(t,r)≤h(r), a≤r≤t≤b, | (2.6) |
where
h(s):=1Γ(α)Γ(β)((s−a)α+β−1(α+β−1)−(s−a)β+αα(b−a)), |
it is clear that h(s)≥0, for all s∈[a,b].
Now, for a≤t≤r≤b, we have
G(t,r)=1Γ(α)Γ(β)(∫ta(t−s)β−1(r−s)α−1ds−(t−a)β(b−a)β∫ra(b−s)β−1(r−s)α−1ds)≤1Γ(α)Γ(β)(∫ta(t−s)β−1(t−s)α−1ds−(t−a)β(b−a)∫ra(r−s)α−1ds)=1Γ(α)Γ(β)((t−a)α+β−1(α+β−1)−(t−a)β(r−a)αα(b−a)) |
≤1Γ(α)Γ(β)((t−a)α+β−1(α+β−1)−(t−a)β+αα(b−a))=h(t). | (2.7) |
On the other hand,
G(t,r)≥1Γ(α)Γ(β)(r−a)α−1∫ta(t−s)β−1ds−(t−a)β(b−a)β∫ra(r−s)β−1(r−s)α−1ds)≥1Γ(α)Γ(β)((t−a)α(t−a)ββ(b−a)−(t−a)β(b−a)β(r−a)α+β−1(α+β−1))≥1Γ(α)Γ(β)((t−a)α+ββ(b−a)−(t−a)β(r−a)α−1(α+β−1))≥1Γ(α)Γ(β)((t−a)α+ββ(b−a)−(t−a)α+β−1(α+β−1)), |
since β≤α, we get
G(t,r)≥−h(t), a≤t≤r≤b. | (2.8) |
From (2.7) and (2.8) we obtain
|G(t,r)|≤h(t), a≤t≤r≤b. | (2.9) |
Finally, by differentiating the function h, it yields
h′(s)=1Γ(α)Γ(β)(s−a)α+β−2(1−(β+α)(s−a)α(b−a)). |
We can see that h′(s)=0 for s0=a+α(b−a)(β+α)∈(a,b), h′(s)<0 for s>s0 and h′(s)>0 for s<s0. Hence, the function h(s) has a unique maximum given by
maxs∈[a,b]h(s)=h(s0)=1Γ(α)Γ(β)((α(b−a)(β+α))α+β−1(α+β−1)−(α(b−a)(β+α))β+αα(b−a))=1Γ(α)Γ(β)(α+β−1)(α+β)(α(b−a)(β+α))α+β−1. |
From (2.6) and (2.9), we get |G(t,r)|≤h(s0), from which the intended result follows.
Next, we state and prove the Lyapunov type inequality for problem (1.6) with (1.2).
Theorem 3. Assume that 0<β≤α≤1 and 1<α+β≤2. If the fractional boundary value problem (1.6) with (1.2) has a nontrivial continuous solution, then
∫ba|q(r)|dr≥Γ(α)Γ(β)(α+β−1)(α+β)α+β(α(b−a))α+β−1. | (2.10) |
Proof. Let X=C[a,b] be the Banach space endowed with norm ||u||=maxt∈[a,b]|u(t)|. It follows from Lemma 1 that a solution u∈X to the boundary value problem (1.6) with (1.2) satisfies
|u(t)|≤∫ba|G(t,r)||q(r)||u(r)|dr≤‖u‖∫ba|G(t,r)|q(r)dr, |
Now, applying Lemma 2 to equation (2.1), it yields
|u(t)|≤1Γ(α)Γ(β)(α+β−1)(α+β)(α(b−a)(β+α))α+β−1‖u‖∫ba|q(r)|dr |
Hence,
‖u‖≤(α(b−a))α+β−1Γ(α)Γ(β)(α+β−1)(α+β)α+β‖u‖∫ba|q(r)|dr, |
from which the inequality (2.10) follows. Note that the constant in (2.10) is not sharp. The proof is completed.
Remark 4. Note that, according to boundary conditions (1.2), the Caputo derivatives CDαb− and CDβa+ coincide respectively with the Riemann-Liouville derivatives Dαb− and Dβa+. So, equation (1.6) is reduced to the one containing only Caputo derivatives or only Riemann-Liouville derivatives, i.e.,
−CDαCb−Dβa+u(t)+q(t)u(t)=0, a<t<b |
or
−Dαb−Dβa+u(t)+q(t)u(t)=0, a<t<b |
Furthermore, by applying the reflection operator (Qf)(t)=f(a+b−t) and taking into account that QCDαa+=CDαb−Q and QCDβb−=CDβa+Q (see [21]), we can see that, the boundary value problem (1.6) with (1.2) is equivalent to the following problem
−CDαa+Dβb−u(t)+q(t)u(t)=0, a<t<b, |
u(a)=u(b)=0. |
Remark 5. If we take α=β=1, then the Lyapunov type inequality (2.3) is reduced to
∫ba|q(t)|dt≥4b−a. |
The authors thank the anonymous referees for their valuable comments and suggestions that improved this paper.
All authors declare no conflicts of interest in this paper.
[1] |
D. Shi, C. Sun, X. Sheng, X. Bi, Design of monitoring system for driving safety based on convolutional neural network, J. Hebei North Univ., 36 (2020), 57–61. https://doi.org/10.3969/j.issn.1673-1492.2020.09.011 doi: 10.3969/j.issn.1673-1492.2020.09.011
![]() |
[2] |
X. Meng, Driving fatigue caused by tramc accident characteristics and effective prevention analysis, Logist. Eng. Manage., 8 (2014), 187–188. https://doi.org/10.3969/j.issn.1674-4993.2014.08.073 doi: 10.3969/j.issn.1674-4993.2014.08.073
![]() |
[3] |
X. Gong, J. Fang, X. Tan, A. Liao, C. Xiao, Analysis of the current situation of road traffic accidents in the 31 provinces/municipalities of China and the projection for achieving the SDGs target of halving the numbers of death and injury, Chin. J. Dis. Control Prev., 24 (2020), 4–8. http://doi.org/10.16462/j.cnki.zhjbkz.2020.01.002 doi: 10.16462/j.cnki.zhjbkz.2020.01.002
![]() |
[4] |
S. Chen, J. Hu, Causative analysis of road traffic accidents and research on safety prevention measures, Leg. Syst. Soc., 27 (2020), 143–144. https://doi.org/10.19387/j.cnki.1009-0592.2020.09.247 doi: 10.19387/j.cnki.1009-0592.2020.09.247
![]() |
[5] |
J. Wang, X. Yu, Q. Liu, Y. Zhou, Research on key technologies of intelligent transportation based on image recognition and anti-fatigue driving, EURASIP J. Image Video Process., 1 (2019), 33–45. https://doi.org/10.1186/s13640-018-0403-6 doi: 10.1186/s13640-018-0403-6
![]() |
[6] |
X. Wang, R. Chen, B. Huang, Implementation of driver driving safety monitoring system based on android system, Electron. Meas. Technol., 42 (2019), 56–60. https://doi.org/10.19651/j.cnki.emt.1802406 doi: 10.19651/j.cnki.emt.1802406
![]() |
[7] |
S. Liu, L. He, Fatigue driving detection system based on image processing, J. Yuncheng Univ., 39 (2021), 51–54. https://doi.org/10.15967/j.cnki.cn14-1316/g4.2021.06.013 doi: 10.15967/j.cnki.cn14-1316/g4.2021.06.013
![]() |
[8] |
F. Liu, D. Chen, J. Zhou, F. Xu, A review of driver fatigue detection and its advances on the use of RGB-D camera and deep learning, Eng. Appl. Artif. Intell., 116 (2022), 105399. https://doi.org/10.1016/j.engappai.2022.105399 doi: 10.1016/j.engappai.2022.105399
![]() |
[9] |
Y. Sui, Z. Yan, L. Dai. H. Jing, Face multi-attribute detection algorithm based on RetinaFace, Railway Comput. Appl., 30 (2021), 1–4. https://doi.org/10.3969/j.issn.1005-8451.2021.03.001 doi: 10.3969/j.issn.1005-8451.2021.03.001
![]() |
[10] | S. Yang, P. Luo, C. C. Loy, X. Tang, Wider face: a face detection benchmark, in 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2016), 5525–5533. https://doi.org/10.1109/CVPR.2016.596 |
[11] |
G. M. Clayton, S. Devasia, Image-based compensation of dynamic effects in scanning tunnelling microscopes, Nanotechnology, 16 (2005), 809–818. https://doi.org/10.1088/0957-4484/16/6/032 doi: 10.1088/0957-4484/16/6/032
![]() |
[12] |
L. Huang, H. Yang, B. Wang, Research and improvement of multi-method combined face image illumination compensation algorithm, J. Chongqing Univ. Technol., 31 (2017), 6–12. https://doi.org/10.3969/j.issn.1674-8425(z).2017.11.027 doi: 10.3969/j.issn.1674-8425(z).2017.11.027
![]() |
[13] |
L. Shao, R. Yan, X. Li, Y. Liu, From heuristic optimization to dictionary learning: A review and comprehensive comparison of Image denoising algorithms, IEEE Trans. Cybern., 44 (2017), 1001–1013. https://doi.org/10.1109/TCYB.2013.2278548 doi: 10.1109/TCYB.2013.2278548
![]() |
[14] |
C. Shi, C. Zhang, Q. He, H. Wang, Target detection based on improved feature pyramid, Electron. Meas. Technol., 44 (2021), 150–156. https://doi.org/10.19651/j.cnki.emt.2107598 doi: 10.19651/j.cnki.emt.2107598
![]() |
[15] | X. Guo, Research on Multi-Scale Face Detection Based on Convolution Neural Networks, M.S thesis, North China Electric Power University in Hebei, 2020. |
[16] | F. Chen, Research on Cosine Loss Algorithm for Face Verification, M.S thesis, Xiangtan University in Hunan, 2020. https://doi.org/10.27426/d.cnki.gxtdu.2020.001269 |
[17] |
Z. Yang, L. Hou, D. Yang, lmproved face recognition algorithm of attitude correction, Cyber Secur. Data Governance, 35 (2016), 56–60. https://doi.org/10.19358/j.issn.1674-7720.2016.03.019 doi: 10.19358/j.issn.1674-7720.2016.03.019
![]() |
[18] | S. Preetha, S. V. Sheela, Security monitoring system using facenet for wireless sensor network, preprint, arXiv: 2112.01305. |
[19] | X. Li, R. Huang, Z. Chen, Y. Long, L. Xu, An improved face detection and recognition algorithm based on FaceNet and MTCNN, J. Guangdong Univ. of Petrochem. Technol., 31 (2021), 45–47. |
[20] |
J. Wang, J. Li, X. Zhou, X. Zhang, Improved SSD algorithm and its performance analysis of small target detection in remote sensing images, Acta Opt. Sin. 39 (2019), 10. https://doi.org/10.3788/AOS201939.0628005 doi: 10.3788/AOS201939.0628005
![]() |
[21] | S. Mao, H. Li, Research on improved SSD algorithm for detection in traffic, Microprocessors, 43 (2022), 26–29. |
[22] | B. Wang, Y. Lv, X. Hei, H. Jin, Lightweight deep convolutional neural network model based on dilated convolution, 2020. Available from: https://kns.cnki.net/kcms2/article/abstract?v = kxaUMs6x7-4I2jr5WTdXti3zQ9F92xu0dKxhnJcY9pxwfrkG2rAGFOJWdZMiOIJjZJ9FLVWmYcCCgfpgeyHSjqedCLDh_ut5 & uniplatform = NZKPT |
[23] |
L. Jiang, J. Li, B. Huang, Research on face feature detection algorithm based on improved SSD, Mach. Des. Manuf. Eng., 50 (2021), 82–86. https://doi.org/10.3969/j.issn.2095-509X.2021.07.017 doi: 10.3969/j.issn.2095-509X.2021.07.017
![]() |
[24] |
X. Zhang, A. Jiang, SSD Small Target detection algorithm combining feature enhancement and self-attention, Comput. Eng. Appl., 58 (2022), 247–255. https://doi.org/10.3778/j.issn.1002-8331.2109-0356 doi: 10.3778/j.issn.1002-8331.2109-0356
![]() |
[25] | J. Guo, T. Yu, Y. Cui, X. Zhou, Research on vehicle small target detection algorithm based on improved SSD, Comput. Technol. Dev., 32 (2022), 1–7. |
[26] | Q. Zheng, L. Wang, F. Wang, Candidate box generation method based on improved ssd network, 2020. Available from: https://kns.cnki.net/kcms2/article/abstract?v = kxaUMs6x7-4I2jr5WTdXti3zQ9F92xu0ManZHCyoNk-lwS3y-OLIR4fcD18PUKrUkLhyHScAkvpkTgimuL-OfVjGi7Jisy2h & uniplatform = NZKPT |
[27] |
Q. Song, X. Wang, C. Zhang, Y. Chen, H. Song, A residual SSD model based on window size clustering for traffic sign detection, J. Hunan Univ., 46 (2019), 133–140. https://doi.org/10.16339/j.cnki.hdxbzkb.2019.10.016 doi: 10.16339/j.cnki.hdxbzkb.2019.10.016
![]() |
[28] |
W. Chen, Lightweight convolutional neural network remote sensing image target detection, Beijing Surv. Mapp., 36 (2018), 178–183. https://doi.org/10.19580/j.cnki.1007-3000.2022.02.014 doi: 10.19580/j.cnki.1007-3000.2022.02.014
![]() |
[29] | K. Chen, Research on SSD-based Multi-scale Detection Algorithm, M.S thesis, Beijing Jiaotong University in Beijing, 2020. https://doi.org/10.26944/d.cnki.gbfju.2020.002225 |
[30] |
H. Zhang, M. Zhang, SSD Target Detection Algorithm with Channel Attention Mechanism, Comput. Eng., 46 (2020), 264–270. https://doi.org/10.19678/j.issn.1000-3428.0054946 doi: 10.19678/j.issn.1000-3428.0054946
![]() |
[31] | Z. A. Haq, Z. Hasan, Eye-blink rate detection for fatigue determination, in 2016 1st India International Conference on Information Processing (IICIP), (2016), 1–5. https://doi.org/10.1109/IICIP.2016.7975348 |
[32] |
X. Zhou, S. Wang, W. Zhao, X. Zhao, T. Li, Fatigue Driving Detection Based on State Recognition of Eyes and Mouth, J. Jilin Univ., 35 (2017), 204–211. https://doi.org/10.19292/j.cnki.jdxxp.2017.02.015 doi: 10.19292/j.cnki.jdxxp.2017.02.015
![]() |
1. | Aidyn Kassymov, Berikbol T. Torebek, Lyapunov-type inequalities for a nonlinear fractional boundary value problem, 2021, 115, 1578-7303, 10.1007/s13398-020-00954-9 | |
2. | Jie Wang, Shuqin Zhang, A Lyapunov-Type Inequality for Partial Differential Equation Involving the Mixed Caputo Derivative, 2020, 8, 2227-7390, 47, 10.3390/math8010047 |