Facial makeup transfer is a special form of image style transfer. For the reference makeup image with large-pose, improving the quality of the image generated after makeup transfer is still a challenging problem worthy of discussion. In this paper, a large-pose makeup transfer algorithm based on generative adversarial network (GAN) is proposed. First, a face alignment module (FAM) is introduced to locate the key points, such as the eyes, mouth and skin. Secondly, a face parsing module (FPM) and face parsing losses are designed to analyze the source image and extract the face features. Then, the makeup style code is extracted from the reference image and the makeup transfer is completed through integrating facial features and makeup style code. Finally, a large-pose makeup transfer (LPMT) dataset is collected and constructed. Experiments are carried out on the traditional makeup transfer (MT) dataset and the new LPMT dataset. The results show that the image quality generated by the proposed method is better than that of the latest method for large-pose makeup transfer.
Citation: Qiming Li, Tongyue Tu. Large-pose facial makeup transfer based on generative adversarial network combined face alignment and face parsing[J]. Mathematical Biosciences and Engineering, 2023, 20(1): 737-757. doi: 10.3934/mbe.2023034
[1] | Yijun Lou, Li Liu, Daozhou Gao . Modeling co-infection of Ixodes tick-borne pathogens. Mathematical Biosciences and Engineering, 2017, 14(5&6): 1301-1316. doi: 10.3934/mbe.2017067 |
[2] | Marco Tosato, Xue Zhang, Jianhong Wu . A patchy model for tick population dynamics with patch-specific developmental delays. Mathematical Biosciences and Engineering, 2022, 19(5): 5329-5360. doi: 10.3934/mbe.2022250 |
[3] | Guo Lin, Shuxia Pan, Xiang-Ping Yan . Spreading speeds of epidemic models with nonlocal delays. Mathematical Biosciences and Engineering, 2019, 16(6): 7562-7588. doi: 10.3934/mbe.2019380 |
[4] | Ardak Kashkynbayev, Daiana Koptleuova . Global dynamics of tick-borne diseases. Mathematical Biosciences and Engineering, 2020, 17(4): 4064-4079. doi: 10.3934/mbe.2020225 |
[5] | Holly Gaff . Preliminary analysis of an agent-based model for a tick-borne disease. Mathematical Biosciences and Engineering, 2011, 8(2): 463-473. doi: 10.3934/mbe.2011.8.463 |
[6] | Holly Gaff, Robyn Nadolny . Identifying requirements for the invasion of a tick species and tick-borne pathogen through TICKSIM. Mathematical Biosciences and Engineering, 2013, 10(3): 625-635. doi: 10.3934/mbe.2013.10.625 |
[7] | Maeve L. McCarthy, Dorothy I. Wallace . Optimal control of a tick population with a view to control of Rocky Mountain Spotted Fever. Mathematical Biosciences and Engineering, 2023, 20(10): 18916-18938. doi: 10.3934/mbe.2023837 |
[8] | Pengfei Liu, Yantao Luo, Zhidong Teng . Role of media coverage in a SVEIR-I epidemic model with nonlinear incidence and spatial heterogeneous environment. Mathematical Biosciences and Engineering, 2023, 20(9): 15641-15671. doi: 10.3934/mbe.2023698 |
[9] | Chang-Yuan Cheng, Shyan-Shiou Chen, Xingfu Zou . On an age structured population model with density-dependent dispersals between two patches. Mathematical Biosciences and Engineering, 2019, 16(5): 4976-4998. doi: 10.3934/mbe.2019251 |
[10] | Yongli Cai, Yun Kang, Weiming Wang . Global stability of the steady states of an epidemic model incorporating intervention strategies. Mathematical Biosciences and Engineering, 2017, 14(5&6): 1071-1089. doi: 10.3934/mbe.2017056 |
Facial makeup transfer is a special form of image style transfer. For the reference makeup image with large-pose, improving the quality of the image generated after makeup transfer is still a challenging problem worthy of discussion. In this paper, a large-pose makeup transfer algorithm based on generative adversarial network (GAN) is proposed. First, a face alignment module (FAM) is introduced to locate the key points, such as the eyes, mouth and skin. Secondly, a face parsing module (FPM) and face parsing losses are designed to analyze the source image and extract the face features. Then, the makeup style code is extracted from the reference image and the makeup transfer is completed through integrating facial features and makeup style code. Finally, a large-pose makeup transfer (LPMT) dataset is collected and constructed. Experiments are carried out on the traditional makeup transfer (MT) dataset and the new LPMT dataset. The results show that the image quality generated by the proposed method is better than that of the latest method for large-pose makeup transfer.
Lyme disease accounts for over 90
Ticks are capable of moving only very short distances independently, so their fast and large scale spatial spread cannot be attributed solely to their own mobility. Rather, large-scale changes in tick distribution arise as a consequence of the movement of ticks by the vertebrate hosts to which they attach while feeding (see, e.g., [4,5,10,15]). Among such hosts are, in the order of the distances they can move, white-footed mice Peromyscus leucopus, white-tailed deer Odocoileus virginianus, and some migratory birds. Mice can be infected by this bacterium and therefore can transmit the pathogen, and can also transport the tick nymphs. In [4], a reaction diffusion system is proposed to model the advance of the natural infection cycle mediated by the white-footed mouse. Although white-tailed deer diffusion is also mentioned in the model, since the deer cannot be infected and accordingly do not transmit the bacterium the focus of [4] is on the transmission dynamics, the role of deer diffusion in the spatial spread of the pathogen is not discussed in detail in [4]. In relation to birds, in addition to the works [3,18], there have been some works that quantitatively model the role of bird migration in the tick's range expansion, see, e.g., [23].
This paper focuses on the role of white-tailed deer in spreading the ticks. Over the past 50 years, white-tailed deer populations have undergone explosive population growth due to reversion of agricultural lands to forest and restrictions on hunting. This expanding deer population is believed to have facilitated blacklegged tick expansion throughout the Northeast and Midwest [2]. To understand this, we first point out an important difference between birds and deer in transporting I. scapularis and B. burgdorferi. On the one hand, birds carrying the infected immature stages of the tick are capable of traveling longer distances than deer. On the other hand, if immature ticks dropping from birds are to establish a new population they must survive one or two moults and then find a mate, which will be unlikely if they are dropped far from existing populations. In contrast, during fall deer will be carrying numerous already-mated female ticks, each of which becomes engorged with blood while on the deer and then falls to the ground ready to lay approximately 2000 eggs that can form the basis of a new tick population at that location. This observation seems to suggest that deer play a more important role in the tick's range expansion in regions inhabited by white-tailed deer.
In this study we use a spatial model to quantitatively investigate the role of white-tailed deer dispersal in the spatial spread of I. scapularis (and hence B. burgdorferi). Our model combines age structure with the dispersal of deer leading to a system with two time delays and spatial nonlocality resulting from the dispersal of the deer when the adult ticks are attached to them enjoying blood meals. We will begin, in the next section, with a detailed derivation of the model.
To assess the rate at which deer can transport blacklegged ticks into new areas, we develop a differential equation model with spatial effects that describes the stage-structured tick population and its transport by deer. Blacklegged ticks typically undergo a 2-year life cycle in which the larvae quest for a host (typically a small mammal or bird), and if successful feed for several days, drop back to the ground, and later moult into a nymph. The nymph then quests, feeds and moults -again typically on a small mammal. The final adult life stage (which is male or female) then quests and feeds (typically on a deer), falls to the ground when fully engorged and then produces approximately
The mouse population (which feeds the immature ticks) and the deer population (which feeds the adult ticks) are assumed to be homogeneous and constant over time in both the tick-infested and tick-free regions. Mouse home ranges are much smaller than those of deer, so the only significant movement of ticks is by deer transporting adult females while they feed. Because of this, and for simplicity, we assume that larvae and nymphs do not disperse. Since the average time a tick spends attached to a deer is around one week, the relevant deer movements are assumed to be those undertaken in the course of each deer's normal home range activity, rather than long-distance directional movements associated with natal dispersal or seasonal migration.
Consider a spatial domain
{∂L(x,t)∂t=br4e−d4τ1Af(x,t−τ1)−d1L(x,t)−r1L(x,t),∂N(x,t)∂t=r1g(L(x,t))−d2N(x,t)−r2N(x,t),∂Aq(x,t)∂t=r2N(x,t)−d3Aq(x,t)−r3Aq(x,t),∂Af(x,t)∂t=r32∫Ωk(x,y)e−d3τ2Aq(y,t−τ2)dy−r4Af(x,t)−d4Af(x,t), | (1) |
where the parameters are defined in Table 1. The table also gives the values of the parameters for the stage-structured components of the model which were all, except for
Parameters | Meaning | Value |
Birth rate of tick | ||
average time that a questing larvae needs to feed and moult | ||
average time that a questing nymph needs to feed and moult | ||
average time that a questing adult needs to successfully attach to a deer | ||
Proportion of fed adults that can lay eggs | 0.03 | |
per-capita death rate of larvae | 0.3 | |
per-capita death rate of nymphs | 0.3 | |
per-capita death rate of questing adults | 0.1 | |
per-capita death rate of fed adults | 0.1 | |
average time between last blood feeding and hatch of laid eggs | 20 days | |
average time tick is attached to a deer |
The structure of system (1) can be visualized with the help of the diagram in Fig. 1.
A very important aspect of model (1) is the term with the integral, which models the transport of adult ticks by deer. Note that
(∂∂t+∂∂a)udeer(x,t,a)=−d3udeer(x,t,a)+D∇2udeer(x,t,a),forx∈Ω,a∈(0,τ2),t>0, | (2) |
where
Adeer(x,t)=∫τ20udeer(x,t,a)da. | (3) |
Differentiating (3) and using (2) gives
∂Adeer(x,t)∂t=udeer(x,t,0)−udeer(x,t,τ2)−d3Adeer(x,t)+D∇2Adeer(x,t). | (4) |
The rate at which ticks drop off the deer after feeding is
uξdeer(x,a)=udeer(x,a+ξ,a)ed3a. | (5) |
Differentiating with respect to
∂uξdeer(x,a)∂a=D∇2uξdeer(x,a),x∈Ω. |
This is the heat equation, and its solution can be expressed in the form
uξdeer(x,a)=∫ΩK(x,y,a)uξdeer(y,0)dy | (6) |
where the Green's function
∂K(x,y,a)∂a=D∇2xK(x,y,a),K(x,y,0)=δ(x−y) | (7) |
and the boundary conditions to which the deer are subjected at
udeer(x,t,τ2)=e−d3τ2∫ΩK(x,y,τ2)udeer(y,t−τ2,0)dy. |
But
udeer(x,t,0)=r3Aq(x,t). |
Therefore
udeer(x,t,τ2)=e−d3τ2∫ΩK(x,y,τ2)r3Aq(y,t−τ2)dy. |
After the insertion of a factor
k(x,y)=K(x,y,τ2). |
The kernel
k(x,y)=K(x,y,τ2)=1l[1+∞∑n=1{cosnπl(x−y)+cosnπl(x+y)}e−D(nπ/l)2τ2]. |
If
k(x,y)=1l∞∑n=1{cosnπl(x−y)−cosnπl(x+y)}e−D(nπ/l)2τ2. |
We are interested mainly in the case when
k(x,y)=Γ(x−y),whereΓ(z):=1√4Dτ2πe−z24Dτ2 | (8) |
We point out that, just recently, starting from a version of the McKendrick-von Foerster equation without spatial effects but with temporal periodicity, Liu et al [14] also derived a periodic model with age structure for a tick population. A threshold dynamics result is obtained for the model in [14].
To prevent the tick population from increasing to unrealistic levels, density dependence is incorporated into model (1) through a simple nonlinear relationship between questing larvae and questing nymphs. The biological basis for this relationship is that there should be an upper limit to the number of larvae that the mouse population is able to feed -an equivalent relationship was assumed in [21]. This leads us to propose the following expression for the function
g(L)={NcapLcapLforL∈[0,Lcap],NcapforL∈[Lcap,∞). | (9) |
The function
g(L)=Ncapk2Lk1+k2L=NcapLk1/k2+L=NcapLh+L, | (10) |
which is smooth and yet captures the main features of the function given by (9). In the remainder of this paper, we always use (10) for
For the majority of this paper we have in mind model (1) for
Associated to (1) are the following biologically and mathematically meaningful initial conditions:
{L(x,0),N(x,0)are continuous forx∈ΩwithL(x,0)≥0,N(x,0)≥0;Aq(x,s)is continuous for(x,s)∈Ω×[−τ2,0]withAq(x,s)≥0;Af(x,s)is continuous for(x,s)∈Ω×[−τ1,0]withAf(x,s)≥0. | (11) |
Using the method of steps, one can easily see that the initial value problem (1)-(11) has a unique solution for
{L(x,t)=L(x,0)e−(d1+r1)t+br4e−d4τ1∫t0Af(x,s−τ1)e(d1+r1)(s−t)ds,N(x,t)=N(x,0)e−(d2+r2)t+r1Ncap∫t0L(x,s)h+L(x,s)e(d2+r2)(s−t)ds,Aq(x,t)=Aq(x,0)e−(d3+r3)t+r2∫t0N(x,s)e(d3+r3)(s−t)ds,Af(x,t)=Af(x,0)e−(d4+r4)t+r32e−d3τ2∫t0∫Ωk(x,y)Aq(y,s−τ2)e(d4+r4)(s−t)dyds. | (12) |
Let
Next, we prove an important property of the kernel
Proposition 1. If
∫Ωk(x,y)dx=1,forally∈Ω. |
If
∫Ωk(x,y)dx<1,forally∈Ω. |
Proof. When
∂∂a∫ΩK(x,y,a)dx=D∫Ω∇2xK(x,y,a)dx=D∫∂Ω∇xK(x,y,a)⋅ndS=0 |
where
∫Ωk(x,y)dx=∫ΩK(x,y,τ2)dx=∫ΩK(x,y,0)dx=∫Ωδ(x−y)dx=1. |
In the case of homogeneous Dirichlet boundary conditions we have
Next, we show that the solution is bounded for
∂N(x,t)∂t≤r1Ncap−(d2+r2)N(x,t). |
This implies that
lim supt→∞N(x,t)≤r1Ncapd2+r2,for allx∈Ω, |
proving boundedness of
Irrespective of the domain
{∂u1(x,t)∂t=br4e−d4τ1u4(x,t−τ1)−(d1+r1)u1(x,t),∂u2(x,t)∂t=r1Ncaphu1(x,t)−(d2+r2)u2(x,t),∂u3(x,t)∂t=r2u2(x,t)−(d3+r3)u3(x,t),∂u4(x,t)∂t=r32∫Ωk(x,y)e−d3τ2u3(y,t−τ2)dy−(d4+r4)u4(x,t). | (13) |
Consider the case
R0=br4e−d4τ1d1+r1⋅(r1/h)Ncapd2+r2⋅r2d3+r3⋅(r3/2)e−d3τ2d4+r4=Ncapb2he−(d3τ2+d4τ1)4∏i=1ridi+ri. | (14) |
From the biological interpretation of
Substituting the ansatz
{λψ1(x)=br4e−d4τ1e−λτ1ψ4(x)−(d1+r1)ψ1(x),λψ2(x)=r1Ncaphψ1(x)−(d2+r2)ψ2(x),λψ3(x)=r2ψ2(x)−(d3+r3)ψ3(x),λψ4(x)=r32e−d3τ2e−λτ2∫Ωk(x,y)ψ3(y)dy−(d4+r4)ψ4(x). | (15) |
We shall show that the dominant eigenvalue
Proposition 2. If
Proof. Let
ψ4(x)=λ+d1+r1br4e−d4τ1e−λτ1ψ1(x). | (16) |
Similarly, from the second and third equations of (15),
ψ1(x)=(λ+d2+r2)hr1Ncapψ2(x), | (17) |
and
ψ2(x)=λ+d3+r3r2ψ3(x). | (18) |
The fourth equation of (15) then yields
e−λτ1e−λτ2∫Ωk(x,y)ψ3(y)dy=2h(λ+d4+r4)(λ+d1+r1)(λ+d2+r2)(λ+d3+r3)bNcape−d4τ1e−d3τ2r1r2r3r4ψ3(x),=2h∏4i=1(λ+di+ri)bNcape−(d3τ2+d4τ1)∏4i=1riψ3(x) |
so that
e−λτ1e−λτ2∫Ωk(x,y)ψ3(y)dy=∏4i=1(λ+di+ri)R0∏4i=1(di+ri)ψ3(x). | (19) |
Integrating with respect to
f1(λ)=f2(λ) | (20) |
where
f1(x)=R0e−(τ1+τ2)x4∏i=1(di+ri), | (21) |
f2(x)=4∏i=1(x+di+ri). | (22) |
Noting that
R0e−(τ1+τ2)(Reλ)4∏i=1(di+ri)=4∏i=1|λ+di+ri|≥4∏i=1|Reλ+di+ri|, |
that is,
Finally, by the aforementioned properties of
Remark. The above argument fails in the case of homogeneous Dirichlet boundary conditions applied to a finite domain
∏4i=1|λ+di+ri|R0∏4i=1(di+ri)|ψ3(x)|=e−(Reλ)(τ1+τ2)|∫Ωk(x,y)ψ3(y)dy|≤e−(Reλ)(τ1+τ2)∫Ωk(x,y)|ψ3(y)|dy. |
Integrating over
∏4i=1|Reλ+di+ri|R0∏4i=1(di+ri)≤∏4i=1|λ+di+ri|R0∏4i=1(di+ri)≤e−(Reλ)(τ1+τ2) |
which implies that
(Fϕ)(x)=∫Ωk(x,y)ϕ(y)dy,x∈Ω | (23) |
where
In the case
L+=h(R0−1),N+=d3+r3r2A+q,A+q=d4+r4r32e−d3τ2A+f,A+f=d1+r1br4e−d4τ1L+. |
When this persistence (positive) steady state exists, it is locally asymptotically stable. The arguments are similar to those just described for studying the linear stability of the extinction steady state. Linearizing system (1) at
{∂v1(x,t)∂t=br4e−d4τ1v4(x,t−τ1)−(d1+r1)u1(x,t),∂v2(x,t)∂t=r1NcaphR20v1(x,t)−(d2+r2)v2(x,t),∂v3(x,t)∂t=r2v2(x,t)−(d3+r3)v3(x,t),∂v4(x,t)∂t=r32∫Ωk(x,y)e−d3τ2v3(y,t−τ2)dy−(d4+r4)v4(x,t). | (24) |
This linear system is the same as (13) except that
In this section, we consider
L(x,t)=φ1(x+ct),N(x,t)=φ2(x+ct),Aq(x,t)=φ3(x+ct),Af(x,t)=φ4(x+ct). |
Here,
{cφ′1(s)=br4e−d4τ1φ4(s−cτ1)−(d1+r1)φ1(s),cφ′2(s)=r1g(φ1(s))−(d2+r2)φ2(s),cφ′3(s)=r2φ2(s)−(d3+r3)φ3(s),cφ′4(s)=r32∫+∞−∞Γ(z)e−d3τ2φ3(s−z−cτ2)dz−(d4+r4)φ4(s), | (25) |
where
We are interested in traveling wave fronts that connect
lims→−∞φi=0,lims→+∞φi(s)=φ+i,i=1,2,3,4. | (26) |
Linearizing system (25) at the trivial equilibrium
{cφ′1(s)=br4e−d4τ1φ4(s−cτ1)−(d1+r1)φ1(s),cφ′2(s)=r1Ncaphφ1(s)−(d2+r2)φ2(s),cφ′3(s)=r2φ2(s)−(d3+r3)φ3(s),cφ′4(s)=r32∫+∞−∞Γ(z)e−d3τ2φ3(s−z−cτ2)dz−(d4+r4)φ4(s). | (27) |
The characteristic equation associated with (27) is
P(λ,c)=0 | (28) |
where
P(λ,c)=|cλ+d1+r100−br4e−d4τ1e−cτ1λ−r1Ncaphcλ+d2+r2000−r2cλ+d3+r3000−r32e−d3τ2e−cτ2λˉk(λ)cλ+d4+r4|, |
where
ˉk(λ)=∫+∞−∞Γ(y)e−λydy=1√4Dτ2π∫+∞−∞e−y24Dτ2e−λydy=eDτ2λ2. |
Evaluating the determinant on the left hand side of (28), we obtain
4∏i=1[cλ+(di+ri)]−r1r2r3r4bNcap2he−(d4τ1+d3τ2)eDτ2λ2−c(τ1+τ2)λ=0; |
that is
4∏i=1[cλ+(di+ri)]−R0[4∏i=1(di+ri)]eDτ2λ2−c(τ1+τ2)λ=0. | (29) |
Generically, the behaviour of solutions of (25)-(26) at
Set
H1(λ,c)=4∏i=1[cλ+(di+ri)],H2(λ,c)=R0[4∏i=1(di+ri)]eDτ2λ2−c(τ1+τ2)λ. |
Then (29) can be rewritten as
c∗=minc>0{c:H1(λ,c)=H2(λ,c)haspositiverealrootswithrespecttoλ} |
and is determined by the tangential conditions:
H1(λ,c)=H2(λ,c),and∂H1∂λ(λ,c)=∂H2∂λ(λ,c),λ>0. | (30) |
There is no explicit formula for
Based on (30), we may also numerically explore the dependence of
From the above we have seen that, for
Although we defer to another paper the proof that
(L+,N+,A+q,A+f)=(1.72×103,1.43×103,1.43×103,60.63). |
Fig. 4 shows that there is no traveling wave solution for
Next, we numerically simulate solutions of the original initial value problem (1) to observe the time evolution of solutions toward a traveling wave front. To estimate the spreading rate, we use the same approach as was mentioned in [16]. The idea is to assume some threshold population density
c=limt→∞dˆx(t)dt. |
With the model parameter values given above, Fig. 6(a)-(b) and Fig. 7(a)-(b) show the evolution of the
In this paper, based on the fact that blacklegged ticks are only capable of moving very short distances by themselves and the general belief that dispersal of ticks over appreciable distances is via transport on the white tailed deer on which the adult ticks feed, we developed a spatial differential equation model for a stage-structured tick population. In addition to well-posedness, we identified a basic reproduction ratio
We also discussed traveling wave front solutions to the model that connect
We also numerically simulated the solutions of the original initial value problem (1). The results not only demonstrate the evolution of solutions toward a traveling wave front, but also suggest that
Theoretically confirming that
In this paper, we have concentrated mainly on the case when the spatial domain is
To solve the wave equations (25) with asymptotic boundary condition (26) numerically, we truncate
{cφ′1(sj)=br4e−d4τ1φ4(sj−cτ1)−(d1+r1)φ1(sj),cφ′2(sj)=r1g(φ1(sj))−(d2+r2)φ2(sj),cφ′3(sj)=r2φ2(sj)−(d3+r3)φ3(sj),cφ′4(sj)=r32e−d3τ2∫+∞−∞k(sj−y−cτ2)φ3(y)dy−(d4+r4)φ4(sj). | (31) |
The asymptotic boundary conditions
φi(−M)=0,φi(M)=φ∗i;φi(s)=0,s<−M;φi(s)=φ∗i,s>M,i=1,…,4. |
It then follows that
f1(φ3,sj):=∫+∞−∞k(y)φ3(sj−y−cτ2)dy=∫+∞−∞k(sj−y−cτ2)φ3(y)dy=(∫−M−∞+∫M−M+∫+∞M)k(sj−y−cτ2)φ3(y)dy=∫M−Mk(sj−y−cτ2)φ3(y)dy+φ3(M)∫+∞Mk(sj−y−cτ2)dy. |
Applying the composite trapezium rule for integrals, we obtain
∫M−Mk(sj−y−cτ2)φ3(y)dy=△2[k(sj−s1−cτ2)φ3(s1)+22n∑l=2k(sj−sl−cτ2)φ3(sl)+k(sj−s2n+1−cτ2)φ3(s2n+1)], | (32) |
and
∫+∞Mk(sj−y−cτ2)dy=∫sj−M−cτ2−∞k(y)dy=12(1−∫−sj+M+cτ2sj−M−cτ2k(y)dy) |
=12{1−△2[k(sj−M−cτ2)+k(−sj+M+cτ2)+22[2n+m2−(j−1)]∑l=2k(sj−M−cτ2+(l−1)△)]}. |
Then
f1(φ3,sj)=△2n∑l=2k(sj−sl−cτ2)φ3(sl)+f2(sj) |
where
f2(sj)=△2[k(sj−s1−cτ2)φ3(s1)+k(sj−s2n+1−cτ2)φ3(s2n+1)]+φ3(M)∫+∞Mk(sj−y−cτ2)dy=△2k(sj−M−cτ2)φ∗3+φ∗3∫+∞Mk(sj−y−cτ2)dy=△2k(sj−M−cτ2)φ∗3+φ∗32{1−△2[k(sj−M−cτ2)+k(−sj+M+cτ2)]−△2[2n+m2−(j−1)]∑l=2k(sj−M−cτ2+(l−1)△)}=φ∗32{1−△2[2n+m2−(j−1)]∑l=2k(sj−M−cτ2+(l−1)△)}. |
Let
{cφ1(sj+1)−φ1(sj−1)2△=br4e−d4τ1φ4(sj−m1)−(d1+r1)φ1(sj),cφ2(sj+1)−φ2(sj−1)2△=r1g(φ1(sj))−(d2+r2)φ2(sj),cφ3(sj+1)−φ3(sj−1)2△=r2φ2(sj)−(d3+r3)φ3(sj),cφ4(sj+1)−φ4(sj−1)2△=r32e−d3τ2f1(φ3,sj)−(d4+r4)φ4(sj), | (33) |
for
{cφ1(sj+1)−cφ1(sj−1)−2△br4e−d4τ1φ4(sj−m1)+2△(d1+r1)φ1(sj)=0,cφ2(sj+1)−cφ2(sj−1)−2△r1g(φ1(sj))+2△(d2+r2)φ2(sj)=0,cφ3(sj+1)−cφ3(sj−1)−2△r2φ2(sj)+2△(d3+r3)φ3(sj)=0,cφ4(sj+1)−cφ4(sj−1)−△r3e−d3τ2f1(φ3,sj)+2△(d4+r4)φ4(sj)=0 | (34) |
for
cφ2(sj+1)−cφ2(sj−1)−2h△r1Ncapφ1(sj)+2△(d2+r2)φ2(sj)+chφ1(sj)φ2(sj+1)−chφ1(sj)φ2(sj−1)+2h△(d2+r2)φ1(sj)φ2(sj)=0. |
Thus, system (34) can be expressed as
[M1100M14M21M22000M32M33000M43M44][φ1(s2)⋮φ1(s2n)φ2(s2)⋮φ2(s2n)φ3(s2)⋮φ3(s2n)φ4(s2)⋮φ4(s2n)]+[C1C2C3C4]=0, | (35) |
where
Mii=[2△(di+ri)c0−c2△(di+ri)c⋱−c2△(di+ri)c0−c2△(di+ri)],i=1,…,4, |
M14=[0⋮0−2△br4e−d4τ1⋱−2△br4e−d4τ10…0], |
M21=[−2h△r1Ncap0⋱0−2h△r1Ncap], |
M32=[−2△r20⋱0−2△r2], |
ˆM43=[k(s2−s2−cτ2)k(s2−s3−cτ2)…k(s2−s2n−cτ2)k(s3−s2−cτ2)k(s3−s3−cτ2)…k(s3−s2n−cτ2)⋮k(s2n−s2−cτ2)k(s2n−s3−cτ2)…k(s2n−s2n−cτ2)], |
C1=[0⋮0cφ∗1],C3=[0⋮0cφ∗3],C4=[−△r3e−d3τ2f2(s2)−△r3e−d3τ2f2(s3)⋮cφ∗4−△r3e−d3τ2f2(s2n)], |
C2=[1hφ1(s2)[cφ2(s3)+2△(d2+r2)φ2(s2)]1hφ1(s3)[cφ2(s4)−cφ2(s2)+2△(d2+r2)φ2(s3)]⋮1hφ1(s2n−1)[cφ2(s2n)−cφ2(s2n−2)+2△(d2+r2)φ2(s2n−1)]cφ∗2+1hφ1(s2n)[cφ∗2−cφ2(s2n−1)+2△(d2+r2)φ2(s2n)]]. |
The algebraic system (35) can then be solved numerically using Matlab.
This work was initiated at the Current Topics Workshop: Spatial-Temporal Dynamics in Disease Ecology and Epidemiology, held at the Mathematical Biosciences Institute (MBI) at Ohio State University during October 10-14,2011. The workshop was organized by R. Liu, J. Tsao, J. Wu and X. Zou, and was funded by the NSF through the MBI. We thank Dr. G. Hickling for bringing this problem to a group discussion which stimulated this research project. We also thank those participants at the workshop who offered helpful suggestions and advice on the model, and particularly Drs. Hickling and Tsao for their valuable input during the discussions at the MBI and for providing some valuable references.
[1] | W. S. Tong, C. K. Tang, M. S. Brown, Y. Q. Xu, Example-based cosmetic transfer, in 15th Pacific Conference on Computer Graphics and Applications (PG'07), (2007), 211-218. https://doi.org/10.1109/PG.2007.31 |
[2] | S. Liu, X. Ou, R. Qian, W. Wang, X. Cao, Makeup like a superstar: deep localized makeup transfer network, preprint, arXiv: 1604.07102. |
[3] | D. Guo, T. Sim, Digital face makeup by example, in 2009 IEEE Conference on Computer Vision and Pattern Recognition, (2009), 73-79. https://doi.org/10.1109/CVPR.2009.5206833 |
[4] | L. Xu, Y. Du, Y. Zhang, An automatic framework for example-based virtual makeup, in 2013 IEEE International Conference on Image Processing, (2013), 3206-3210. https://doi.org/10.1109/ICIP.2013.6738660 |
[5] | C. Li, K. Zhou, S. Lin, Simulating makeup through physics-based manipulation of intrinsic image layers, in 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2015), 4621-4629. https://doi.org/10.1109/CVPR.2015.7299093 |
[6] | W. Xu, C. Long, R. Wang, G. Wang, DRB-GAN: A dynamic resblock generative adversarial network for artistic style transfer, in 2021 IEEE/CVF International Conference on Computer Vision (ICCV), (2021), 6383-6392. https://doi.org/10.1109/ICCV48922.2021.00632 |
[7] | H. Chen, L. Zhao, H. Zhang, Z. Wang, Z. Zuo, A. Li, et al., Diverse image style transfer via invertible cross-space mapping, in 2021 IEEE/CVF International Conference on Computer Vision (ICCV), (2021), 14860-14869. https://doi.org/10.1109/ICCV48922.2021.01461 |
[8] | Y. Hou, L. Zheng, Visualizing adapted knowledge in domain transfer, in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2021), 13824-13833. https://doi.org/10.1109/CVPR46437.2021.01361 |
[9] | X. Zhang, Z. Cheng, X. Zhang, H. Liu, Posterior promoted GAN with distribution discrimi-nator for unsupervised image synthesis, in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2021), 6519-6528. https://doi.org/10.1109/CVPR46437.2021.00645 |
[10] | P. Wang, Y. Li, N. Vasconcelos, Rethinking and improving the robustness of image style transfer, in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2021), 124-133. https://doi.org/10.1109/CVPR46437.2021.00019 |
[11] | J. Y. Zhu, T. Park, P. Isola, A. A. Efros, Unpaired image-to-image translation using cycle-consistent adversarial networks, in 2017 IEEE International Conference on Computer Vision (ICCV), (2017), 2223-2232. https://doi.org/10.1109/ICCV.2017.244 |
[12] | H. Chang, J. Lu, F. Yu, A. Finkelstein, Pairedcyclegan: Asymmetric style transfer for applying and removing makeup, in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2018), 40-48. https://doi.org/10.1109/CVPR.2018.00012 |
[13] | H. J. Chen, K. M. Hui, S. Y. Wang, L. W. Tsao, H. H. Shuai, W. H. Cheng, Beautyglow: On-demand makeup transfer framework with reversible generative network, in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2019), 10042-10050. https://doi.org/10.1109/CVPR.2019.01028 |
[14] | T. Li, R. Qian, C. Dong, S. Liu, Q. Yan, W. Zhu, et al., Beautygan: Instance-level facial makeup transfer with deep generative adversarial network, in Proceedings of the 26th ACM international conference on Multimedia, (2018), 645-653. https://doi.org/10.1145/3240508.3240618 |
[15] | T. Nguyen, A. T. Tran, M. Hoai, Lipstick ain't enough: beyond color matching for in-the-wild makeup transfer, in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2021), 13305-13314. https://doi.org/10.1109/cvpr46437.2021.01310 |
[16] | Z. Sun, Y. Chen, S. Xiong, SSAT: A symmetric semantic-aware transformer network for makeup transfer and removal, in Proceedings of the AAAI Conference on Artificial Intelligence, 36 (2022), 2325-2334. https://doi.org/10.1609/aaai.v36i2.20131 |
[17] | Z. Huang, Z. Zheng, C. Yan, H. Xie, Y. Sun, J. Wang, et al., Real-world automatic makeup via identity preservation makeup net, in International Joint Conferences on Artificial Intelligence Organization, (2020), 652-658. https://doi.org/10.24963/ijcai.2020/91 |
[18] | Z. Wan, H. Chen, J. An, W. Jiang, C. Yao, J. Luo, et al., Facial attribute transformers for precise and robust makeup transfer, in 2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV), (2022), 1717-1726. https://doi.org/10.1109/wacv51458.2022.00317 |
[19] | J. Lee, E. Kim, Y. Lee, D. Kim, J. Chang, J. Choo, Reference-based sketch image colorization using augmented-self reference and dense semantic correspondence, in 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2020), 5800–5809. https://doi.org/10.1109/cvpr42600.2020.00584 |
[20] | W. Jiang, S. Liu, C. Gao, J. Cao, R. He, J. Feng, et al., Psgan: Pose and expression robust spatial-aware gan for customizable makeup transfer, in 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2020), 5194–5202. https://doi.org/10.1109/CVPR42600.2020.00524 |
[21] | A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, et al., Attention is all you need, in Advances in Neural Information Processing Systems, 30 (2017), 5998-6008. |
[22] | H. Deng, C. Han, H. Cai, G. Han, S. He, Spatially-invariant style-codes controlled makeup transfer, in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2021), 6549-6557. https://doi.org/10.1109/CVPR46437.2021.00648 |
[23] |
K. Zhang, Z. Zhang, Z. Li, Y. Qiao, Joint face detection and alignment using multitask cascaded convolutional networks, IEEE Signal Process Lett., 23 (2016), 1499-1503. https://doi.org/10.1109/LSP.2016.2603342 doi: 10.1109/LSP.2016.2603342
![]() |
[24] | Y. Wang, J. M. Solomon, Prnet: Self-supervised learning for partial-to-partial registration, in 33rd Conference on Neural Information Processing Systems (NeurIPS 2019), 32 (2019), 8812-8824. Available from: https://proceedings.neurips.cc/paper/2019/file/ebad33b3c9fa1d10327bb55f9e79e2f3-Paper.pdf. |
[25] | K. Simonyan, A. Zisserman, Very deep convolutional networks for large-scale image recognition, preprint, arXiv: 1409.1556. |
[26] | D. P. Kingma, P. Dhariwal, Glow: Generative flow with invertible 1x1 convolutions, in 32nd Conference on Neural Information Processing Systems (NeurIPS 2018), 31 (2018), 10236-10245. Available from: https://proceedings.neurips.cc/paper/2018/file/d139db6a236200b21cc7f752979132d0-Paper.pdf. |
[27] | K. He, X. Zhang, S. Ren, J. Sun, Deep residual learning for image recognition, in 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2016), 770-778. https://doi.org/10.1109/CVPR.2016.90 |
[28] | C. Yu, J. Wang, C. Peng, C. Gao, G. Yu, N. Sang, Bisenet: Bilateral segmentation network for real-time semantic segmentation, in Computer Vision – ECCV 2018, 11217 (2018), 334-349. https://doi.org/10.1007/978-3-030-01261-8_20 |
[29] | T. Karras, S. Laine, T. Aila, A style-based generator architecture for generative adversarial networks, in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2019), 4401-4410. https://doi.org/10.1109/CVPR.2019.00453 |
[30] | X. Huang, S. Belongie, Arbitrary style transfer in real-time with adaptive instance normalization, in 2017 IEEE International Conference on Computer Vision (ICCV), (2017), 1501-1510. https://doi.org/10.1109/ICCV.2017.167 |
[31] | I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, et al., Generative adversarial nets, in Proceedings of the 27th International Conference on Neural Information Processing Systems, 2 (2014), 2672–2680. https://dl.acm.org/doi/10.5555/2969033.2969125 |
[32] | J. Johnson, A. Alahi, L. Fei-Fei, Perceptual losses for real-time style transfer and super-resolution, in Computer Vision – ECCV 2016, 9906 (2016), 694-711. https://doi.org/10.1007/978-3-319-46475-6_43 |
[33] | D. P. Kingma, J. Ba, Adam: a method for stochastic optimization, preprint, arXiv: 1412.6980. |
[34] | Y. Lyu, J. Dong, B. Peng, W. Wang, T. Tan, SOGAN: 3D-aware shadow and occlusion robust GAN for makeup transfer, in Proceedings of the 29th ACM International Conference on Multimedia, (2021), 3601-3609. https://doi.org/10.1145/3474085.3475531 |
[35] | J. Liao, Y. Yao, L. Yuan, G. Hua, S. B. Kang, Visual attribute transfer through deep image analogy, preprint, arXiv: 1705.01088. |
[36] | Q. Gu, G. Wang, M. T. Chiu, Y. W. Tai, C. K. Tang, Ladn: Local adversarial disentangling network for facial makeup and de-makeup, in 2019 IEEE/CVF International Conference on Computer Vision (ICCV), (2019), 10481-10490. https://doi.org/10.1109/ICCV.2019.01058 |
[37] | B. Yan, Q. Lin, W. Tan, S. Zhou, Assessing eye aesthetics for automatic multi-reference eye in-painting, in 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2020), 13509-13517. https://doi.org/10.1109/CVPR42600.2020.01352 |
1. | Xiulan Lai, Xingfu Zou, Minimal wave speed and spread speed in a system modelling the geographic spread of black-legged tick Ixodes scapularis, 2020, 269, 00220396, 6400, 10.1016/j.jde.2020.05.002 | |
2. | Ruiwen Wu, Propagation dynamics of a nonlocal spatial Lyme disease model in a time–space periodic habitat, 2023, 72, 14681218, 103843, 10.1016/j.nonrwa.2023.103843 | |
3. | Xiao-Qiang Zhao, The linear stability and basic reproduction numbers for autonomous FDEs, 2023, 0, 1937-1632, 0, 10.3934/dcdss.2023082 | |
4. | Yu-Cai Hao, Guo-Bao Zhang, Juan He, Exponential stability of traveling wavefronts for a system modeling the geographic spread of black-legged tick Ixodes scapularis, 2023, 74, 0044-2275, 10.1007/s00033-023-02014-9 | |
5. | Mingdi Huang, Shi-Liang Wu, Xiao-Qiang Zhao, The principal eigenvalue for partially degenerate and periodic reaction-diffusion systems with time delay, 2023, 371, 00220396, 396, 10.1016/j.jde.2023.06.024 | |
6. | Azmy S. Ackleh, Amy Veprauskas, Aijun Zhang, The impact of dispersal and allee effects on tick invasion: a spatially-explicit discrete-time modelling approach, 2023, 1023-6198, 1, 10.1080/10236198.2023.2285895 |
Parameters | Meaning | Value |
Birth rate of tick | ||
average time that a questing larvae needs to feed and moult | ||
average time that a questing nymph needs to feed and moult | ||
average time that a questing adult needs to successfully attach to a deer | ||
Proportion of fed adults that can lay eggs | 0.03 | |
per-capita death rate of larvae | 0.3 | |
per-capita death rate of nymphs | 0.3 | |
per-capita death rate of questing adults | 0.1 | |
per-capita death rate of fed adults | 0.1 | |
average time between last blood feeding and hatch of laid eggs | 20 days | |
average time tick is attached to a deer |
Parameters | Meaning | Value |
Birth rate of tick | ||
average time that a questing larvae needs to feed and moult | ||
average time that a questing nymph needs to feed and moult | ||
average time that a questing adult needs to successfully attach to a deer | ||
Proportion of fed adults that can lay eggs | 0.03 | |
per-capita death rate of larvae | 0.3 | |
per-capita death rate of nymphs | 0.3 | |
per-capita death rate of questing adults | 0.1 | |
per-capita death rate of fed adults | 0.1 | |
average time between last blood feeding and hatch of laid eggs | 20 days | |
average time tick is attached to a deer |