
Convolutional Neural Networks (CNNs) have achieved remarkable results in the computer vision field. However, the newly proposed network architecture has deeper network layers and more parameters, which is more prone to overfitting, resulting in reduced recognition accuracy of the CNNs. To improve the recognition accuracy of the model of image recognition used in CNNs and overcome the problem of overfitting, this paper proposes an improved data augmentation approach based on mosaic algorithm, named Dynamic Mosaic algorithm, to solve the problem of the information waste caused by the gray background in mosaic images. This algorithm improves the original mosaic algorithm by adding a dynamic adjustment step that reduces the proportion of gray background in the mosaic image by dynamically increasing the number of spliced images. Moreover, to relieve the problem of network overfitting, also a Multi-Type Data Augmentation (MTDA) strategy, based on the Dynamic Mosaic algorithm, is introduced. The strategy divides the training samples into four parts, and each part uses different data augmentation operations to improve the information variance between the training samples, thereby preventing the network from overfitting. To evaluate the effectiveness of the Dynamic Mosaic algorithm and the MTDA strategy, we conducted a series of experiments on the Pascal VOC dataset and compared it with other state-of-the-art algorithms. The experimental results show that the Dynamic Mosaic algorithm and MTDA strategy can effectively improve the recognition accuracy of the model, and the recognition accuracy is better than other advanced algorithms.
Citation: Yuhua Li, Rui Cheng, Chunyu Zhang, Ming Chen, Hui Liang, Zicheng Wang. Dynamic Mosaic algorithm for data augmentation[J]. Mathematical Biosciences and Engineering, 2023, 20(4): 7193-7216. doi: 10.3934/mbe.2023311
[1] | Mahdi Jalili . EEG-based functional brain networks: Hemispheric differences in males and females. Networks and Heterogeneous Media, 2015, 10(1): 223-232. doi: 10.3934/nhm.2015.10.223 |
[2] | Rosa M. Benito, Regino Criado, Juan C. Losada, Miguel Romance . Preface: "New trends, models and applications in complex and multiplex networks". Networks and Heterogeneous Media, 2015, 10(1): i-iii. doi: 10.3934/nhm.2015.10.1i |
[3] | Regino Criado, Rosa M. Benito, Miguel Romance, Juan C. Losada . Preface: Mesoscales and evolution in complex networks: Applications and related topics. Networks and Heterogeneous Media, 2012, 7(3): i-iii. doi: 10.3934/nhm.2012.7.3i |
[4] | Mirela Domijan, Markus Kirkilionis . Graph theory and qualitative analysis of reaction networks. Networks and Heterogeneous Media, 2008, 3(2): 295-322. doi: 10.3934/nhm.2008.3.295 |
[5] | M. D. König, Stefano Battiston, M. Napoletano, F. Schweitzer . On algebraic graph theory and the dynamics of innovation networks. Networks and Heterogeneous Media, 2008, 3(2): 201-219. doi: 10.3934/nhm.2008.3.201 |
[6] | Robert Carlson . Spectral theory for nonconservative transmission line networks. Networks and Heterogeneous Media, 2011, 6(2): 257-277. doi: 10.3934/nhm.2011.6.257 |
[7] | Jun Guo, Yanchao Shi, Yanzhao Cheng, Weihua Luo . Projective synchronization for quaternion-valued memristor-based neural networks under time-varying delays. Networks and Heterogeneous Media, 2024, 19(3): 1156-1181. doi: 10.3934/nhm.2024051 |
[8] | Jan Haskovec, Vybíral Jan . Robust network formation with biological applications. Networks and Heterogeneous Media, 2024, 19(2): 771-799. doi: 10.3934/nhm.2024035 |
[9] | Mahendra Piraveenan, Mikhail Prokopenko, Albert Y. Zomaya . On congruity of nodes and assortative information content in complex networks. Networks and Heterogeneous Media, 2012, 7(3): 441-461. doi: 10.3934/nhm.2012.7.441 |
[10] | Anirban Banerjee, Jürgen Jost . Spectral plot properties: Towards a qualitative classification of networks. Networks and Heterogeneous Media, 2008, 3(2): 395-411. doi: 10.3934/nhm.2008.3.395 |
Convolutional Neural Networks (CNNs) have achieved remarkable results in the computer vision field. However, the newly proposed network architecture has deeper network layers and more parameters, which is more prone to overfitting, resulting in reduced recognition accuracy of the CNNs. To improve the recognition accuracy of the model of image recognition used in CNNs and overcome the problem of overfitting, this paper proposes an improved data augmentation approach based on mosaic algorithm, named Dynamic Mosaic algorithm, to solve the problem of the information waste caused by the gray background in mosaic images. This algorithm improves the original mosaic algorithm by adding a dynamic adjustment step that reduces the proportion of gray background in the mosaic image by dynamically increasing the number of spliced images. Moreover, to relieve the problem of network overfitting, also a Multi-Type Data Augmentation (MTDA) strategy, based on the Dynamic Mosaic algorithm, is introduced. The strategy divides the training samples into four parts, and each part uses different data augmentation operations to improve the information variance between the training samples, thereby preventing the network from overfitting. To evaluate the effectiveness of the Dynamic Mosaic algorithm and the MTDA strategy, we conducted a series of experiments on the Pascal VOC dataset and compared it with other state-of-the-art algorithms. The experimental results show that the Dynamic Mosaic algorithm and MTDA strategy can effectively improve the recognition accuracy of the model, and the recognition accuracy is better than other advanced algorithms.
COVID-19 is an emerging acute infectious disease, which incubation period is 1–14 days, usually 3–7 days. COVID-19 generally have no obvious precursors, the infection will be after the Coronavirus disease early, some patients may also have no obvious symptoms, most common in patients with fever, dry cough, lack of power as the main performance, but beyond that, due to individual differences, the patient also can appear muscle pain, chest tightness, pharyngeal itching, runny nose. The lack of specificity, which can be seen in many diseases and is not unique to COVID-19, makes it difficult for patients to identify infection by symptoms themselves. Some immunity can be acquired after infection or after the cornavirus vaccine, but the duration is unclear.
The establishing and analyzing of mathematical models play an important role in the control and prevention for disease transmissing. McKendrick first proposed the PDE formulation for the age distribution of a population [1]. Ever since the research results by Kermack and McKendrick [2], Hoppensteadt [3], Iannalli [4] and Webb [5], age structure models have been widely used in the study of transmission dynamics of infectious diseases [6,7,8]. Recently, Bentout Soufiane et al. considered an alcoholism model for age structure and investigated the glabal behavior [9]. In December 2019, some medical institutions of Wuhan reported some cases of pneumonia of unknown cause. On 11 February 2020, the World Health Organization officially named the pneumonia contracted by the Novel Coronavirus as "COVID-19". Recently many scholars have studied on COVID-19, which all proposed and studied the dynamical model which has helped to control infectious diseases. Glenn Webb proposed a model of a COVID-19 epidemic which is developed to predict the effectiveness of vaccination [10]. B. Tang et al. proposed calculation of the basic reproduction number by virtue of mathematical modeling can help decide the potential and severity of an outbreak and provide critical information for identifying the type of disease interventions and intensity [11]. J. Jiao et al. presents an SEIR epidemic model with infectivity in incubation period and homestead-isolation on the susceptible [12]. Besides, deep learning frameworks [13] also can be used for prediction virus spread and a more reliable model incorporating more parameters input into a neural network based virus transmission predictor may be implemented.
McCluskey assumed that infected individuals can develop disease by either of two pathogenic machanism: fast progression or endogenous reactivation [14]. Generally, acute infectious diseases develop through four stages, among which the incubation period is very important, which refers to the period from pathogen invasion to the onset of clinical symptoms. Take COVID-19 for example which has a certain incubation period. According to current epidemiological statistics, the incubation period is about 1–14 days. Some patients will show symptoms on the day of infection or one or two days later, while some patients will have a longer incubation period of about two weeks. Consequently, it is necessary to consider the factors of fast and slow progress in infection modeling.
Besides, the treatment of disease is proportional due to medical resources. Capasso and Serill [15] introducing saturated incidence in the cholera epidemic model, describes the tingible into infected class average relationship g(I)=kI/(1+μ),k,μ>0, which said the disease infection ability, said a crowded or change on the influence of the individual, the increase in the number of infected people, easy to dye more vigilant, lead to easy dyeing behaviour change or when the disease is especially crowded in the environment may be unlimited effective contact.
Zunyou Wu who is the chief expert of epidemiology at the Chinese Center for Disease Control and Prevention, said there are three possible cases of re-positive symptoms for COVID-19: first, false negative or false positive nucleic acid test; second, the virus is active again; third, reinfection. Zijian Feng who is the deputy director of the Chinese Center for Disease Control and Prevention, said that the re-positive case caused continued transmission is rare and does not play a big role. Recently, some provinces in China have seen new cases of COVID-19 including asymptomatic patients. Therefore an infected individual ows into the exposed class after been treated but not becomes susceptible in our models. Inspired by the above discussions, we consider an SEI epidemic model which introduce the latent age, the nonlinear incidence of reactive unsaturated treatment and the saturation treatment function.
{dS(t)dt=Λ−βSI−μS,∂e(t,a)dt+∂e(t,a)da=−(μ+α(a))e(t,a),dI(t)dt=∫∞0α(a)e(t,a)da+(1−p)βSI−f(I)−(d+μ)I, | (2.1) |
for boundary and initial values conditions
e(t,0)=pβSI+f(I),S(0)=S0,e(0,a)=e0(a),I(0)=I0. | (2.2) |
where S(t),e(t,a) and I(t) respectively be the population sizes of susceptible, latent and infective classes. We assume that the population size is changeless. β represents susceptible people in contact with an infected person transmit rate, p represents susceptible people contact with an infected person enter slow propagation process called latent stage which denoted by e(t, a) where individuals are infected with disease but are not yet contagious, where a is called the age of latency progression, which is the duration of the incubation period. We denote E(t)=∫+∞0e(t,a)da as the latent individuals' total density. 1−p represents susceptible people and the onset of contact after rapid development for the onset of ratio, μ and d represent people natural mortality and mortality due to illness. f(x)=γx/(1+mx) represents the saturation treatment function where the γ is cure rate of the disease.
We define X=R+×L1+(0,+∞)×R+, equipped with the norm ‖(x1,x2,x3)‖X=|x1|+∫∞0x2(a)da+|x3|. The initial condition of system (2.1) belongs to the positive cone of X, then can be rewritten as x0=(S0,e0(⋅),I0)∈X. We can get a continuous semi-flow associated with system (2.1), that is, Θ:R+×X⟶X produced be system (2.1) adopts the following form, Θ(t,x0)=(S(t),e(t,⋅),I(t)),t≥0,x0∈X, with
∥Θ(t,x0)∥X=|(S(t)|+∫+∞0|e(t,⋅)|da+|I(t)|. | (2.3) |
For simplicity, let ε(s)=u+α(s),θ=∫∞0α(a)e−∫a0ε(τ)dτda,K0(a)=e−∫a0ε(τ)dτ. The second equation of system (2.1) is solved along t−a=constant
e(t,a)={(pβS(t−a)I(t−a)+γI(t−a)1+mI(t−a))K0(a),t>a≥0,e0(a−t)K0(a)K0(a−t),a≥t≥0, | (2.4) |
Let Ω={(S(t),e(t,⋅),I(t))∈X, S(t)+∫+∞0e(t,a)da+I(t)≤Λμ}. The interior of Ω is ˚Ω. we can easily verify the non-negative and positive invariance set of the system (2.1) with the help of article [5].
We note that if R0>1, Ω is the positive invariant set for Θ, and it attracts all solutions of the system (2.1) with non-negative initial conditions.
Firstly, there is a disease-free equilibrium point E0=(S0,0,0) in the system (2.1), where S0=Λμ, and we define the basic reproduction number of the system (2.1) as following
R0=pβΛθ+γμθ+(1−p)βΛ(γ+d+μ)μ |
and it is easily known that if R0>1, system (2.1) has an only positive endemic equilibrium point E∗(S∗,e∗(a),I∗), where
S∗=ΛβI∗+μ,e∗(a)=(pβS∗I∗+γI∗1+mI∗)e−∫a0ε(τ)dτ. |
Define space
X:=R3×L1((0,+∞),R),X0:=R2×0×L1((0,+∞),R),X+:=R3+×L1+((0,+∞),R), |
and X0+=X+⋂X0. Define operator T:D(T)⊂X→X,
T(SI(0e))=(−μ−(d+μ)(−e(0)−e′−(μ+α(a))e)) |
where D(T)=R×R×0×W1,1((0,+∞),R). Consider nonlinear mapping F:X0→X, for
F(SI(0e))=(Λ−βSI∫∞0α(a)e(t,a)da+(1−p)βSI−f(I)(pβSI+f(I)0L1)) |
define
U(t)=(S(t),I(t),(0e(t,⋅)))T |
Therefore systerm (2.1) can be rewritten as an abstract Canchy problem
dU(t)dt=TU(t)+F(U(t))t≥0,U(0)=u0∈X0+. | (2.5) |
Draw on the results in Magal [16] and Magal and Thiemel [17], there exists an uniquely deterministic semiflow {U(t)}t≥0 on X0+ which is bound dissipative and asymptotically smooth, and {U(t)}t≥0 has a global attractor T⊂X which attracts the bounded sets of X.
Theorem 2.1. If R0≤1, the disease-free equilibrium E0 is locally asymptotically stable.
Proof. Let x1(t)=S(t)−S0, x2(t)=e(t,a), x3(t)=I(t), linearizing the system (2.1) at E0, and considering the exponential solution x1(t)=x01eλt,x2(t,a)=x02eλt,x3(t)=x03eλt, we can derive
{(λ+μ)x01+βS0x03=0,dx02(a)da=−(λ+μ+α(a))x02(a),x02(0)=pβS0x03+γx03,λx03=∫∞0α(a)x02(a)da+(1−p)βS0x03−(μ+d+γ)x03. | (2.6) |
Integrating the second equation of system (2.6) from 0 to a, considering the boundary condition, deduces x02(a)=(pβS0x03+γx03)e−(λ+μ)a−∫a0α(s)ds. Substituting x02(a) into the fourth equation of system (2.6), solving it, we get the characteristic equation
H(λ)=−λ+∫∞0α(a)(γ+pβΛμ)e−(μ+λ)ae−∫a0α(τ)dτda+(1−p)βΛμ−(d+μ+γ). |
easily know H′(λ)<0 which implies that H′(λ) is a decreasing function, and
limλ→+∞H(λ)=−∞,limλ→−∞H(λ)=+∞,H(0)=(d+μ+γ)(R0−1). |
Let λ=x+yi is an arbitrary complex root of H(λ)=0, then
H(x+yi)=−x+∫∞0α(a)(γ+pβΛμ)e−(μ+x)ae−∫a0α(τ)dτcos(ya)da+(1−p)βΛμ−(d+μ+γ)−(iy+∫∞0α(a)(γ+pβΛμ)e−(μ+x)ae−∫a0α(τ)dτisin(ya)da)=0. |
be equivalent to
−x+∫∞0α(a)(γ+pβΛμ)e−(μ+x)ae−∫a0α(τ)dτcos(ya)da+(1−p)βΛμ−(d+μ+γ)=0,y+∫∞0α(a)(γ+pβΛμ)e−(μ+x)ae−∫a0α(τ)dτsin(ya)da=0. |
And because 0=−x+∫∞0α(a)(γ+pβΛμ)e−(μ+x)ae−∫a0α(τ)dτcos(ya)da+(1−p)βΛμ−(d+μ+γ)≤H(x) then 0=H(λ)≤H(x) which stands for x<λ∗, where λ∗ is the unique real root of H(λ)=0. Thus if and only if R0≤1, all the roots of system (2.6) have negative real part.
Theorem 2.2. If R0>1, the unique endemic equilibrium E∗ is locally asymptotically stable.
Proof. The perturbation variables are as follows
y1(t)=S(t)−S∗,y2(t,a)=e(t,a)−e∗(a),y3(t)=I(t)−I∗. |
Linearizing system (2.1) at E∗ and assuming the form of solution is as follows
y1(t)=y01eλt,y2(t,a)=y02(a)eλt,y3(t)=y03eλt, | (2.7) |
where y01,y02(a),y03 will be determined. we get
{0=(λ+βI∗+μ)y01+βS∗y03,dy02(a)da=−(λ+μ+α(a))y02(a),y02(0)=pβy01I∗+pβy03S∗+γ(1+mI∗)2y03,λy03=∫∞0α(a)y02(a)da+(1−p)β(y01I∗+y03S∗)−γ(1+mI∗)2y03−(d+μ)y03. | (2.8) |
By calculating, we can get the following eqution
[λ+γ(1+mI∗)2+(d+μ)−(1−p)βS∗]y03−(1−p)βI∗y01=pβI∗y01W(λ)+(pβS∗+γ(1+mI∗)2)y03W(λ), | (2.9) |
where W(λ)=∫∞0α(a)e−(λ+μ)a−∫∞0α(τ)dτda satisfies the following properties
W(0)=θ,limλ→−∞W(λ)=+∞,limλ→+∞W(λ)=∫∞0α(a)da. |
From the first equation of system (2.8) and the Eq (2.9), we obtain the following characteristic equation
(λ+μ+βI∗)(λ+μ+d)=(λ+μ+βI∗){(W(λ)−1)γ(1+mI∗)2+[(1−p)β+pβW(λ)]ΛβI∗+μ}−βΛβI∗+μ[(p−1)βI∗−pβI∗W(λ)] | (2.10) |
Note M is the right side of the Eq (2.10). Assuming λ>0, M satisfies the following inequality
∣M∣≤R0(λ+βI∗+μ+1)(γ+d+μ). | (2.11) |
which is equivalent to
h(λ)=λ2+Pλ+Q≤0. |
where
P=βI∗+2μ+d−R0(γ+d+μ),Q=(βI∗+μ)(d+μ)−R0(βI∗+μ+1)(γ+d+μ). |
Since λ>0, therefore
(βI∗+μ)(d+μ)(βI∗+μ+1)(γ+d+μ)>R0. |
Let A=(βI∗+μ)(d+μ)(βI∗+μ+1)(γ+d+μ), easily know A<1, i.e. R0<1 which is contradict with R0>1. then we can get λ<0.
Theorem 2.3. If R0>1, there exists ε>0, such that for each ∀y∈M0, limt→+∞infd(U(t)y,∂M0)≥ε.Furthermore, there exists a compact subset H0⊂M0 which is a global attractor for {U(t)}t≥0 in M0.
Proof. Define M0={(S,I,0,e)T∈X0+:T(t)=I+∫∞0e(a)da>0}, and ∂M0=X0+∖M0. Firstly, let (S0,I0,0,e0)∈M0, we can get T′(t)≥−max{d+μ,μ+αmax}T(t), where αmax=esssupa∈(0,∞)α(a), easily know U(t)M0⊂M0. Secondly, if (S0,I0,0,e0)∈∂M0, with the help of system (2.4), we know if t≥0, we get I(t)=0 and ∫∞0e(t,a)da→0, for t→+∞. Therefore U(t)∂M0⊂∂M0. Let (S0,I0,0,e0)∈∂M0, we get
{dI(t)dt=∫∞0α(a)e(t,a)da+(1−p)βSI−f(I)−(d+μ)I,∂e(t,a)dt+∂e(t,a)da=−(μ+α(a))e(t,a),e(t,0)=pβSI+f(I),I(0)=I0,e(0,a)=e0(a) |
Since S(t)≤S0 as t→+∞, we get I(t)≤˜I(t),e(t,a)≤˜e(t,a), where
{d˜I(t)dt=∫∞0α(a)˜e(t,a)da+(1−p)βS0˜I−γ˜I−(d+μ)˜I,∂˜e(t,a)dt+∂˜e(t,a)da=−(μ+α(a))˜e(t,a),˜e(t,0)=pβS0˜I+γ˜I,˜I(0)=˜I0,˜e(0,a)=˜e0(a) | (2.12) |
By the system (2.4), we have
˜e(t,a)={(pβS0˜I(t−a)+γ˜I(t−a))K0(a),t>a≥0,˜e0(a−t)K0(a)K0(a−t),a≥t≥0, | (2.13) |
where K0(a)=e−∫a0ε(τ)dτ. Substituting system (2.13) into system (2.12), we obtain
{d˜I(t)dt=T1+T2+(1−p)βS0˜I−γ˜I−(d+μ)˜I˜I(0)=0 | (2.14) |
where
T1=∫t0α(a)(pβS0˜I(t−a)+γ˜I(t−a))K0(a)da,T2=∫+∞tα(a)˜e0(a−t)K0(a)K0(a−t)da. |
It's simple to know that if T2=0, we get that system (2.14) has an only solution ˜I(t)=0. From the system (2.13), we can get ˜e(t,0)=0,t→+∞. Through comparison, we get (I(t),e(t,a))→(0,0) for t→+∞.
Since E0=(S0,0,0,0L1) is globally asymptotically stable in ∂M0, next we only need to proof that Ws(E0)⋂M0=Θ, where Ws(E0)={z∈X0+,limt→+∞U(t)z=E0}. Assume there exists z∈Ws(E0)⋂M0, it follows that there exists t0>0 such that I(t0)+∫∞0e(t0,a)da>0. Using the method in [18], we have e(t,a)>0 for (t,a)∈[0,∞)×[0,∞), I(t)>0 for t≥0. By means of the method of Braueretal [19], the following function is defined
H(a)=∫∞aα(s)e−∫saε(τ)dτds |
for ∀a>0, H(a)≥0, and H(0)=θ. Furthermore, for ∀a≥0,H′(a)=−α(a)+ε(a)H(a). Let
Φ(t)=I(t)+∫∞0H(a)e(t,a)da |
which satisfies
dΦ(t)dt=I(d+μ)1+mI((θp+1−p)βS(1+mI)+(θ−1)γ(d+μ)−1). |
If R0>1, there exists t0>0 such that Φ(t)≥Φ(t0) for all t≥t0. Since Φ(t0)>0, this prevents that (I(t),e(t,a))→(0,0L1,0L1), which is contradiction with S(t) converges to S0 and I(t) converges to 0, for t→∞. We get the semiflow {U(t)}t≥0 is uniformly persistent with respect to the pair (∂M0,M0). Besides, there exists a compact subset H0⊂M0 which is a global attractor for {U(t)}t≥0 in M0.
Theorem 2.4. Assume α(a) is an bounded function, if R0<1, the infection-free equilibrium E0 is globally asymptotically stable. Note ˉα=lima∈[0,+∞)supα(a).
Proof. Consider systems (2.1)–(2.4) we get
∫∞0α(a)e(t,a)da≤∫t0α(a)[pβS(t−a)I(t−a)+γI(t−a)]K0(a)da+ˉα∥e∥L1e−μt | (2.15) |
where ∥e∥L1=∫+∞0e0(a)da. Take the limit of both sides of the inequality (Eq 2.15), since S≤Λμ and limt→+∞e−μt=0, we get
limt→+∞sup∫∞0α(a)e(t,a)da≤∫+∞0α(a)pβΛμK0(a)dalimt→+∞supI(t)+∫∞0γα(a)K0(a)dalimt→+∞supI(t). | (2.16) |
With the help of Taylor's formula and the third equation of system (2.1), we get
dI(t)dt≤∫∞0α(a)e(t,a)da+(1−p)βIΛμ−(γ+d+μ)I. | (2.17) |
By solving inequality (Eq 2.17) and taking the limit of both sides, we can get
limt→+∞supI(t)≤R0limt→+∞supI(t) |
Therefore, when R0<1, limt→+∞supI(t)=0. By using inequality (Eq 2.16) and system (2.1) respectively, we get limt→+∞supe(t,a)=0 and limt→+∞supS(t)=Λμ. Therefore, if R0<1, the disease-free equilibrium point E0 is global attraction. Further, with the help of Theorem 2.1, we have the disease-free equilibrium point is global asymptotically stable.
Theorem 2.5. If R0>1, the unique endemic equilibrium E∗ is globally asymptotically stable.
Proof. The Lyapunov functional V∗(t) is constructed
V∗(t)=WS+We+WI, | (2.18) |
where
WS(t)=(1−p)S∗g(SS∗),We(t)=∫∞0W(a)e∗(a)g(e(t,a)e∗(a))da,WI(t)=I∗g(II∗). |
for W(a)=∫+∞aα(s)e−∫sa(μ+α(τ))dτ,g(x)=−1+x−lnx, de∗(a)da=−ε(a)e∗(a). Calculating the derivative of the V∗(t) along with the solutions of system (2.18), yields
dV∗(t)dt=(1−p)μS∗(2−SS∗−S∗S)+(1−p)βS∗I∗(1−S∗S−SIS∗I∗+II∗)−W(a)e∗(a)g(e(t,a)e∗(a))|∞+θe∗(0)g(e(t,0)e∗(0))−∫∞0α(a)e∗(a)g(e(t,a)e∗(a))+∫∞0α(a)e∗(a)(1−II∗−I∗e(t,a)Ie∗(a)+e(t,a)e∗(a))da+(1−p)βS∗I∗(1−S∗S+SIS∗I∗−II∗)=(1−p)μS∗(2−SS∗−S∗S)+(1−p)βS∗I∗(2−S∗S−SS∗)−W(a)e∗(a)g(e(t,a)e∗(a))|∞+∫∞0α(a)e∗(a)(1−II∗−I∗e(t,a)Ie∗(a)+e(t,a)e∗(a)+1−e(t,a)e∗(a)+lne(t,a)e∗(a))da+θe∗(0)g(e(t,0)e∗(0))=(1−p)μS∗(2−SS∗−S∗S)+(1−p)βS∗I∗(2−S∗S−SS∗)−W(a)e∗(a)g(e(t,a)e∗(a))|∞−∫∞0α(a)e∗(a)(g(II∗)+g(I∗e(t,a)Ie∗(a))da+θe∗(0)g(e(t,0)e∗(0)) |
if II∗>1 and S∗S>1, or 0<II∗<1 and 0<S∗S<1, we have
θe∗(0)g(e(t,0)e∗(0))=∫∞0α(a)e∗(a)g(e(t,0)e∗(0))≤∫∞0α(a)e∗(a)g(II∗)da |
Hence,
dV∗(t)dt==(1−p)μS∗(2−SS∗−S∗S)+(1−p)βS∗I∗(2−S∗S−SS∗)−W(a)e∗(a)g(e(t,a)e∗(a))|∞−∫∞0α(a)e∗(a)(g(II∗)+g(I∗e(t,a)Ie∗(a))da+∫∞0α(a)e∗(a)g(II∗)da=(1−p)μS∗(2−SS∗−S∗S)+(1−p)βS∗I∗(2−S∗S−SS∗)−W(a)e∗(a)g(e(t,a)e∗(a))|∞−∫∞0α(a)e∗(a)g(I∗e(t,a)Ie∗(a))da |
For g(x)≥0,x∈R, therefore dV∗(t)dt≤0 is always true, furthermore the strict equality holds if and only if S=S∗,e(t,a)=e∗(a),I=I∗. Therefore when R0>1 the endemic equilibrium E∗ is globally asymptotically stable.
In the work, an age structure epidemic SEI model with fast and slow progression is considered. The basic reproduction number R0 is obtained as R0=pβΛθ+γμθ+(1−p)βΛ(γ+d+μ)μ. We have proved the globally asymptotically stable for disease-free and endemic equilibrium respectively. In the following, we also give some numerical simulations to illustrate the global stability. Let Λ=1;β=0.055;γ=0.7;μ=0.063;d=0.04;p=0.8;m=0.02;S(0)=30,e(0,a)=6e−0.4a,I(0)=10. and
α(a)={0.4,a≥τ0,τ≥a≥0. |
In Figure 1, we choose τ=12, then R0<1, it can be seen that E0 is globally asymptotically stable. While in Figure 2, we choose τ=1, then R0>1, it can be seen that E∗ is globally asymptotically stable. The figures show the series of S(t) and I(t) which converge to their equilibrium values, in addition the age distribution of e(t,a).
COVID-19 has spread rapidly around the world since 2020 with a high fatality rate. Today the epidemic in some countries is still unable to be effectively controlled, and social and economic life has been greatly disrupted. COVID-19 trend prediction has become a major research focus. Current trend prediction methods include epidemic disease prediction model, COVID-19 trend prediction model based on deep learning, etc. These models have effectively assisted medical experts and scientific research institutions to efficiently predict COVID-19. The countermeasures and suggestions for strengthening epidemic prevention and control are put forward, which have a good guiding role for accurate epidemic prevention and control.
The large-scale epidemic of COVID-19 in China has basically ended, but there are still occasional imported cases or local outbreaks caused by cold chain pollution which prevention and control enters a new phase of normalization. Since the outbreak of COVID-19, a large number of researchers have conducted extensive studies on infectious disease dynamics and prevention and control measures through various models and data analysis methods. Many scholars have built traditional dynamics models based on warehouses to explore the development trend of COVID-19 and provide scientific basis for epidemic prevention and control.
According to transmission characteristics of infectious diseases, the paper proposed the methods of fast and slow transmission, which more effectively reveals the transmission mechanism for infectious diseases. The global asymptotic stability of the system has analyzed with the help of the principle of dynamics, and abtained the threshold of infectious disease control. The greater the rate of slow progression of an infectious disease, the fewer the threshold results. The world is now being vaccinated which cannot provide lifelong immunity, but can reduce the mortality of those infected. By vaccinating, the rate of patients entering slow progression increases and the threshold is correspondingly reduced. Therefore, vaccination can effectively control the transmission of Coronavirus.
This research is supported by Guizhou Province Science and Technology Support Plan Project ([2020]4Y167), the National Natural Science Foundation of China (N0.12001417), Doctoral Foundation of Guizhou Education University (2018BS001), First-class University Construction Project of Guizhou Education University ([2019]35).
The authors declare there is no conflict of interest.
[1] |
A. Belhadi, Y. Djenouri, G. Srivastava, D. Djenouri, J. C. W. Lin, G. Fortino, Deep learning for pedestrian collective behavior analysis in smart cities: a model of group trajectory outlier detection, Inform. Fusion, 65 (2021), 13–20. https://doi.org/10.1016/j.inffus.2020.08.003 doi: 10.1016/j.inffus.2020.08.003
![]() |
[2] |
G. Vallathan, A. John, C. Thirumalai, S. K. Mohan, G. Srivastava, J. C. W. Lin, Suspicious activity detection using deep learning in secure assisted living IoT environments, J. supercomput., 77 (2021), 3242–3260. https://doi.org/10.1007/s11227-020-03387-8 doi: 10.1007/s11227-020-03387-8
![]() |
[3] |
Y. Djenouri, G. Srivastava, J. C. W. Lin, Fast and accurate convolution neural network for detecting manufacturing data, IEEE Trans. Ind. Inform., 17 (2020), 2947–2955. https://doi.org/10.1109/TII.2020.3001493 doi: 10.1109/TII.2020.3001493
![]() |
[4] |
A. Belhadi, Y. Djenouri, J. C. W. Lin, A. Cano, Trajectory outlier detection: algorithms, taxonomies, evaluation and open challenges, ACM Trans. Manage. Inform. Syst., 11 (2020), 1–29. https://doi.org/10.1145/3399631 doi: 10.1145/3399631
![]() |
[5] |
A. Belhadi, Y. Djenouri, G. Srivastava, D. Djenouri, A. Cano, J. C. W. Lin, A two-phase anomaly detection model for secure intelligent transportation ride-hailing trajectories, IEEE Trans. Intell. Trans. Syst., 22 (2020), 4496–4506. https://doi.org/10.1109/TITS.2020.3022612 doi: 10.1109/TITS.2020.3022612
![]() |
[6] | C. Sun, A. Shrivastava, S. Singh, A. Gupta, Revisiting unreasonable effectiveness of data in deep learning era, in Proceedings of the IEEE international conference on computer vision, (2017), 843–852. https://doi.org/10.1109/ICCV.2017.97 |
[7] |
R. Takahashi, T. Matsubara, K. Uehara, Data augmentation using random image cropping and patching for deep CNNs, IEEE Trans. Circuits Syst. Video Technol., 30 (2019), 2917–2931. https://doi.org/10.1109/TCSVT.2019.2935128 doi: 10.1109/TCSVT.2019.2935128
![]() |
[8] |
C. Zhang, S. Bengio, M. Hardt, B. Recht, O. Vinyals, Understanding deep learning (still) requires rethinking generalization, Commun. ACM, 64 (2021), 107–115. https://doi.org/10.1145/3446776 doi: 10.1145/3446776
![]() |
[9] | M. D. Zeiler, R. Fergus, Visualizing and understanding convolutional networks. in European conference on computer vision, (2014), 818–833. https://doi.org/10.1007/978-3-319-10590-1_53 |
[10] | L. M. Zintgraf, T. S. Cohen, T. Adel, M. Welling, Visualizing deep neural network decisions: Prediction difference analysis, preprint, arXiv: 1702.04595. |
[11] |
L. Schmidt, S. Santurka, D. Tsipras, K. Talwar, A. Madry, Adversarially robust generalization requires more data, Adv. Neural Inform. Process. Syst., 31 (2018). https://doi.org/10.48550/arXiv.1804.11285 doi: 10.48550/arXiv.1804.11285
![]() |
[12] | J. Hestness, S. Narang, N. Ardalani, G. Diamos, H. Jun, H. Kianinejad, et al., Deep learning scaling is predictable, preprint, arXiv: 1712.00409. |
[13] | D. C. Ciresan, U. Meier, J. Masci, L. M. Gambardella, J. Schmidhuber, Flexible, high performance convolutional neural networks for image classification, in Twenty-second international joint conference on artificial intelligence, (2011), 1237–1242. |
[14] | D. Cireşan, U. Meier, J. Schmidhuber, Multi-column deep neural networks for image classification, in IEEE conference on computer vision and pattern recognition, (2012), 3642–3649. https://doi.org/10.1109/CVPR.2012.6248110 |
[15] |
C. Shorten, T. M. Khoshgoftaar, A survey on image data augmentation for deep learning, J. Big Data, 6 (2019), 1–48. https://doi.org/10.1186/s40537-019-0197-0 doi: 10.1186/s40537-018-0162-3
![]() |
[16] | D. Han, J. Kim, J. Kim, Deep pyramidal residual networks. in Proceedings of the IEEE conference on computer vision and pattern recognition, (2017), 5927–5935. https://doi.org/10.1109/cvpr.2017.668 |
[17] |
A. Krizhevsky, I. Sutskever, G. E. Hinton, Imagenet classification with deep convolutional neural networks, Adv. Neural Inform. Process. Syst., 6 (2017), 84–90. https://doi.org/10.1145/3065386 doi: 10.1145/3065386
![]() |
[18] | K. Simonyan, A. Zisserman, Very deep convolutional networks for large-scale image recognition, preprint, arXiv: 1409.1556. |
[19] | K. He, X. Zhang, S. Ren, J. Sun, Deep residual learning for image recognition, in Proceedings of the IEEE conference on computer vision and pattern recognition, (2016), 770–778. |
[20] | G. Huang, Z. Liu, L. Van Der Maaten, K. Q. Weinberger, Densely connected convolutional networks, in Proceedings of the IEEE conference on computer vision and pattern recognition, (2017), 4700–4708 |
[21] | S. Xie, R. Girshick, P. Dollár, Z. Tu, K. He, Aggregated residual transformations for deep neural networks, in Proceedings of the IEEE conference on computer vision and pattern recognition, (2017), 1492–1500. https://doi.org/10.1109/CVPR.2017.634 |
[22] | Y. Tokozume, Y. Ushiku, T. Harada, Between-class learning for image classification, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2018), 5486–5494. https://doi.org/10.48550/arXiv.1711.10284 |
[23] | A. Bochkovskiy, C. Y. Wang, H. Y. M. Liao, Yolov4: Optimal speed and accuracy of object detection, preprint, arXiv: 2004.10934. |
[24] | S. Ioffe, C. Szegedy, Batch normalization: Accelerating deep network training by reducing internal covariate shift, in International conference on machine learning PMLR, (2015), 448–456. |
[25] | J. Kukačka, V. Golkov, D. Cremers, Regularization for deep learning: A taxonomy, preprint, arXiv: 1710.10686. |
[26] | J. Niu, Y. Chen, X. Yu, Z. Li, H. Gao, Data augmentation on defect detection of sanitary ceramics, in IECON The 46th Annual Conference of the IEEE Industrial Electronics Society, (2020), 5317–5322. https://doi.org/10.1109/IECON43393.2020.9254518 |
[27] | A. Jurio, M. Pagola, M. Galar, C. Lopez-Molina, D. Paternain, A comparison study of different color spaces in clustering based image segmentation, in International conference on information processing and management of uncertainty in knowledge-based systems, (2020), 532–541. https://doi.org/10.1007/978-3-642-14058-7_55 |
[28] | A. Krizhevsky, G. Hinton, Learning multiple layers of features from tiny images, Handb. Syst. Autoimmune Dis., 2009. |
[29] | F. J. Moreno-Barea, F. Strazzera, J. M. Jerez, D. Urda, L. Franco, Forward noise adjustment scheme for data augmentation, in IEEE symposium series on computational intelligence (SSCI), (2018), 728–734. https://doi.org/10.1109/SSCI.2018.8628917 |
[30] | T. DeVries, G. W. Taylor, Improved regularization of convolutional neural networks with cutout, 2017, preprint, arXiv: 1708.04552. |
[31] | E. D. Cubuk, B. Zoph, D. Mane, V. Vasudevan, Q. V. Le, Autoaugment: Learning augmentation policies from data, preprint, arXiv: 1805.09501. |
[32] |
J. Gui, Z. Sun, Y. Wen, D. Tao, J. Ye, A review on generative adversarial networks: Algorithms, theory, and applications, IEEE Trans. Knowl. Data Eng., 2021. https://doi.org/10.1109/TKDE.2021.3130191 doi: 10.1109/TKDE.2021.3130191
![]() |
[33] | D. Ho, E. Liang, X. Chen, I. Stoica, P. Abbeel, Population based augmentation: Efficient learning of augmentation policy schedules, in International Conference on Machine Learning, (2019), 2731–2741. https://doi.org/10.48550/arXiv.1905.05393 |
[34] | S. Lim, I. Kim, T. Kim, C. Kim, S. Kim, Fast autoaugment, Adv. Neural Inform. Process. Syst., 32 (2019). |
[35] | M. Frid-Adar, E. Klang, M. Amitai, J. Goldberger, H. Greenspan, Synthetic data augmentation using GAN for improved liver lesion classification, in IEEE 15th international symposium on biomedical imaging (ISBI), (2018), 289–293. https://doi.org/10.1109/ISBI.2018.8363576 |
[36] | A. Raghunathan, S. M. Xie, F. Yang, J. C. Duchi, P. Liang, Adversarial training can hurt generalization, preprint, arXiv: 1906.06032. |
[37] | H. Zhang, M. Cisse, Y. N. Dauphin, D. Lopez-Paz, mixup: Beyond empirical risk minimization, 2017, preprint, arXiv: 1710.09412. |
[38] | R. Takahashi, T. Matsubara, K. Uehara, Ricap: Random image cropping and patching data augmentation for deep cnns, in Asian conference on machine learning, (2018), 786–798. |
[39] | H. Guo, Y. Mao, R. Zhang, Mixup as locally linear out-of-manifold regularization, in Proceedings of the AAAI Conference on Artificial Intelligence, 33 (2019), 3714–3722. https://doi.org/10.48550/arXiv.1809.02499 |
[40] | S.Yun, D. Han, S. J. Oh, S. Chun, J. Choe, Y. Yoo, Cutmix: Regularization strategy to train strong classifiers with localizable features, in Proceedings of the IEEE/CVF international conference on computer vision, (2019), 6023–6032. |
[41] | C. Summers, M. J. Dinneen, Improved mixed-example data augmentation, in IEEE Winter Conference on Applications of Computer Vision (WACV), (2019), 1262–1270. |
[42] |
M. Everingham, S. M. Eslami, L. Van Gool, C. K. Williams, J. Winn, A. Zisserman, The pascal visual object classes challenge: A retrospective, Int. J. Comput. Vision, 111 (2015), 98–136. https://doi.org/10.1007/s11263-014-0733-5 doi: 10.1007/s11263-014-0733-5
![]() |
[43] | J. Glenn, S. Alex, B. Jirka, ultralytics/yolov5: v5.0 – YOLOv5 -P6 1280 models, 2021. Available from: https://github.com/ultralytics/yolov5. |
[44] | I. Loshchilov, F. Hutter, Sgdr: Stochastic gradient descent with warm restarts, preprint, arXiv: 1608.03983. |
[45] | W. Hao, S. Zhili, Improved mosaic: Algorithms for more complex images, in Journal of Physics: Conference Series, 1684 (2020), 012094. https://doi.org/10.1088/1742-6596/1684/1/012094 |
1. | Linze Qian, Xianliang Ge, Zhao Feng, Sujie Wang, Jingjia Yuan, Yunxian Pan, Hongqi Shi, Jie Xu, Yu Sun, Brain Network Reorganization During Visual Search Task Revealed by a Network Analysis of Fixation-Related Potential, 2023, 31, 1534-4320, 1219, 10.1109/TNSRE.2023.3242771 | |
2. | Ricardo Bruña, Fernando Maestú, David López-Sanz, Anto Bagic, Ann D. Cohen, Yue-Fang Chang, Yu Cheng, Jack Doman, Ted Huppert, Tae Kim, Rebecca E. Roush, Beth E. Snitz, James T. Becker, Sex Differences in Magnetoencephalography-Identified Functional Connectivity in the Human Connectome Project Connectomics of Brain Aging and Dementia Cohort, 2022, 12, 2158-0014, 561, 10.1089/brain.2021.0059 | |
3. | F. Miraglia, F. Vecchio, P. Bramanti, P.M. Rossini, Small-worldness characteristics and its gender relation in specific hemispheric networks, 2015, 310, 03064522, 1, 10.1016/j.neuroscience.2015.09.028 | |
4. | Monika Lewandowska, Krzysztof Tołpa, Jacek Rogala, Tomasz Piotrowski, Joanna Dreszer, Multivariate multiscale entropy (mMSE) as a tool for understanding the resting-state EEG signal dynamics: the spatial distribution and sex/gender-related differences, 2023, 19, 1744-9081, 10.1186/s12993-023-00218-7 | |
5. | Yingying Zhou, Yicheng Long, Sex differences in human brain networks in normal and psychiatric populations from the perspective of small-world properties, 2024, 15, 1664-0640, 10.3389/fpsyt.2024.1456714 |