Most existing deepfake detection methods often fail to maintain their performance when confronting new test domains. To address this issue, we propose a generalizable deepfake detection system to implement style diversification by alternately learning the domain generalization (DG)-based detector and the stylized fake face synthesizer (SFFS). For the DG-based detector, we first adopt instance normalization- and batch normalization-based structures to extract the local and global image statistics as the style and content features, which are then leveraged to obtain the more diverse feature space. Subsequently, contrastive learning is used to emphasize common style features while suppressing domain-specific ones, and adversarial learning is performed to obtain the domain-invariant features. These optimized features help the DG-based detector to learn generalized classification features and also encourage the SFFS to simulate possibly unseen domain data. In return, the samples generated by the SFFS would contribute to the detector's learning of more generalized features from augmented training data. Such a joint learning and training process enhances both the detector's and the synthesizer's feature representation capability for generalizable deepfake detection. Experimental results demonstrate that our method outperforms the state-of-the-art competitors not only in intra-domain tests but particularly in cross-domain tests.
Citation: Jicheng Li, Beibei Liu, Hao-Tian Wu, Yongjian Hu, Chang-Tsun Li. Jointly learning and training: using style diversification to improve domain generalization for deepfake detection[J]. Electronic Research Archive, 2024, 32(3): 1973-1997. doi: 10.3934/era.2024090
[1] | Liping Wang, Runqi Liu, Yangyang Shi . Dynamical analysis of a nonlocal delays spatial malaria model with Wolbachia-infected male mosquitoes release. Electronic Research Archive, 2025, 33(5): 3177-3200. doi: 10.3934/era.2025139 |
[2] | Songbai Guo, Xin Yang, Zuohuan Zheng . Global dynamics of a time-delayed malaria model with asymptomatic infections and standard incidence rate. Electronic Research Archive, 2023, 31(6): 3534-3551. doi: 10.3934/era.2023179 |
[3] | Gaohui Fan, Ning Li . Application and analysis of a model with environmental transmission in a periodic environment. Electronic Research Archive, 2023, 31(9): 5815-5844. doi: 10.3934/era.2023296 |
[4] | Wenxuan Li, Suli Liu . Dynamic analysis of a stochastic epidemic model incorporating the double epidemic hypothesis and Crowley-Martin incidence term. Electronic Research Archive, 2023, 31(10): 6134-6159. doi: 10.3934/era.2023312 |
[5] | Xueyong Zhou, Xiangyun Shi . Stability analysis and backward bifurcation on an SEIQR epidemic model with nonlinear innate immunity. Electronic Research Archive, 2022, 30(9): 3481-3508. doi: 10.3934/era.2022178 |
[6] | Tao Zhang, Mengjuan Wu, Chunjie Gao, Yingdan Wang, Lei Wang . Probability of disease extinction and outbreak in a stochastic tuberculosis model with fast-slow progression and relapse. Electronic Research Archive, 2023, 31(11): 7104-7124. doi: 10.3934/era.2023360 |
[7] | Yike Lv, Xinzhu Meng . Evolution of infectious diseases induced by epidemic prevention publicity and interaction between heterogeneous strains. Electronic Research Archive, 2024, 32(8): 4858-4886. doi: 10.3934/era.2024223 |
[8] | Ting Kang, Qimin Zhang, Qingyun Wang . Nonlinear adaptive control of avian influenza model with slaughter, educational campaigns and treatment. Electronic Research Archive, 2023, 31(8): 4346-4361. doi: 10.3934/era.2023222 |
[9] | Jia Chen, Yuming Chen, Qimin Zhang . Ergodic stationary distribution and extinction of stochastic pertussis model with immune and Markov switching. Electronic Research Archive, 2025, 33(5): 2736-2761. doi: 10.3934/era.2025121 |
[10] | Wenhui Niu, Xinhong Zhang, Daqing Jiang . Dynamics and numerical simulations of a generalized mosquito-borne epidemic model using the Ornstein-Uhlenbeck process: Stability, stationary distribution, and probability density function. Electronic Research Archive, 2024, 32(6): 3777-3818. doi: 10.3934/era.2024172 |
Most existing deepfake detection methods often fail to maintain their performance when confronting new test domains. To address this issue, we propose a generalizable deepfake detection system to implement style diversification by alternately learning the domain generalization (DG)-based detector and the stylized fake face synthesizer (SFFS). For the DG-based detector, we first adopt instance normalization- and batch normalization-based structures to extract the local and global image statistics as the style and content features, which are then leveraged to obtain the more diverse feature space. Subsequently, contrastive learning is used to emphasize common style features while suppressing domain-specific ones, and adversarial learning is performed to obtain the domain-invariant features. These optimized features help the DG-based detector to learn generalized classification features and also encourage the SFFS to simulate possibly unseen domain data. In return, the samples generated by the SFFS would contribute to the detector's learning of more generalized features from augmented training data. Such a joint learning and training process enhances both the detector's and the synthesizer's feature representation capability for generalizable deepfake detection. Experimental results demonstrate that our method outperforms the state-of-the-art competitors not only in intra-domain tests but particularly in cross-domain tests.
In the eco-environment, there are a large number of pests or annoying animals such as rodents and mosquitoes that can spread diseases or destroy crops or livestock. They are called vermin. In addition, vermin have the strong reproductive abilities, which makes it necessary to control them [1]. Usually, chemical drugs are used to poison the vermin, which will pollute the environment and destroy the ecological system. In addition, long-term use of chemical drugs will make the vermin resistant to drugs, which makes it impossible to control the vermin effectively for a long time. Ecological research shows that reducing the reproduction rate is an effective way to manage the over-abundance of species. Currently, female sterilant is used to reduce the size of vermin [2,3]. This is because, compared with chemical drugs, sterilants not only have the advantage of not polluting the environment, but also have the dual effects of causing sterility and death of vermin.
Since the reproductive ability of vermin is related to the age of individuals [4], we can use first-order partial differential equations coupled with integral equations to simulate the dynamics of vermin [5,6]. Along this line, many studies have appeared on population models. To name a few, see [7,8,9,10] for age-dependent models, and [11,12,13,14,15] for size-structured models. Aniţa and Aniţa [7] considered two optimal harvesting problems related to age-structured population dynamics with logistic term and time-periodic control and vital rates. The control variable is the harvest effort, which only depends on time and only appears in the principal equation. Li et al. [9] studied the optimal control of an age-structured model describing mosquito plasticity. He et al. [10] investigated the optimal birth control problem for a nonlinear age-structured population model. The control variable is the birth rate and only appears in the boundary condition. He and Liu [11] and Liu and Liu [12] discussed optimal birth control problems for population models with size structures. Li et al. [13] investigated the optimal harvesting problem for a size-stage-structured population model and the control variable is the harvest effort for the adult population.
However, only a small amount of work is directly aimed at the contraception control problems for vermin with individual structure [16,17], and no work has yet considered the reproduction law of vermin in modeling. In this paper, we will formulate a nonlinear hierarchical age-structured model to discuss the optimal contraception management problem for vermin. The so-called hierarchical structure of the population is to rank individuals according to their age, body size, or any other structural variables that may affect their life rate [18]. Moreover, Gurney and Nisbet [18] pointed out that the hierarchy of ranks in a population is one of the important factors to maintain species' persistence and ecological stability. Most studies on the hierarchical population models mainly discuss the existence, uniqueness, and numerical approximation of solutions [19,20], and the asymptotic behavior of solutions [18,21]. However, studies on optimal control problems of hierarchical population models are rather rare. He and his collaborators have investigated optimal harvesting problems in hierarchical species [22,23]. The control variables are the harvest effort and only appear in the principal equation.
Compared with known closely related ones, our model has the following features. Firstly, the control function is the amount of sterilant ingested by an individual, which depends on the individual's age. Secondly, the control variable appears not only in the principal equation (distributed control) but also in the boundary condition (boundary control). Thirdly, the reproduction rate of vermin depends not only on the age of individuals but also on the mechanism of encounters between males and females and an "internal environment". Fourthly, the mortality of vermin depends not only on the intrinsic and weighted total size of vermin but also on the influence of ingested sterilant. The model obtained in this paper is a nonlinear integro-partial differential equation with a global feedback boundary condition. Based on this model, this paper will investigate how to apply the female sterilant to minimize the final size of vermin when the control cost is the lowest.
In this paper, firstly, the existence of a unique non-negative solution is established based on Theorem 4.1 of [14]. More importantly, by transforming the model into a system of two subsystems, we show that the solution has a separable form. Then, the existence of an optimal policy is discussed with compactness and minimization sequences. To show the compactness, we use the Fréchet-Kolmogorov Theorem and its generalization. Next, the Euler-Lagrange optimality conditions are derived by employing adjoint systems and normal cones techniques. The high nonlinearity of the model makes it difficult to construct the adjoint system. For this reason, we give a new continuous result, that is, the continuity of the solution of an integro-partial differential equation with respect to its boundary distribution and inhomogeneous term.
Let us make some comments on the difference between our methods and results from those of closely related works. Aniţa and Aniţa [7] only gave the first order necessary optimality conditions by using an adjoint system and normal cones techniques. Li et al. [13] only discussed the existence of the optimal solution for a harvest problem via a maximizing sequence. Hritonenko et al. [15] only gave the maximum principle for a size-structured model of forest and carbon sequestration management via adjoint system. Kato [14] only discussed the existence of the optimal solution for a nonlinear size-structured harvest model by means of a maximizing sequence.
In this section, taking the reproduction law of vermin into consideration, we will formulate a hierarchical age-structured model to discuss the optimal contraception management problem for vermin. Ecological studies show that the reproduction of vermin follows the following laws [4]:
(1∘) The reproductive ability of vermin is related to the age of individuals;
(2∘) Most vermin are polygamous hybridization;
(3∘) A large proportion of females increases the reproductive intensity of vermin;
(4∘) The average number of offspring from middle-aged and elderly individuals is more than that of individuals who first participate in reproduction.
To build our model, let p(a,t) denote the density of vermin with age a at time t, and a† be the maximum age of survival of vermin.
Firstly, we simulate the reproduction process. Note that most vermin are polygamous hybridization. As in [24], we should consider the mechanism of encounters between males and females when describing the birth process. Here we assume that the sex ratio is determined by fixed environmental or social factors, and ω(a) (0<ω(a)<1) is the proportion of females with age a. Then the number of males at time t is
S(t)=∫a†0[1−ω(a)]p(a,t)da. |
Further, we introduce the function B(a,S(t)) to represent the number of males encountered by a female with age a per unit time.
From (3∘) and (4∘), we see that middle-aged and elderly females play a dominant role in reproduction of vermin. Thus, there exist dominant ranks of individuals in vermin [22]. As in [19], one can assume that the fertility of vermin is related to its "internal environment" E(p)(a,t), which is given by
E(p)(a,t)=α∫a0ω(r)p(r,t)dr+∫a†aω(r)p(r,t)dr,0≤α<1. |
The parameter α is the hierarchical coefficient, which is the weight of the lower ranks (i.e., age smaller than a). From [21], α=0 (i.e., "contest competition") implies an absolute hierarchical structure, whereas α tending to 1 means that the effect of higher ranks is similar to that of lower ranks. Moreover, the limiting case α=1 (i.e., "scramble competition") means that there is no hierarchy. Hence, the fertility of vermin can be defined as ˜β(a,t,E(p)(a,t)), which denotes the average number of offspring produced per an encounter of a male with a female with age a at time t.
Next, we simulate the sterile process and death process. In order to inhibit the excessive reproduction of vermin, humans put female sterilant into their living environment of vermin. For the convenience of modeling, we assume that the sterilant used at any time will be completely eaten by vermin (including males), and individuals of the same age will eat the same amount of sterilant at the same time [16]. Liu et al. pointed out that sterilant can not only cause sterility of vermin but also kill them [25]. Thus, when the amount of sterilant ingested by an individual with age a at time t is u(a,t), we can use δ1u(a,t) and δ2u(a,t), respectively, to describe the mortality and infertility rates caused by ingestion of sterilant. Hence, the density of fertile females with age a at time t can be written as [1−δ2u(a,t)]ω(a)p(a,t), and the total number of newborns that are produced at time t is given by
∫a†0˜β(a,t,E(p)(a,t))B(a,S(t))[1−δ2u(a,t)]ω(a)p(a,t)da. |
Next we denote β(a,t,E(p)(a,t),S(t))≜˜β(a,t,E(p))B(a,S(t))ω(a). In addition, the restriction of living space or habitat can lead to an increase of mortality. Thus, in addition to natural mortality μ(a,t) and external mortality δ1u(a,t), we assume that the vermin also has a mortality Φ(I(t)), which depends on the total size I(t) weighted by m(a). That is,
I(t)=∫a†0m(a)p(a,t)da. |
Finally, we build our model. Motivated by the above discussions, in this paper, we propose the following hierarchical age-structured model to describe the contraception control problem of vermin
{∂p(a,t)∂t+∂p(a,t)∂a=f(a,t)−[μ(a,t)+δ1u(a,t)+Φ(I(t))]p(a,t),(a,t)∈D,p(0,t)=∫a†0β(a,t,E(p)(a,t),S(t))[1−δ2u(a,t)]p(a,t)da,t∈[0,T],p(a,0)=p0(a),a∈[0,a†),I(t)=∫a†0m(a)p(a,t)da,S(t)=∫a†0[1−ω(a)]p(a,t)da,t∈[0,T],E(p)(a,t)=α∫a0ω(r)p(r,t)dr+∫a†aω(r)p(r,t)dr,(a,t)∈D, | (2.1) |
where D=(0,a†)×(0,T) and T∈(0,+∞) is the control horizon. f(a,t) is the rate of immigration. The control variable u∈U={u∈L∞(D):0≤u(a,t)≤L,a.e.(a,t)∈D}, where L>0 is a constant. Biologically, we have δ2L<1. Let pu(a,t) be the solution of (2.1) with u∈U. The optimization problem discussed in this paper is
minu∈U J(u), | (2.2) |
where
J(u)=∫a†0pu(a,T)da+∫T0[r(t)∫a†0u(a,t)pu(a,t)da]dt. |
Here the first integral represents the total number of vermin at time T, while r(t)∫a†0u(a,t)pu(a,t)da is the cost of infertility control at time t. The purpose of this paper is to investigate how to apply female sterilant to minimize the final size of vermin when the control cost is the lowest.
After rewriting our model (see Section 3), we see it is a special case of (4.1) in [14]. Note this model contains some exiting ones. Assume that β(a,t,E(p)(a,t),S(t))=β(a,t) and Φ(I(t))=0. If δ1=δ2=0, then our model reduces to model (2.1.1) in [6]; if δ1=1 and δ2=0, then model (2.1) becomes the harvest control model (3.1.1) in [6]. Assume that f(a,t)=0, m(a)=1, and β(a,t,E(p)(a,t),S(t))=β(a,t). Then we get model (2.2.15) in [6] by letting δ1=δ2=0 and the harvest control model (3.2.1) in [6] by letting δ1=1 and δ2=0. Moreover, if we take f(a,t)=0, m(a)=1, δ1=δ2=0 and β(a,t,E(p)(a,t),S(t))=β(a,t)ω(a,t), then model (2.1) improves the age-structured birth control model in [10].
Let R+≜[0,+∞), L1+≜L1(0,a†;R+) and L∞+≜L∞(0,a†;R+). In this paper, we assume that:
(A1) For each t∈[0,T], μ(⋅,t)∈L1loc[0,a†) and ∫a†0μ(a,t)da=+∞.
(A2) Φ:R+→R+ is bounded, that is, there is a constant ˉΦ>0 such that Φ(s)≤ˉΦ for all s∈R+. Moreover, there is an increasing function CΦ:R+→R+ such that
|Φ(s1)−Φ(s2)|≤CΦ(r)|s1−s2|,0≤s1,s2≤r. |
(A3) β:D×R+×R+→R+ is measurable and 0≤β(a,t,s,q)≤ˉβ for some ˉβ>0. Moreover, there exists an increasing function Cβ:R+→R+ such that for a∈[0,a†) and t∈[0,T]
|β(a,t,s1,q1)−β(a,t,s2,q2)|≤Cβ(r)(|s1−s2|+|q1−q2|),0≤s1,s2,q1,q2≤r. |
(A4) f∈L∞(0,T;L1+), p0∈L1+, ω∈L∞+, m∈L∞+ and 0≤ω(a)≤ˉω<1, 0≤m(a)≤ˉm for any a∈[0,a†). Here ˉω and ˉm are positive constants.
In this section, we show that (2.1) admits solutions in a separable form. First, we show (2.1) is well posed. For any u∈U and ϕ∈L1, let
G(t,ϕ)(a)=f(a,t)−[μ(a,t)+δ1u(a,t)+Φ(Iϕ)]ϕ(a),a∈[0,a†), | (3.1) |
F(t,ϕ)=∫a†0β(a,t,E(ϕ)(a),Sϕ)[1−δ2u(a,t)]ϕ(a)da, | (3.2) |
where Iϕ=∫a†0m(a)ϕ(a)da, E(ϕ)(a)=α∫a0ω(r)ϕ(r)dr+∫a†aω(r)ϕ(r)dr a∈[0,a†), and Sϕ=∫a†0[1−ω(a)]ϕ(a)da. Then (2.1) can be written in the following general form
{∂p(a,t)∂t+∂p(a,t)∂a=G(t,p(⋅,t))(a),(a,t)∈[0,a†)×[0,T],p(0,t)=F(t,p(⋅,t)),t∈[0,T],p(a,0)=p0(a),x∈[0,a†). |
This is a special case of (4.1) in [14] with V(x,t)=1. Obviously, under (A1)–(A4), G satisfies (G0) and (G1) in [14]. Now, we show F satisfies (F0) and (F1) in [14]. For any ϕi∈L1 with ‖ϕi‖L1≤r (i=1,2), we have
|E(ϕi)(a)|=|α∫a0ω(r)ϕi(r)dr+∫a†aω(r)ϕi(r)dr|≤ˉω∫a†0|ϕi(r)|dr≤‖ϕi‖L1≤r,|Sϕi|=|∫a†0[1−ω(a)]ϕi(a)da|≤∫a†0|ϕi(r)|dr=‖ϕi‖L1≤r. |
Then, by (A3), we get
|β(a,t,E(ϕ1)(a),Sϕ1)−β(a,t,E(ϕ2)(a),Sϕ2)|≤Cβ(r)|α∫a0ω(r)[ϕ1(r)−ϕ2(r)]dr+∫a†aω(r)[ϕ1(r)−ϕ2(r)]dr|+Cβ(r)|∫a†0[1−ω(a)][ϕ1(a)−ϕ2(a)]da|≤Cβ(r){α∫a0|ω(r)||ϕ1(r)−ϕ2(r)|dr+∫a†a|ω(r)||ϕ1(r)−ϕ2(r)|dr}+Cβ(r)∫a†0[1−ω(a)]|ϕ1(a)−ϕ2(a)|da≤(ˉω+1)Cβ(r)∫a†0|ϕ1(r)−ϕ2(r)|dr=(ˉω+1)Cβ(r)‖ϕ1−ϕ2‖L1. |
Hence,
|F(t,ϕ1)−F(t,ϕ2)|≤∫a†0|β(a,t,E(ϕ1)(a),Sϕ1)−β(a,t,E(ϕ2)(a),Sϕ2)|⋅|ϕ1(a)|da+∫a†0|β(a,t,E(ϕ2)(a),Sϕ2)|⋅|ϕ1(a)−ϕ2(a)|da≤(ˉω+1)Cβ(r)‖ϕ1−ϕ2‖L1∫a†0|ϕ1(a)|da+ˉβ∫a†0|ϕ1(a)−ϕ2(a)|da≤[(ˉω+1)Cβ(r)r+ˉβ]‖ϕ1−ϕ2‖L1. |
Let CF(r)=(ˉω+1)Cβ(r)r+ˉβ. By (A3), we know that CF is an increasing function. Thus, (F0) in [14] holds. Clearly, F satisfies (F1) in [14]. In addition, take ω1(t)=‖f(⋅,t)‖L1 and ω2(t)=ˉβ. Then all conditions of [14] are satisfied. Similar to the proof of [14], we have the following result.
Theorem 3.1. For each u∈U, model (2.1) has a unique global solution p∈C([0,T];L1+), which satisfies
‖p(⋅,t)‖L1≤eˉβt‖p0‖L1+∫t0eˉβ(t−s)‖f(⋅,s)‖L1ds. | (3.3) |
Next we consider the solution of model (2.1) in the following form
p(a,t)=y(t)ˉp(a,t). | (3.4) |
From (2.1) and (3.4), we get two subsystems about ˉp(a,t) and y(t) as follows
{∂ˉp(a,t)∂t+∂ˉp(a,t)∂a=f(a,t)y(t)−[μ(a,t)+δ1u(a,t)]ˉp(a,t),(a,t)∈D,ˉp(0,t)=∫a†0β(a,t,y(t)E(ˉp)(a,t),y(t)ˉS(t))[1−δ2u(a,t)]ˉp(a,t)da,t∈[0,T],ˉS(t)=∫a†0[1−ω(a)]ˉp(a,t)da,t∈[0,T],E(ˉp)(t)=α∫a0ω(r)ˉp(r,t)dr+∫a†aω(r)ˉp(r,t)dr,t∈[0,T],ˉp(a,0)=p0(a),a∈[0,a†), | (3.5) |
{y′(t)+Φ(y(t)ˉI(t))y(t)=0,t∈[0,T],ˉI(t)=∫a†0m(a)ˉp(a,t)da,t∈[0,T],y(0)=1. | (3.6) |
Definition 1. A pair of functions (ˉp(a,t),y(t)) with ˉp∈C([0,T];L1+) and y∈C([0,T];R+) is said to be a solution of (3.5)–(3.6) if it satisfies
ˉp(a,t)={Fy(τ,ˉp(⋅,τ))+∫tτGy(s,ˉp(⋅,s))(s−t+a)ds,a≤t,p0(a−t)+∫t0Gy(s,ˉp(⋅,s))(s−t+a)ds,a>t, | (3.7) |
y(t)=exp{−∫t0Φ(y(s)ˉI(s))ds}, | (3.8) |
where τ=t−a, ˉI(s)=∫a†0m(a)ˉp(a,s)da, and
Fy(t,ϕ)=∫a†0β(a,t,y(t)E(ϕ)(a),y(t)Sϕ)[1−δ2u(a,t)]ϕ(a)da,Gy(t,ϕ)(a)=−μ(a,t)ϕ(a)−δ1u(a,t)ϕ(a)+f(a,t)y(t),a∈[0,a†) |
for t∈[0,T] and ϕ∈L1. Here E(ϕ)(a)=α∫a0ω(r)ϕ(r)dr+∫a†aω(r)ϕ(r)dr and Sϕ=∫a†0[1−ω(a)]ϕ(a)da.
Denote θ≜exp{−ˉΦT}>0 and define S={h∈C[0,T]:θ≤h(t)≤1,t∈[0,T]}. In addition, define an equivalent norm in C[0,T] by
‖h‖λ=supt∈[0,T]e−λt|h(t)|forh∈C[0,T] | (3.9) |
for some λ>0. Clearly, (S,‖⋅‖λ) is a Banach space.
For any y∈S, by Theorem 3.1, system (3.5) has a unique non-negative solution ˉpy∈C([0,T];L1+) satisfying
‖ˉpy(⋅,t)‖L1≤eˉβt‖p0‖L1+∫t0eˉβ(t−s)‖f(⋅,s)y(s)‖L1ds≤eˉβt‖p0‖L1+∫t0eˉβ(t−s)‖f(⋅,s)‖L1y(s)ds≤eˉβT(‖p0‖L1+‖f(⋅,⋅)‖L1(D)θ)≜r0. | (3.10) |
Lemma 3.2. There is a positive constant M such that
‖ˉpy1(⋅,t)−ˉpy2(⋅,t)‖L1≤M∫t0|y1(s)−y2(s)|ds, | (3.11) |
e−λt‖ˉpy1(⋅,t)−ˉpy2(⋅,t)‖L1≤Mλ‖y1−y2‖λ | (3.12) |
for all t∈[0,T] and y1, y2∈S.
Proof. Since (3.12) can be obtained directly from (3.11), we only need to prove (3.11). For any y∈S, from (3.10) and 0<ω(a)≤ˉω<1, it follows that
|E(ˉpy)(a,t)|=|α∫a0ω(a)ˉpy(a,t)da+∫a†aω(a)ˉpy(a,t)da|≤ˉω∫a†0|ˉpy(a,t)|da≤r0, | (3.13) |
|ˉSy(t)|=|∫a†0[1−ω(a)]ˉpy(a,t)da|≤∫a†0|ˉpy(a,t)|da≤r0, | (3.14) |
and
|E(ˉpy1)−E(ˉpy2)|(a,t)=|α∫a0ω(r)[ˉpy1−ˉpy2](r,t)dr+∫a†aω(r)[ˉpy1−ˉpy2](r,t)dr|≤α∫a0|ω(r)||ˉpy1−ˉpy2|(r,t)dr+∫a†a|ω(r)||ˉuy1−ˉuy2|(r,t)dr≤ˉω∫a†0|ˉpy1−ˉpy2|(a,t)da≤‖ˉpy1(⋅,t)−ˉpy2(⋅,t)‖L1, | (3.15) |
|ˉSy1(t)−ˉSy2(t)|=|∫a†0[1−ω(a)]ˉpy1(a,t)da−∫a†0[1−ω(a)]ˉpy2(a,t)da|≤∫a†0|ˉpy1(a,t)−ˉpy2(a,t)|da=‖ˉpy1(⋅,t)−ˉpy2(⋅,t)‖L1. | (3.16) |
Moreover, using (3.7), we have
‖ˉpy1(⋅,t)−ˉpy2(⋅,t)‖L1=∫t0|ˉpy1(a,t)−ˉpy2(a,t)|da+∫a†t|ˉpy1(a,t)−ˉpy2(a,t)|da≤∫t0|Fy1(τ,ˉpy1(⋅,τ))−Fy2(τ,ˉpy2(⋅,τ))|da+∫t0∫tτ|Gy1(s,ˉpy1(⋅,s))−Gy2(s,ˉpy2(⋅,s))|(s−t+a)dsda+∫a†t∫t0|Gy1(s,ˉpy1(⋅,s))−Gy2(s,ˉpy2(⋅,s))|(s−t+a)dsda≜I1+I2+I3. | (3.17) |
It follows from Fubini's Theorem that
I2+I3=∫t0∫tt−s|Gy1(s,ˉpy1(⋅,s))−Gy2(s,ˉpy2(⋅,s))|(s−t+a)dads+∫t0∫a†t|Gy1(s,ˉpy1(⋅,s))−Gy2(s,ˉpy2(⋅,s))|(s−t+a)dads=∫t0∫a†t−s|Gy1(s,ˉpy1(⋅,s))−Gy2(s,ˉpy2(⋅,s))|(s−t+a)dads. |
Using the transformation s=t−a, we have s=t when a=0 while s=0 when a=t, and ds=−da. Thus, by (3.13)–(3.16), we obtain
I1=∫t0|∫a†0β(a,s,y1(s)E(ˉpy1)(a,s),y1(s)ˉSy1(s))[1−δ2u(a,s)]ˉpy1(a,s)da−∫a†0β(a,s,y2(s)E(ˉpy2)(a,s),y2(s)ˉSy2(s))[1−δ2u(a,s)]ˉpy2(a,s)da|ds≤ˉβ∫t0∫a†0|ˉpy1(a,s)−ˉpy2(a,s)|dads+Cβ(r0)∫t0∫a†0[|E(ˉpy1)−E(ˉpy2)|(a,s)+|ˉSy1(s)−ˉSy2(s)|]⋅|ˉpy2(a,s)|dads+Cβ(r0)∫t0∫a†0[E(ˉpy2)(a,s)+ˉSy2(s)]⋅|y1(s)−y2(s)|⋅|ˉpy2(a,s)|dads≤ˉβ∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1ds+2Cβ(r0)r0∫t0|y1(s)−y2(s)|∫a†0|ˉpy2(a,s)|dads+2Cβ(r0)∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1∫a†0|ˉpy2(a,s)|dads≤(ˉβ+2Cβ(r0)r0)∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1ds+2Cβ(r0)r20∫t0|y1(s)−y2(s)|ds. | (3.18) |
Using the transformation η=s−t+a, we have η=0 when a=t−s while η=s−t+a†≤a† (t−s≥0) when a=a†, and dη=da. Thus, we obtain
I2+I3≤∫t0∫a†0|Gy1(s,ˉpy1(⋅,s))−Gy2(s,ˉpy2(⋅,s))|(η)dηds≤∫t0∫a†0|−(μ(η,s)+δ1u(η,s))(ˉpy1(η,s)−ˉpy2(η,s))+(f(η,s)y1(s)−f(η,s)y2(s))|dηds≤(ˉμ+δ1L)∫t0∫a†0|ˉpy1(η,s)−ˉpy2(η,s)|dηds+∫t0∫a†0|f(η,s)y1(s)−f(η,s)y2(s)|dηds=(ˉμ+δ1L)∫t0∫a†0|ˉpy1(η,s)−ˉpy2(η,s)|dηds+∫t0|1y1(s)−1y2(s)|‖f(⋅,s)‖L1ds≤(ˉμ+δ1L)∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1ds+‖f‖L∞(0,T;L1)θ2∫t0|y1(s)−y2(s)|ds. | (3.19) |
Here ˉμ is the upper bound of μ(a,t). From (3.17)–(3.19), we have
‖ˉpy1(⋅,t)−ˉpy2(⋅,t)‖L1≤(ˉβ+2Cβ(r0)r0+ˉμ+δ1L)∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖ds+(2Cβ(r0)r20+‖f‖L∞(0,T;L1)θ2)∫t0|y1(s)−y2(s)|ds. | (3.20) |
Then (3.11) follows from Gronwall's inequality.
Theorem 3.3. For any p0∈L1+ and u∈U, (3.5)–(3.6) has a unique solution (ˉpy,y)∈C([0,T];L1+)×C([0,T];R+). In addition, p(a,t)=ˉpy(a,t)y(t) is the unique solution of (2.1).
Proof. First, we show that for any y∈S there is a unique ˉy∈S such that
ˉy(t)=exp{−∫t0Φ(ˉIy(s)ˉy(s))ds}. | (3.21) |
Here ˉIy(t)=∫a†0m(a)ˉpy(a,t)da. From (3.10), it is easy to show
|ˉIy(t)|=|∫a†0m(a)ˉpy(a,t)da|≤ˉm∫a†0|ˉpy(a,t)|da≤ˉmr0≜r1. | (3.22) |
For fixed ˉIy, define the operator A:S→C[0,T] by
[Ah](t)=exp{−∫t0Φ(ˉIy(s)h(s))ds}forh∈S. |
Clearly, [Ah](t)≥θ for each h∈S. Thus, A maps S into itself. In addition, for any h1, h2∈S, we have
‖(Ah1)(t)−(Ah2)(t)‖λ=supt∈[0,T]{e−λt|(Ah1)(t)−(Ah2)(t)|}≤supt∈[0,T]{e−λt∫t0|Φ(ˉIy(s)h1(s))−Φ(ˉIy(s)h2(s))|ds}≤supt∈[0,T]{e−λtCΦ(r1)r1∫t0eλse−λs|h1(s)−h2(s)|ds}≤CΦ(r1)r1λ‖h1−h2‖λ. |
Taking λ>0 large enough such that λ>CΦ(r1)r1, we see that A is a contraction on (S,‖⋅‖λ). Fixed point theory shows that A owns a unique fixed point ˉy in S, and ˉy satisfies (3.21).
Next, based on (3.21), we define another operator B:S→S by
By=ˉyfory∈S. | (3.23) |
For any y1, y2∈S, it is easy to show that
|ˉIy1(s)−ˉIy2(s)|=|∫a†0m(a)ˉpy1(a,s)da−∫a†0m(a)ˉpy2(a,s)da|≤ˉm‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1. |
Then, together with (3.12), one yields
e−λt∫t0|ˉIy1(s)−ˉIy2(s)|ds≤ˉme−λt∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1ds≤Mˉmλ2‖y1−y2‖λ. |
Further, it follows from (3.21) and (3.22) that
e−λt|˜y1(t)−˜y2(t)|=e−λt|(By1)(t)−(By2)(t)|≤e−λt|∫t0Φ(ˉIy1(s)ˉy1(s))ds−∫t0Φ(ˉIy2(s)ˉy2(s))ds|≤e−λtCΦ(r1)∫t0|ˉIy1(s)ˉy1(s)−ˉIy2(s)ˉy2(s)|ds≤CΦ(r1)Mˉmλ2‖y1−y2‖λ+CΦ(r1)r1∫t0e−λs|ˉy1(s)−ˉy2(s)|ds. | (3.24) |
The Gronwall's inequality implies
e−λt|ˉy1(t)−ˉy2(t)|≤CΦ(r1)MˉmeCΦ(r1)r1Tλ2‖y1−y2‖λ. |
Thus, B is a contraction on (S,‖⋅‖λ) by choosing λ>0 such that CΦ(r1)MˉmeCΦ(r1)r1T/λ2<1. Let y be the unique fixed point of B in S. Then (ˉp,y)=(ˉpy,y) is the solution to (3.5)–(3.6), which is non-negative and bounded.
Finally, from Theorem 3.1, model (2.1) has a unique solution. In addition, it is easy to verify that p(a,t)=ˉpy(a,t)y(t) satisfies (2.1). Thus, p(a,t)=ˉpy(a,t)y(t) is the unique solution to (2.1). In summary, model (2.1) has a unique non-negative solution p(a,t), which is uniformly bounded.
Theorem 3.4. The solution pu of model (2.1) is continuous in u∈U. That is, for any u1, u2∈U, there are positive constants K1 and K2 such that
‖p1−p2‖L∞(0,T;L1(0,a†))≤K1T‖u1−u2‖L∞(0,T;L1(0,a†)),‖p1−p2‖L1(D)≤K2T‖u1−u2‖L1(D), |
where pi is the solution of (2.1) with respect to ui(i=1,2).
Proof. By Theorem 3.3, one has pi(a,t)=yi(t)ˉpyi(a,t), i=1,2. Here (ˉpyi,yi) is the solution of (3.5)–(3.6) with respect to ui∈U. From (3.10), it follows that
‖p1(⋅,t)−p2(⋅,t)‖L1≤‖ˉpy1(⋅,t)−ˉpy2(⋅,t)‖L1+r0|y1(t)−y2(t)|. | (3.25) |
Recall that |ˉI(s)|≤r1. Then, by y(t)≤1, (A2), and (3.8), we obtain
|y1(t)−y2(t)|≤∫t0|Φ(y1(s)ˉIy1(s))−Φ(y2(s)ˉIy2(s))|ds≤CΦ(r1)∫t0|y1(s)ˉIy1(s)−y2(s)ˉIy2(s)|ds≤CΦ(r1)r1∫t0|y1(s)−y2(s)|ds+CΦ(r1)ˉm∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1ds. |
Applying the Gronwall's inequality produces
|y1(t)−y2(t)|≤M1∫t0‖ˉuy1(⋅,s)−ˉuy2(⋅,s)‖L1ds, | (3.26) |
where M1=C2Φ(r1)r1ˉmTeCΦ(r1)r1T+CΦ(r1)ˉm. Further, it can be seen from (3.7) that
‖ˉpy1(⋅,t)−ˉpy2(⋅,t)‖L1≤∫t0|Fy1(τ,ˉpy1(⋅,τ))−Fy2(τ,ˉpy2(⋅,τ))|da+∫t0∫tτ|Gy1(s,ˉpy1(⋅,s))−Gy2(s,ˉpy2(⋅,s))|(s−t+a)dsda+∫a†t∫t0|Gy1(s,ˉpy1(⋅,s))−Gy2(s,ˉpy2(⋅,s))|(s−t+a)dsda≜I4+I5+I6. | (3.27) |
Arguing similarly as for I1 and I2+I3, respectively, we can show that
I4≤ˉβ∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1ds+δ2ˉβ∫t0‖ˉpy2(⋅,s)‖L1∫a†0|u1(a,s)−u2(a,s)|dads+2Cβ(r0)∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1∫a†0|ˉpy2(a,s)|dads+2Cβ(r0)r0∫t0|y1(s)−y2(s)|∫a†0|ˉpy2(a,s)|dads≤(ˉβ+2Cβ(r0)r0)∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1ds+2Cβ(r0)r20∫t0|y1(s)−y2(s)|ds+δ2ˉβr0∫t0‖u1(⋅,s)−u2(⋅,s)‖L1ds | (3.28) |
and
I5+I6≤∫t0∫a†0|(f(η,s)y1(s)−f(η,s)y2(s))−μ(η,s)(ˉuy1(η,s)−ˉuy2(η,s))−δ1(u1(η,s)ˉpy1(η,s)−u2(η,s)ˉpy2(η,s))|dηds=∫t0∫a†0|(f(η,s)y1(s)−f(η,s)y2(s))−μ(η,s)(ˉuy1(η,s)−ˉuy2(η,s))−δ1u1(η,s)(ˉpy1(η,s)−ˉpy2(η,s))−δ1(u1(η,s)−u2(η,s))ˉpy2(η,s)|dηds≤(ˉμ+δ1L)∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1ds+δ1r0∫t0‖u(⋅,s)−u(⋅,s)‖L1ds+‖f‖L∞(0,T;L1)θ2∫t0|y1(s)−y2(s)|ds. | (3.29) |
It follows from (3.27)–(3.29) that
‖ˉpy1(⋅,t)−ˉpy2(⋅,t)‖L1≤(ˉβ+2Cβ(r0)r0+ˉμ+δ1L)∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1ds+(2Cβ(r0)r20+‖f‖L∞(0,T;L1)θ2)∫t0|y1(s)−y2(s)|ds+(δ1r0+δ2ˉβr0)∫t0‖u1(⋅,s)−u2(⋅,s)‖L1ds. | (3.30) |
This, together with (3.26), yields
‖ˉpy1(⋅,t)−ˉpy2(⋅,t)‖L1≤M2∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1ds+(δ1r0+δ2ˉβr0)∫t0‖u1(⋅,s)−u2(⋅,s)‖L1ds, |
where M2=(ˉβ+2Cβ(r0)r0+ˉμ+δ1L)+M1T(2Cβ(r0)r20+‖f‖L∞(0,T;L1)θ2). By Gronwall's inequality, we have
‖ˉpy1(⋅,t)−ˉpy2(⋅,t)‖L1≤M3∫t0‖u1(⋅,s)−u2(⋅,s)‖L1ds, | (3.31) |
where M3=(δ1r0+δ2ˉβr0)(1++M2TeM2T). Substituting (3.26) and (3.31) into (3.25), one yields
‖p1(⋅,t)−p2(⋅,t)‖L1≤‖ˉpy1(⋅,t)−ˉpy2(⋅,t)‖L1+r0M1∫t0‖ˉpy1(⋅,s)−ˉpy2(⋅,s)‖L1ds≤M3(1+r0M1T)∫t0‖u1(⋅,s)−u2(⋅,s)‖L1ds. |
The conclusion then follows immediately from the above analysis.
The purpose of this section is to prove the existence of optimal management policy. To this end, we first establish two lemmas on compactness.
Lemma 4.1. Let and . Then and are relatively compact sets in .
Proof. We only show that is relatively compact in as can be dealt with similarity. For given sufficiently small, define
Since is uniformly bounded in , there is a positive constant such that
Obviously, the relative compactness of in implies that the set is also relatively compact in .
Now, by using Fréchet-Kolmogorov Theorem [26], we show that is relatively compact in . For convenience, we denote if or .
For each , by Theorem 3.1, we have
It is easy to verify that
We need to show that for any . Note that
It suffices to show that is uniformly bounded about . Clearly,
Multiplying (2.1) by and integrating on , one yields
By assumptions and Theorem 3.1, we know that is uniformly bounded about . For , by the second equation of (2.1), we obtain
Similarly, is also uniformly bounded about . In summary, we have proved that is uniformly bounded about . Hence, we can obtain
Thus, by Fréchet-Kolmogorov Theorem, we know that is relatively compact in . The proof is complete.
Lemma 4.2. Let . Then the set is relatively compact in .
Proof. For given sufficiently small, define
With a similar discussion as that in the proof of Lemma 4.1, we only need to show that is relatively compact in . We shall use Fréchet-Kolmogorov Theorem (with ) to prove this. For convenience, we extend to by defining for .
For any , by Theorem 3.1, we have
It is clear that
It remains to show that
(4.1) |
Obviously, we have
where , . To show (4.1), we should discuss the uniform boundedness of and with respect to . Multiplying the first equation in model (2.1) by and integrating on , we obtain
Thus,
Denote . Then, using the second equation in (2.1), we can obtain
Hence,
By assumptions and Theorem 3.1, is uniformly bounded about . On the other hand, we have
Similarly, is also uniformly bounded about . Hence, we have (4.1).
By now, we have verified all conditions of Fréchet-Kolmogorov Theorem (with ) and hence is relatively compact in . The proof is complete.
Theorem 4.3. There is at least one solution to the optimal management problem (2.1)–(2.2).
Proof. Let . For any , by Theorem 3.1, we have
Thus, . For any , according to the definition of , there exists such that
The boundness of implies that there is a subsequence of , still recorded as , such that
(4.2) |
By Lemmas 4.1 and 4.2, there exists a subsequence of , still recorded as , such that
(4.3) |
(4.4) |
as . Here and . Further, from (4.2)–(4.4), we can infer that
Moreover, by Mazur Theorem, we can obtain the convex combination of as follows
(4.5) |
such that
(4.6) |
Now, define a new control sequence as follows
(4.7) |
It is easy to verify that . Since is bounded, the weak compactness of bounded sequence implies that there is a subsequence of , still recorded as , such that
From (2.1), (4.5) and (4.7), it follows that
(4.8) |
where , and . From – and the boundedness of , there is a positive constant such that
By (4.4) and (4.6), we get
as . Similarly, we also get
Hence, in the sense of weak solutions, we have , , and .
Finally, arguing similarly as in the proof of [16], we can show that is an optimal policy for the management problem (2.2). This completes the proof.
In this section, we will establish the optimality conditions for the management problem (2.2). For any , let and be, respectively, the tangent cone and normal cone of at the element [27]. To show the optimality conditions, we need the following two lemmas.
Lemma 5.1. Assume that , , , , , . Let be the solution of
(5.1) |
If in as , then in as . Here is the solution of (5.1) with respect to and .
Proof. Similar to the prove of [14], model (5.1) has a unique solution. Moreover, on the characteristic lines, the solution to (5.1) has the form
where and, for and ,
Here , , and .
Let and be solutions of (5.1) with respect to and , respectively. Then we have
(5.2) |
(5.3) |
(5.4) |
Moreover,
(5.5) |
Arguing similarly as for and , we can show that
(5.6) |
and
(5.7) |
From (5.5)–(5.7), we can obtain
where . Thus, Gronwall's inequality implies that
where . Hence, we can claim that in as .
Lemma 5.2. For any , and sufficiently small , if , we have
where and are, respectively, solutions of (2.1) corresponding to and , and satisfies
(5.8) |
Here, and are, respectively, the derivatives of with respect to and .
Proof. Denote . A similar discussion as that in Theorem 3.3 shows that system (5.8) has a unique solution. Now, we prove the existence of . Let
Firstly, from (2.1) and (5.8), it follows that
where .
Secondly, a simple calculation shows that
where and .
Then, we can obtain the system with as follows
(5.9) |
By Theorem 3.4, we have as , and
Passing to , we can obtain the following limit system of (5.9)
(5.10) |
Clearly, (5.10) is a homogeneous linear system with the zero initial value. Thus, (see [22, Theorem 4.1]). Further, from Lemma 5.1, we can claim that . Hence,
and satisfies (5.8). The proof is complete.
Theorem 5.3. Let be an optimal policy for the management problem (2.1)–(2.2). Then
(5.11) |
where satisfies the following adjoint system
(5.12) |
Here is the solution of model (2.1) corresponding to , , and .
Proof. For any and sufficiently small , we have . Let be the solution of (2.1) with respect to . Then the optimality of implies , that is,
It follows from Theorem 3.4 and Lemma 5.2 that
(5.13) |
Here is the solution of (5.8) with and being replaced by and , respectively.
In system (5.8) (with and being replaced by and , respectively), multiplying the first equation by and integrating on yield
(5.14) |
Using integration by parts and (5.8), one can derive
(5.15) |
Thus, from (5.14) and (5.15) and a simple calculation, we obtain
(5.16) |
Multiplying on both sides of the first equation of (5.12) and integrating on , we get
(5.17) |
Thus, from (5.16) and (5.17), we have
(5.18) |
For each , by (5.13) and (5.18), we claim that
That is, . Hence, the conclusion follows from using the structure of normal cone.
In this section, we will give an illustrative example to show the conditions for the existence are not empty.
Example 1. Let the parameters be , , , , , . Obviously, . With the weight functions and , the immigration rate and the initial age distribution , we can easily verify that assumption holds. Choose the natural mortality rate to be
For , a direct calculation gives
which means that assumption holds. Assume that . It is easy to show that for any . Moreover, for any , , we have
Thus assumption holds. For any , take the birth rate as
By a simple computation, we have for any . Moreover, for any , , , , , when , we have
when , we have
when , we have
Thus, for any and , we have
This implies that assumption holds. Hence, from Theorems 3.1–3.3, for any and , system (2.1) has a unique non-negative solution . Moreover, the solution has the form . Here is the solution of (3.5)–(3.6).
In view of the reproductive laws of vermin, we formulated and analyzed a hierarchical age-structured vermin contraception control model. The model is based on the assumption that the reproductive ability of vermin mainly depends on older females. It also considers the encounter mechanism between females and males. This allows the fertility of an individual to depend not only on age and time but also on their "internal environment" and the size of males. Note that sterilant has the dual effects of causing infertility and death of vermin. Thus, we assumed that the mortality of vermin depends not only on its intrinsic dynamics (including natural mortality and mortality caused by competition) but also on the effect of female sterilant. The dual effects of sterilant make the control variable appear not only in the principal equation (distributed control) but also in the boundary condition (boundary control). Our model contains some existing ones as special cases.
By transforming our model into two subsystems and using the contraction mapping principle, we have shown that the model has a unique non-negative bounded solution, which has a separable form. In this work, we discussed the existence of optimal management policy and derived the Euler-Lagrange optimality conditions. The former is established by using compactness and minimization sequences, while the latter is derived by employing adjoint systems and normal cones techniques. To show the compactness, we used the Fréchet-Kolmogorov Theorem (see Lemma 4.1) and its generalization (see Lemma 4.2). In order to construct the adjoint system, we used the continuity of the solution on the control parameters (see Theorem 3.4) and the continuity of the solution of an integro-partial differential equation with respect to its boundary distribution and inhomogeneous term (see Lemma 5.1).
This paper only discussed the existence and structure of the optimal management policy and did not carry out any numerical simulations. This is because it is very challenging to choose an appropriate numerical algorithm and analyze its convergence. The relevant numerical algorithm can be found in [20]. However, our model is more complicated than that in [20], because the birth rate depends not only on the "internal environment" of vermin but also on the number of males. We leave the study on the numerical algorithm of our optimal control problem as future work.
This work was supported by the National Natural Science Foundation of China (Nos. 12071418, 12001341).
The authors declare there is no conflict of interest.
[1] | F. Chollet, Xception: Deep learning with depthwise separable convolutions, in 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2017), 1800–1807. https://doi.org/10.1109/CVPR.2017.195 |
[2] |
B. Bayar, M. C. Stamm, Constrained convolutional neural networks: a new approach towards general purpose image manipulation detection, IEEE Trans. Inf. Forensics Secur., 13 (2018), 2691–2706. https://doi.org/10.1109/TIFS.2018.2825953 doi: 10.1109/TIFS.2018.2825953
![]() |
[3] | R. Durall, M. Keuper, J. Keuper, Watch your up-convolution: CNN based generative deep neural networks are failing to reproduce spectral distributions, in 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2020), 7887–7896. https://doi.org/10.1109/CVPR42600.2020.00791 |
[4] | Y. Qian, G. Yin, L. Sheng, Z. Chen, J. Shao, Thinking in frequency: face forgery detection by mining frequency-aware clues, in Computer Vision – ECCV 2020, Springer, (2020), 86–103. https://doi.org/10.1007/978-3-030-58610-2_6 |
[5] | H. Zhao, W. Zhou, D. Chen, T. Wei, W. Zhang, N. Yu, Multi-attentional deepfake detection, in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2021), 2185–2194. https://doi.org/10.1109/CVPR46437.2021.00222 |
[6] | Y. Luo, Y. Zhang, J. Yan, W. Liu, Generalizing face forgery detection with high-frequency features, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2021), 16317–16326. |
[7] |
J. Yang, A. Li, S. Xiao, W. Lu, X. Gao, Mtd-net: learning to detect deepfakes images by multi-scale texture difference, IEEE Trans. Inf. Forensics Secur., 16 (2021), 4234–4245. https://doi.org/10.1109/TIFS.2021.3102487 doi: 10.1109/TIFS.2021.3102487
![]() |
[8] |
B. Chen, W. Tan, Y. Wang, G. Zhao, Distinguishing between natural and GAN-generated face images by combining global and local features, Chin. J. Electron., 31 (2022), 59–67. https://doi.org/10.1049/cje.2020.00.372 doi: 10.1049/cje.2020.00.372
![]() |
[9] |
G. Li, X. Zhao, Y. Cao, Forensic symmetry for deepfakes, IEEE Trans. Inf. Forensics Secur., 18 (2023), 1095–1110. https://doi.org/10.1109/TIFS.2023.3235579 doi: 10.1109/TIFS.2023.3235579
![]() |
[10] | P. Zhou, X. Han, V. I. Morariu, L. S. Davis, Two-stream neural networks for tampered face detection, in 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), IEEE, (2017), 1831–1839. https://doi.org/10.1109/CVPRW.2017.229 |
[11] | L. Li, J. Bao, T. Zhang, H. Yang, D. Chen, F. Wen, et al., Face x-ray for more general face forgery detection, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2020), 5001–5010. |
[12] |
B. Chen, X. Liu, Y. Zheng, G. Zhao, Y. Q. Shi, A robust GAN-generated face detection method based on dual-color spaces and an improved xception, IEEE Trans. Circuits Syst. Video Technol., 32 (2022), 3527–3538. https://doi.org/10.1109/TCSVT.2021.3116679 doi: 10.1109/TCSVT.2021.3116679
![]() |
[13] | S. Chen, T. Yao, Y. Chen, S. Ding, J. Li, R. Ji, Local relation learning for face forgery detection, in AAAI Technical Track on Computer Vision I, 35 (2021), 1081–1088. https://doi.org/10.1609/aaai.v35i2.16193 |
[14] | Y. Zheng, J. Bao, D. Chen, M. Zeng, F. Wen, Exploring temporal coherence for more general video face forgery detection, in 2021 IEEE/CVF International Conference on Computer Vision (ICCV), (2021), 15024–15034. https://doi.org/10.1109/ICCV48922.2021.01477 |
[15] |
G. Pang, B. Zhang, Z. Teng, Z. Qi, J. Fan, Mre-net: Multi-rate excitation network for deepfake video detection, IEEE Trans. Circuits Syst. Video Technol., 33 (2023), 3663–3676. https://doi.org/10.1109/TCSVT.2023.3239607 doi: 10.1109/TCSVT.2023.3239607
![]() |
[16] |
B. Chen, T. Li, W. Ding, Detecting deepfake videos based on spatiotemporal attention and convolutional LSTM, Inf. Sci., 601 (2022), 58–70. https://doi.org/10.1016/j.ins.2022.04.014 doi: 10.1016/j.ins.2022.04.014
![]() |
[17] | H. Liu, X. Li, W. Zhou, Y. Chen, Y. He, H. Xue, et al., Spatial-phase shallow learning: rethinking face forgery detection in frequency domain, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2021), 772–781. |
[18] | J. Cao, C. Ma, T. Yao, S. Chen, S. Ding, X. Yang, End-to-end reconstruction-classification learning for face forgery detection, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2022), 4113–4122. |
[19] |
P. Yu, J. Fei, Z. Xia, Z. Zhou, J. Weng, Improving generalization by commonality learning in face forgery detection, IEEE Trans. Inf. Forensics Secur., 17 (2022), 547–558. https://doi.org/10.1109/TIFS.2022.3146781 doi: 10.1109/TIFS.2022.3146781
![]() |
[20] |
A. Luo, C. Kong, J. Huang, Y. Hu, X. Kang, A. C. Kot, Beyond the prior forgery knowledge: mining critical clues for general face forgery detection, IEEE Trans. Inf. Forensics Secur., 19 (2024), 1168–1182. https://doi.org/10.1109/TIFS.2023.3332218 doi: 10.1109/TIFS.2023.3332218
![]() |
[21] |
J. Hu, X. Liao, W. Wang, Z. Qin, Detecting compressed deepfake videos in social networks using frame-temporality two-stream convolutional network, IEEE Trans. Circuits Syst. Video Technol., 32 (2022), 1089–1102. https://doi.org/10.1109/TCSVT.2021.3074259 doi: 10.1109/TCSVT.2021.3074259
![]() |
[22] | T. Wang, K. P. Chow, Noise based deepfake detection via multi-head relative-interaction, in Proceedings of the AAAI Conference on Artificial Intelligence, 37 (2023), 14548–14556. https://doi.org/10.1609/aaai.v37i12.26701 |
[23] | Y. Li, S. Lyu, Exposing deepfake videos by detecting face warping artifacts, in 2019 IEEE Conference on Computer Vision and Pattern Recognition Workshops, IEEE, (2019), 46–52. |
[24] | T. Zhao, X. Xu, M. Xu, H. Ding, Y. Xiong, W. Xia, Learning self-consistency for deepfake detection, in 2021 IEEE/CVF International Conference on Computer Vision (ICCV), (2021), 15003–15013. https://doi.org/10.1109/ICCV48922.2021.01475 |
[25] | K. Shiohara, T. Yamasaki, Detecting deepfakes with self-blended images, in 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2022), 18699–18708. https://doi.org/10.1109/CVPR52688.2022.01816 |
[26] |
H. Chen, Y. Lin, B. Li, S. Tan, Learning features of intra-consistency and inter-diversity: keys toward generalizable deepfake detection, IEEE Trans. Circuits Syst. Video Technol., 33 (2023), 1468–1480. https://doi.org/10.1109/TCSVT.2022.3209336 doi: 10.1109/TCSVT.2022.3209336
![]() |
[27] | A. Rossler, D. Cozzolino, L. Verdoliva, C. Riess, J. Thies, M. Niessner Faceforensics++: Learning to detect manipulated facial images, in 2019 IEEE/CVF International Conference on Computer Vision (ICCV), (2019), 1–11. https://doi.org/10.1109/ICCV.2019.00009 |
[28] | B. Dolhansky, J. Bitton, B. Pflaum, J. Lu, R. Howes, M. Wang, et al., The deepfake detection challenge (DFDC) dataset, preprint, arXiv: 2006.07397. |
[29] | L. V. der Maaten, G. Hinton, Visualizing data using t-SNE, J. Mach. Learn. Res., 9 (2008), 2579–2605. Available from: https://www.jmlr.org/papers/volume9/vandermaaten08a/vandermaaten08a.pdf?fbcl. |
[30] | Z. Wang, Z. Wang, Z. Yu, W. Deng, J. Li, T. Gao, Domain generalization via shuffled style assembly for face anti-spoofing, in 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2022), 4113–4123. https://doi.org/10.1109/CVPR52688.2022.00409 |
[31] | Y. Ganin, V. Lempitsky, Unsupervised domain adaptation by backpropagation, in Proceedings of the 32nd International Conference on Machine Learning, 37 (2015), 1180–1189. Available from: http://proceedings.mlr.press/v37/ganin15.html. |
[32] |
Y. Wang, L. Qi, Y. Shi, Y. Gao, Feature-based style randomization for domain generalization, IEEE Trans. Circuits Syst. Video Technol., 32 (2022), 5495–5509. https://doi.org/10.1109/TCSVT.2022.3152615 doi: 10.1109/TCSVT.2022.3152615
![]() |
[33] |
S. Lin, C. T. Li, A. C. Kot, Multi-domain adversarial feature generalization for person re-identification, IEEE Trans. Image Process., 30 (2021), 1596–1607. https://doi.org/10.1109/TIP.2020.3046864 doi: 10.1109/TIP.2020.3046864
![]() |
[34] | H. Nam, H. Lee, J. Park, W. Yoon, D. Yoo, Reducing domain gap by reducing style bias, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2021), 8690–8699. |
[35] | Q. Zhou, K. Y. Zhang, T. Yao, X. Lu, R. Yi, S. Ding, et al., Instance-aware domain generalization for face anti-spoofing, in 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2023), 20453–20463. https://doi.org/10.1109/CVPR52729.2023.01959 |
[36] | X. Huang, S. Belongie, Arbitrary style transfer in real-time with adaptive instance normalization, in 2017 IEEE International Conference on Computer Vision (ICCV), (2017), 1510–1519. https://doi.org/10.1109/ICCV.2017.167 |
[37] | 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), 4396–4405. https://doi.org/10.1109/CVPR.2019.00453 |
[38] | Z. Liu, Y. Lin, Y. Cao, H. Hu, Y. Wei, Z. Zhang, et al., Swin transformer: hierarchical vision transformer using shifted windows, in Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), (2021), 10012–10022. |
[39] | Z. Xie, Z. Zhang, Y. Cao, Y. Lin, J. Bao, Z. Yao, et al., Simmim: a simple framework for masked image modeling, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2022), 9653–9663. |
[40] | D. E. King, Dlib-ml: a machine learning toolkit, J. Mach. Learn. Res., 10 (2009), 1755–1758. Available from: https://www.jmlr.org/papers/volume10/king09a/king09a.pdf. |
[41] |
Z. Guo, G. Yang, J. Chen, X. Sun, Exposing deepfake face forgeries with guided residuals, IEEE Trans. Multimedia, 25 (2023), 8458–8470. https://doi.org/10.1109/TMM.2023.3237169 doi: 10.1109/TMM.2023.3237169
![]() |
[42] | M. Schroepfer, Creating a data set and a challenge for deepfakes, in Facebook Artificial Intelligence, 5 (2019). Available from: https://ai.facebook.com/blog/deepfake-detection-challenge. |
[43] | Y. Li, X. Yang, P. Sun, H. Qi, S. Lyu, Celeb-df: a large-scale challenging dataset for deepfake forensics, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2020), 3207–3216. |
[44] | L. Jiang, R. Li, W. Wu, C. Qian, C. C. Loy, Deeperforensics-1.0: a large-scale dataset for real-world face forgery detection, in 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2020), 2886–2895. https://doi.org/10.1109/CVPR42600.2020.00296 |
[45] | G. Bradski, The opencv library, in Dr. Dobb's Journal: Software Tools for the Professional Programmer, 25 (2000), 120–123. |
[46] | R. R. Selvaraju, M. Cogswell, A. Das, R. Vedantam, D. Parikh, D. Batra, Grad-cam: visual explanations from deep networks via gradient-based localization, in 2017 IEEE International Conference on Computer Vision (ICCV), (2017), 618–626. https://doi.org/10.1109/ICCV.2017.74 |
[47] | 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 (CVPR), (2016), 770–778. |
[48] | M. Tan, Q. Le, Efficientnet: rethinking model scaling for convolutional neural networks, in Proceedings of the 36th International Conference on Machine Learning, (2019), 6105–6114. |
1. | ChungYuen Khew, Rahmad Akbar, Norfarhan Mohd-Assaad, Progress and challenges for the application of machine learning for neglected tropical diseases, 2023, 12, 2046-1402, 287, 10.12688/f1000research.129064.1 | |
2. | ChungYuen Khew, Rahmad Akbar, Norfarhan Mohd-Assaad, Progress and challenges for the application of machine learning for neglected tropical diseases, 2025, 12, 2046-1402, 287, 10.12688/f1000research.129064.2 |