Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Weakly supervised salient object detection via image category annotation


  • The rapid development of deep learning has made a great progress in salient object detection task. Fully supervised methods need a large number of pixel-level annotations. To avoid laborious and consuming annotation, weakly supervised methods consider low-cost annotations such as category, bounding-box, scribble, etc. Due to simple annotation and existing large-scale classification datasets, the category annotation based methods have received more attention while still suffering from inaccurate detection. In this work, we proposed one weakly supervised method with category annotation. First, we proposed one coarse object location network (COLN) to roughly locate the object of an image with category annotation. Second, we refined the coarse object location to generate pixel-level pseudo-labels and proposed one quality check strategy to select high quality pseudo labels. To this end, we studied COLN twice followed by refinement to obtain a pseudo-labels pair and calculated the consistency of pseudo-label pairs to select high quality labels. Third, we proposed one multi-decoder neural network (MDN) for saliency detection supervised by pseudo-label pairs. The loss of each decoder and between decoders are both considered. Last but not least, we proposed one pseudo-labels update strategy to iteratively optimize pseudo-labels and saliency detection models. Performance evaluation on four public datasets shows that our method outperforms other image category annotation based work.

    Citation: Ruoqi Zhang, Xiaoming Huang, Qiang Zhu. Weakly supervised salient object detection via image category annotation[J]. Mathematical Biosciences and Engineering, 2023, 20(12): 21359-21381. doi: 10.3934/mbe.2023945

    Related Papers:

    [1] Yicang Zhou, Zhien Ma . Global stability of a class of discrete age-structured SIS models with immigration. Mathematical Biosciences and Engineering, 2009, 6(2): 409-425. doi: 10.3934/mbe.2009.6.409
    [2] Rundong Zhao, Qiming Liu, Huazong Zhang . Dynamical behaviors of a vector-borne diseases model with two time delays on bipartite networks. Mathematical Biosciences and Engineering, 2021, 18(4): 3073-3091. doi: 10.3934/mbe.2021154
    [3] Kazuo Yamazaki, Xueying Wang . Global stability and uniform persistence of the reaction-convection-diffusion cholera epidemic model. Mathematical Biosciences and Engineering, 2017, 14(2): 559-579. doi: 10.3934/mbe.2017033
    [4] Yong Zhou, Minrui Guo . Isolation in the control of epidemic. Mathematical Biosciences and Engineering, 2022, 19(11): 10846-10863. doi: 10.3934/mbe.2022507
    [5] Martin Luther Mann Manyombe, Joseph Mbang, Jean Lubuma, Berge Tsanou . Global dynamics of a vaccination model for infectious diseases with asymptomatic carriers. Mathematical Biosciences and Engineering, 2016, 13(4): 813-840. doi: 10.3934/mbe.2016019
    [6] Arti Mishra, Benjamin Ambrosio, Sunita Gakkhar, M. A. Aziz-Alaoui . A network model for control of dengue epidemic using sterile insect technique. Mathematical Biosciences and Engineering, 2018, 15(2): 441-460. doi: 10.3934/mbe.2018020
    [7] Haijun Hu, Xupu Yuan, Lihong Huang, Chuangxia Huang . Global dynamics of an SIRS model with demographics and transfer from infectious to susceptible on heterogeneous networks. Mathematical Biosciences and Engineering, 2019, 16(5): 5729-5749. doi: 10.3934/mbe.2019286
    [8] Churni Gupta, Necibe Tuncer, Maia Martcheva . A network immuno-epidemiological model of HIV and opioid epidemics. Mathematical Biosciences and Engineering, 2023, 20(2): 4040-4068. doi: 10.3934/mbe.2023189
    [9] Hai-Feng Huo, Qian Yang, Hong Xiang . Dynamics of an edge-based SEIR model for sexually transmitted diseases. Mathematical Biosciences and Engineering, 2020, 17(1): 669-699. doi: 10.3934/mbe.2020035
    [10] Fang Wang, Juping Zhang, Maoxing Liu . Dynamical analysis of a network-based SIR model with saturated incidence rate and nonlinear recovery rate: an edge-compartmental approach. Mathematical Biosciences and Engineering, 2024, 21(4): 5430-5445. doi: 10.3934/mbe.2024239
  • The rapid development of deep learning has made a great progress in salient object detection task. Fully supervised methods need a large number of pixel-level annotations. To avoid laborious and consuming annotation, weakly supervised methods consider low-cost annotations such as category, bounding-box, scribble, etc. Due to simple annotation and existing large-scale classification datasets, the category annotation based methods have received more attention while still suffering from inaccurate detection. In this work, we proposed one weakly supervised method with category annotation. First, we proposed one coarse object location network (COLN) to roughly locate the object of an image with category annotation. Second, we refined the coarse object location to generate pixel-level pseudo-labels and proposed one quality check strategy to select high quality pseudo labels. To this end, we studied COLN twice followed by refinement to obtain a pseudo-labels pair and calculated the consistency of pseudo-label pairs to select high quality labels. Third, we proposed one multi-decoder neural network (MDN) for saliency detection supervised by pseudo-label pairs. The loss of each decoder and between decoders are both considered. Last but not least, we proposed one pseudo-labels update strategy to iteratively optimize pseudo-labels and saliency detection models. Performance evaluation on four public datasets shows that our method outperforms other image category annotation based work.



    With the global population continuously increasing and people's social networks expanding, the study of disease transmission has gained increasing importance. Taking COVID-19 as an example, it is evident that formulating appropriate control strategies based on the epidemic's characteristics can optimize the utilization of social resources, minimize economic losses, and reduce human casualties. In recent years, there have been significant advancements in the field of infectious disease dynamics, which have provided valuable guidance for disease transmission control and treatment. Mathematical models play a crucial role in infectious disease dynamics research by elucidating the key characteristics of diseases through assumptions, parameters, variables, and their interrelationships. Through the application of dynamic methods, mathematical models can be developed to investigate whether a specific infectious disease will continue to spread and become endemic in a particular region, or if it will eventually be eradicated.

    In the realm of infectious disease modeling, compartmental models are prevalently utilized for analyzing disease spread. These models postulate that populations are divisible into homogeneous subgroups or compartments, within which individuals are indistinguishable. Parameters may vary among compartments but are constant within each one. Foundational compartmental models, such as the susceptible-infected-susceptible (SIS) and susceptible-infected-recovered (SIR) models proposed by Kermack and McKendrick [1], along with the concept of epidemic thresholds, have established a rigorous mathematical framework for the study of disease spread and the evaluation of control strategies. Progress in research has led to the introduction of additional compartments and the development of more realistic models [2,3,4,5].

    The interaction between different types of networks and the dynamics of disease transmission primarily concerns how various social network structures influence the spread of diseases. For instance, scale-free networks, characterized by a few highly connected nodes, may facilitate rapid disease propagation across a large population [6,7,8,9], while small-world networks, known for short average path lengths and strong social connections, might accelerate disease spread within closely-knit groups [10,11,12,13]. These network characteristics are crucial for understanding and predicting how infectious diseases spread through populations and for formulating effective control strategies. Beyond the previously discussed models, there are also epidemic models specifically designed for overlapping community networks, as described in [14,15]. Hence, disease models need to consider these network properties to more accurately predict and address disease transmission.

    Several studies indicate that asymptomatic carriers may exhibit higher transmissibility compared to symptomatic individuals. This is attributed to asymptomatic individuals often not experiencing noticeable illness, thus possibly not undertaking necessary isolation and prevention measures. To enhance our understanding of the impact of asymptomatic carriers on disease transmission, researchers have proposed refined models, including the extensively studied SEIR model, which encompasses four states: susceptible, exposed, infectious, and recovered [16,17]. These studies highlight the significant role of asymptomatic individuals in the dynamics of disease transmission, suggesting a need for cost-effective detection methods, such as nucleic acid testing, to inform disease control strategies. The role of asymptomatic spreaders may correlate with their social contact patterns, with skewed degree distributions indicating that some individuals, like asymptomatic carriers, have higher connectivity in social networks, potentially playing a more significant role in disease spread [18,19].

    Individual migration refers to the movement of individuals from one node to another within a network, thereby facilitating the spread of diseases across regions or communities. Such migration can be motivated by various factors, including employment, travel, or other socio-economic considerations. Incorporating individual migration in infectious disease models is crucial, as it allows diseases to traverse broader geographical or social boundaries, impacting the epidemiological dynamics across the entire network [20]. Studies, such as [21], have shown that high mobility between areas with differing infection rates significantly impacts the spread of diseases like COVID-19. Current research suggests the implementation of appropriate travel restrictions to help control the spread of diseases from high to low prevalence areas [22,23]. Additionally, the influence of migration on disease replication and diffusion, as well as the unequal migration rates among different populations, which can substantially affect the effectiveness of control strategies, are important considerations [24].

    In numerous diseases like COVID-19, asymptomatic carriers exist. While symptomatic individuals can be isolated during epidemic management, asymptomatic carriers might spread the virus when moving to other communities. To understand their impact on disease transmission, a numerical analysis of a complex network infectious disease model across six regions was conducted, based on [25]. The study examines if a topological structure exists that minimizes active infections over time. We extend this model to a more general complex network model, incorporating asymptomatic transmission and migration features. By integrating graph theory and stability analysis, the equilibrium and stability of the nonlinear system are theoretically proven, laying a solid foundation for effective epidemic management strategies. For example, this research can inform decisions on whether it is necessary to invest a significant amount of time or resources in nucleic acid testing, by considering other studies or real-world conditions.

    The key contributions of this research are threefold. First, we extend the existing model of [25] to complex networks, specifically scale-free networks, enabling a more realistic representation of disease dynamics in interconnected populations with varying degrees of connectivity. Second, we explore the stability of the nonlinear system model with asymptomatic infections on a scale-free network, substantiating the findings through rigorous theoretical proofs and simulations. Last, we investigate the dynamic behaviors of diseases in the presence of migration and assess the specific impact of unequal migration rates between different populations on disease spread.

    We specifically examine the SAIR infectious disease model within a scale-free network characterized by degree correlations. We aim to explore effective strategies for controlling disease outbreaks within communities that experience migration between them. The threshold R0, which represents the level of disease transmissibility, is determined by employing the next-generation matrix. Moreover, the global asymptotic stability of both the disease-free equilibrium and the endemic equilibrium is demonstrated through the application of the decomposition theorem [26] and the development of Lyapunov functions.

    This paper is organized as follows. In Section 2, we propose an SAIR infectious disease dynamic model based on an uncorrelated network. In Section 3, we prove the existence of two equilibria of the model and calculate the basic reproduction number R0 using the next-generation matrix method. In Section 4, we use the decomposition theorem and construct Lyapunov functions to prove the global asymptotic stability of both the disease-free equilibrium and the endemic equilibrium of the system. In Section 5, we conduct numerical simulations in MATLAB to validate the theoretical results. The paper concludes in Section 6, providing some conclusions and suggestions for future work.

    Individual migration refers to the movement of individuals from one node of the network to another, thereby facilitating the spread of diseases from one region or community to another. This type of migration can be driven by various reasons, such as employment, travel, or other socio-economic factors. In models of infectious diseases, considering individual migration is crucial as it enables diseases to transcend broader geographical or social boundaries, thereby influencing the epidemic dynamics across the entire network [20]. We employ network topology to represent the migration between individuals, assuming that within the same community, i.e., each node on the network, the total influx of different population groups, such as susceptible individuals, equals the total outflux. Infected individuals are either consciously or forcibly restricting their movements, so there is no community migration of groups with symptomatic infections.

    In the real world, social networks often exhibit the characteristics of scale-free networks, with a power-law degree distribution as their primary feature. As demonstrated in the literature [27], this common structure of social networks not only possesses the characteristic of a power-law distribution but also exhibits a dual nature of robustness and vulnerability. Furthermore, in the literature [28], an analysis of the distribution of user activities on different social media platforms reveals a similar adherence to a power-law distribution. Building upon this, We focus on the issue of epidemic spread on scale-free networks. Specifically, we extend the model proposed in the literature [25] to form model (2.1). In this model, individuals within the same node are considered to have identical characteristics, i.e., the same parameter values. Individuals within each node undergo different forms of infection processes and spread between nodes through migration at a constant rate.

    Thus, this article constructs a SAIR model to describe the spread of disease within a network.

    {˙Sk(t)=Λβk(θkAk(t)+Ik(t))Sk(t)μSk(t)σSSk(t)+σSkni=1p(ik)iSi(t),˙Ak(t)=βk(θkAk(t)+Ik(t))Sk(t)vkAk(t)μAk(t)σAAk(t)+σAkni=1p(ik)iAi(t),˙Ik(t)=vkAk(t)δkIk(t)μIk(t),˙Rk(t)=δkIk(t)μRk(t)σRRk(t)+σRkni=1p(ik)iRi(t). (2.1)

    In the epidemic network we consider, each node can be in one of four different states at any time: susceptible (S), asymptomatic infected (A), symptomatic infected (I), or recovered (R). Susceptible individuals (S) can become infected by contacting symptomatic infected individuals (I) and asymptomatic infected individuals (A), with an infection rate of β(θA+I), where θ represents the transmission modifying parameter for asymptomatic infected individuals (A). Only a small fraction of asymptomatic infected individuals (A) with symptoms transition to symptomatic infected individuals (I) at a rate of ν, and symptomatic infected individuals (I) recover/are removed at a rate of δ. σS, σA, and σR represent the migration rates of susceptible individuals (S), asymptomatic infected individuals (A), and recovered individuals (R) among different communities, respectively. The constant parameters Λ and μ represent the birth rate and natural death rate of individuals, respectively.

    Due to the complexity of network structures, this article divides the nodes in the network into n classes according to their degrees, where n is the maximum degree of the network. In other words, if the degrees of nodes i and j are both k, then they belong to the kth class, where k1,2,,n. The state variables Sk(t), Ak(t), Ik(t), and Rk(t) represent the relative density of susceptible, asymptomatic, symptomatic, and recovered nodes with degree k. The expression p(i|k) is the probability that a node with degree k is connected to a node with degree i. In an uncorrelated network, it is expressed as p(i|k)=ik which is considered independent of the connectivity of the node that sends out the link, where k represents the average degree of the network.

    Remark 1. Symptomatic individuals, whether voluntarily or due to enforced restrictions, tend to restrict their activities. Consequently, there is no migration of symptomatic infection groups between communities, and migration is virtually non-existent. The social contact matrix is represented as 0. In contrast, asymptomatic individuals are those who have been infected with pathogens, such as viruses or bacteria, without exhibiting typical disease symptoms like fever, cough, or headache. Their clinical characteristics closely resemble those of susceptible and recovered individuals. Drawing inspiration from references [29,30], we can express the social contact matrix between asymptomatic individuals, susceptible individuals, and recovered individuals as Aji=kjkiNk(i,j=1,2,,n), where each element represents the probability of contact between individuals at node i and node j. Here, ki and kj represent the degrees of node i and node j, respectively. From a mean-field perspective, in the context of scale-free networks, the term for inter-community migration can be observed as the final component of model (2.1). However, as asymptomatic individuals also carry the pathogen, they possess the potential to transmit the disease, akin to symptomatic individuals, through contact. The transmission probability can be represented as βkθkAkSk, where θk is a corrective parameter distinguishing it from the infection rate of symptomatic individuals. Additionally, we intend to consider adjusting parameters such as v in the future using control measures like nucleic acid testing to enhance epidemic management. Consequently, research on asymptomatic individuals carries significant importance. It is important to note that, for the sake of research convenience, this paper has not yet factored in the difference in recovery rates between asymptomatic and symptomatic individuals. Nonetheless, a more precise clinical characterization will become a crucial avenue for future research.

    Remark 2. The model presented in this article (model (2.1)) has several limitations. First, although in theory, social networks can be considered scale-free networks, exhibiting power-law characteristics, many field experiments suggest that real contact networks do not follow a power-law distribution [31]. Nevertheless, scale-free networks, as a theoretical model, can effectively capture and reflect key features of real networks, such as the high concentration of connections in certain nodes. This simplification makes mathematical and computational analyses feasible, providing valuable insights for a deeper understanding of network dynamics. Second, to maintain the simplicity and ease of analysis, and since the focus of the study is on understanding long-term immune dynamics, this article omits the exposure stage by choosing to exclude the exposed category (E). It is undeniable that the exposed category (E) is crucial for the spread of the disease, and this omission represents a limitation of the model presented in this article.

    Based on Theorem 6 in the literature [26], it can be observed that the solution to model (2.1) exhibits existential uniqueness for a given initial value. Below, we present two distinct solutions to the model.

    The disease-free equilibrium and endemic equilibrium are determined by solving Eq (2.1) with the right-hand side set to 0:

    Λβk(θkAk(t)+Ik(t))Sk(t)μSk(t)σSSk(t)+σSkkni=1p(i)Si(t)=0,βk(θkAk(t)+Ik(t))Sk(t)vkAk(t)μAk(t)σAAk(t)+σAkkni=1p(i)Ai(t)=0,vkAk(t)δkIk(t)μIk(t)=0,δkIk(t)μRk(t)σRRk+σR(t)kkni=1p(i)Ri(t)=0. (3.1)

    Clearly, model (2.1) possesses a disease-free equilibrium:

    E0k=(S0k,A0k,I0k,R0k)=(Λμ+σS+σSμ+σSk<k>Λμ,0,0,0).

    To determine the endemic equilibrium, we initially manipulate Eq (3.1) to acquire:

    A+k=δk+μνkI+k,S+k=1μ+σs[Λ+σsk<k>S++σAk<k>A+(νk+μ+σA)A+k],R+k=1μ+σR(δkI+k+σRk<k>R+).

    In this context, S+, A+, and R+ represent the total number (density) of susceptible individuals, asymptomatic infected individuals, and recovered individuals in each community, respectively. In other words, S+=ni=1p(i)S+i(t), A+=ni=1p(i)A+i(t), and R+=ni=1p(i)R+i(t). By substituting the above equation into the first equation of Eq (3.1), we obtain (A+k)2+bA+k+c=0, where b=(Λ+σsk<k>S++σAk<k>A+)μ+σsνk+μ+σA+(μ+σs)(δk+μ)βkθk(δk+μ)+βkνk, c=μ+σsνk+μ+σAδk+μβkθk(δk+μ)+βkνkσAk<k>A+.

    Therefore, we find that A+k=b+b24c2>0. Next, we will demonstrate the positive definiteness of the local disease equilibrium.

    Theorem 1. Let D={(S1,A1,I1,R1,,Sn,An,In,Rn)R4n+,Nk(t)=Sk+Ak+Ik+RkΛμ}. The set D is positively invariant for model (2.1).

    Proof. First, we illustrate the solution is positive. According to A+k>0, and A+k=(δk+μ)νkI+k, we know that I+k>0. By weighting and summing the fourth equation of (3.1), we have nk=1p(k)δkI+k(t)μnk=1p(k)R+k(t)=0, thus R+>0 and consequently, R+k>0. By weighting and summing the second equation of (3.1), we have nk=1p(k)βk(θkA+k(t)+I+k(t))S+k(t)nk=1p(k)vkA+k(t)μnk=1p(k)A+k(t)=0. It is obvious that nk=1βk(θkA+k(t)+I+k(t))nk=1p(k)S+k(t)nk=1p(k)βk(θkA+k(t)+I+k(t))S+k(t)>0, which indicates that S+>0. Assuming that S+k<0, then t,˙Sk>0, which is a contradiction. Therefore, S+k>0. Next, we illustrate the boundedness of the solution. The total population of each node is defined by Nk(t)=Sk(t)+Ak(t)+Ik(t)+Rk(t), which satisfies ˙Nk(t)=μNk(t)+Λ. Obviously, we can get Nk(t)=[Nk(0)Λμ]eμt+Λμ. So, we can get that t0,Nk(t)=Sk+Ak+Ik+RkΛμ.

    The basic reproduction number, denoted as R0, plays a pivotal role in epidemiology. It represents the average number of people an infected individual can transmit the disease to in the absence of any intervention measures. The computation of R0 varies depending on the mode of disease transmission and the epidemiological model employed. Common methodologies include the next-generation matrix, epidemiological parameter estimation, branching process models, and dynamical systems analysis. The most frequently used method, particularly applicable to the compartmental models discussed in this article, is the next-generation matrix [32,33,34,35]. This approach primarily involves calculating the average number of secondary infections generated by an infective individual over the course of their infectious period. It typically requires the computation of the average expected matrix of disease transmission, followed by determining its largest eigenvalue.

    According to the method of the second moment matrix, we can initially classify the districts into diseased districts F(x) and non-diseased districts V(x), as given by:

    F(x)=(βk(θkAk(t)+Ik(t))Sk(t)+σAk<k>ni=1p(i)Ai(t)0);V(x)=(νkAk(t)+μAk(t)+σAAk(t)νkAk(t)+δkIk(t)+μIk(t)).

    Hence, the basic reproduction number R0 corresponds to the largest spectral radius of the matrix FV1. In this context, F and V represent the Jacobian matrices of F(x) and V(x) evaluated at E0, respectively. The matrix FV1 is defined as:

    FV1=diag(βkθkS0kνk+μ+σA+βkS0kνk(δk+μ)(νk+μ+σA))+Kdiag(σAνk+μ+σA), (3.2)

    where,

    K=[p(1)kp(2)kp(n)k2p(1)k2p(2)k2p(n)knp(1)knp(2)knp(n)k].

    From the above formulas, we can obtain:

    1) When all parameters are the same for each community,

    R0σSkmaxkβθΛ(δ+μ)+βΛν(ν+μ+σA)(μ+σS)(δ+μ)μ+βθΛ(δ+μ)+βΛν(ν+μ+σA)(μ+σS)(δ+μ)+σAν+μ+σA,

    in a finite-scale-free network with N nodes, initial node degree m0, and adding m links at each time, the degree distribution follows p(k)=(γ11)mγ11kγ1. Then, k2m, kmaxmN1/2, R0<1, and N<2(ν+μ)(μ+σS)(δ+μ)μ2[βθΛ(δ+μ)+βΛν]μ[βθΛ(δ+μ)+βΛν]σS are equivalent;

    2) When the parameters in different communities are not exactly the same,

    R0=ρ(FV1)max(βkθkS0kνk+μ+σA+βkS0kνk(δk+μ)(νk+μ+σA))+max(σAνk+μ+σA).

    The basic reproduction number R0 is a critical metric in epidemiology, commonly used to assess the potential for the spread of infectious diseases. In epidemiology, R0 is often compared to 1 to determine the trend of disease transmission: When R0>1, it signifies that, on average, each infected individual can transmit the disease to more than one person. In such cases, it is expected that the disease will spread in the population and may lead to an epidemic. When R0=1, each infected individual, on average, transmits the disease to only one other person, and the spread of the disease remains stable without expansion or reduction. When R0<1, each infected individual, on average, transmits the disease to fewer than one person, indicating that the disease spread will gradually decline and may eventually disappear. Therefore, control measures and preventive strategies are typically designed to reduce R0 to below 1, slowing down the spread of the disease and gaining control over the outbreak.

    In situations where the network topology is uncertain, meaning the corresponding adjacency matrix is uncertain, the precise computation of the value of R0 becomes challenging. In such cases, establishing an upper bound for R0 is both important and meaningful. Determining an upper bound for R0 helps us assess the potential risk of disease spread in the worst-case scenario and provides a safe threshold for epidemic control strategies. Even when the precise calculation of R0 is not feasible, analyzing factors that may influence the upper bound of R0 still offers valuable insights into effective epidemic control strategies.

    In the context of metapopulation network models for infectious diseases, this study distinguishes between two distinct scenarios: the homogeneous case, where all communities share identical parameters, and the heterogeneous case, where parameters vary among different communities. The formulation of the upper bound for the basic reproduction number, R0, differs under these two circumstances. It's worth noting that the homogeneous scenario essentially serves as a specific instance of the more general heterogeneous case.The analysis within this article primarily focuses on the latter, more complex scenario of heterogeneous community parameters. This approach inherently encompasses the homogeneous case, providing a comprehensive framework applicable to both specific and varied settings. Furthermore, the core of this manuscript revolves around the stability analysis of the model. It posits that if the conclusions derived for the general case (heterogeneous parameters) hold true, they will invariably apply to the special case (homogeneous parameters) as well. This methodology ensures the analysis's robustness and wide applicability, catering to a diverse range of epidemiological scenarios encountered in real-world situations.

    In the following section, we will address the local stability and global stability of equilibrium points for the model under general conditions (heterogeneous parameters). The stability conclusions derived are equally applicable to the special case (homogeneous parameters). First, let's analyze the local asymptotic stability of the disease-free equilibrium point in the system.

    Theorem 2. If R0<1, then the disease free equilibrium E0 is locally asymptotically stable. If R0>1, the disease free equilibrium E0 is unstable.

    Proof. The Jacobian matrix of system (2.1) at the disease-free equilibrium E0 is:

    M=[B+σS(KE)CD00CFB+σA(KE)D00FBG000GB+σR(KE)],

    where, B=diag(μ),C=diag(βkθkS0k),D=diag(βkS0k),F=diag(νk),G=diag(δk), because,

    ρ(σS(KE)B)<ρ(σSEB)+ρ(σSK)=max(μ)<0,ρ(σR(KE)B)<ρ(σREB)+ρ(σRK)=max(μ)<0,

    and

    [CFB+σA(KE)DFBG],

    make a line change, we can get

    [CFB+σA(KE)+DF(B+G)0FBG].

    Obviously,

    ρ(BG)=max(μδk)<0;ρ(CFB+σA(KE)+DF(B+G))=ρ(diag(νk+μ+σA)diag(βkS0kνk(δk+μ)(νk+μ+σA)+βkθkS0kνkμσAνk+μ+σA+σAKνk+μ+σA1))ρ(diag(νk+μ+σA))ρ(diag(βkS0kνk(δk+μ)(νk+μ+σA)+βkθkS0kνkμσAνk+μ+σA+σAKνk+μ+σA1))=ρ(diag(νk+μ+σA))(R01)<0.

    The eigenvalues of M are in the left half open plane of the complex plane, so the disease free equilibrium E0 is locally asymptotically stable.

    Theorem 3. If R0<1, then the disease free equilibrium E0 is globally asymptotically stable. If R0>1, the disease free equilibrium E0 is unstable.

    Proof. We utilize an approach from page 4 of Castillo-Chavez et al. (2002) [27] to establish the global stability of the disease-free equilibrium within the system. Within the framework of this theorem, we rewrite system (2.1) as:

    dXdt=F(X,Y),
    dYdt=G(X,Y),withG(X,0)=0,

    here, X=(S1,S2,,Sn,R1,R2,,Rn)R2n+ and Y=(A1,A2,,An,I1,I2,,In)R2n+ denote the dependent variables of uninfected and infected individuals, respectively. The right-hand sides, i.e., F(X,Y) and G(X,Y) are, respectively,

    (Λβ1(θ1A1+I1)S1μS1σsS1+σs1<k>ni=1p(i)SiΛβ2(θ2A2+I2)S2μS2σsS2+σs2<k>ni=1p(i)SiΛβn(θnAn+In)SnμSnσsSn+σsn<k>ni=1p(i)Siδ1I1μR1σRR1+σR1<k>ni=1p(i)Riδ2I2μR2σRR2+σR2<k>ni=1p(i)RiδnInμRnσRRn+σRn<k>ni=1p(i)Ri);(β1(θ1A1+I1)S1ν1A1μA1σAA1+σA1<k>ni=1p(i)Aiβ2(θ2A2+I2)S2ν2A2μA2σAA2+σA2<k>ni=1p(i)Aiβn(θnAn+In)SnνnAnμAnσAAn+σAn<k>ni=1p(i)Aiν1A1δ1I1μI1ν2A2δ2I2μI2νnAnδnInμIn).

    According to the approach in [27], the disease-free equilibrium in this context can be expressed as:

    E0k=(X,0)=(Λμ+σS+σSμ+σS1<k>Λμ,,Λμ+σS+σSμ+σSn<k>Λμ,0,,0,0,,0,0,,0),

    is globally asymptotically stable for R0<1 as long as the following conditions are met for (X, Y). In the first step, we understand that for the sub-system:

    dXdt=F(X,0)=(ΛμS1σsS1+σs1<k>ni=1p(i)SiΛμS2σsS2+σs2<k>ni=1p(i)SiΛμSnσsSn+σsn<k>ni=1p(i)SiμR1σRR1+σR1<k>ni=1p(i)RiμR2σRR2+σR2<k>ni=1p(i)RiμRnσRRn+σRn<k>ni=1p(i)Ri),

    the equilibrium, X=(Λμ+σS+σSμ+σS1<k>Λμ,,Λμ+σS+σSμ+σSn<k>Λμ,0,,0), is globally asymptotically stable, which is a decoupled linear system.

    Second, we observe that the Jacobian matrix given by

    A|E0=[A11A12A21A22],

    is clearly an Metzler-matrix. Here,

    A11=[β1θ1ν1μσA+σA1p(1)<k>σA1p(2)<k>σA1p(n)<k>,σA2p(1)<k>β2θ2νμ2σA+σA2p(2)<k>σA2p(n)<k>σAnp(1)<k>σAnp(2)<k>βnθnνnμσA+σAnp(n)<k>],
    A12=[β1000β2000βn],A21=[ν1000ν2000νn],A22=[δ1μ1000δ2μ2000δnμn].

    Then, we can get

    ˜G(X,Y)=AYG(X,Y)=A[A1A2AnI1I2In][β1(θ1A1+I1)S1ν1A1μA1σAA1+σA1<k>ni=1Aiβ2(θ2A2+I2)S2ν2A2μA2σAA2+σA2<k>ni=1Aiβn(θnAn+In)SnνnAnμAnσAAn+σAn<k>ni=1Aiν1A1δ1I1μI1ν2A2δ2I2μI2νnAnδnInμIn]=[β1(1S1)(θ1A1+I1)β2(1S2)(θ2A2+I2)βn(1Sn)(θnAn+In)000]0.

    Utilizing the approach found on page 4 of [27], we can establish that the disease-free equilibrium E0 is globally asymptotically stable.

    Theorem 4. In positive invariant D, the endemic equilibrium E+ of system is globally asymptotically stable, if R01.

    Proof. Consider the Lyapunov function:

    Vk=c1(SkS+kS+klnSkS+k)+c2(AkA+kA+klnAkA+k)+c3(IkI+kI+klnIkI+k),

    with the positive coefficients c1, c2, c3 satisfy c1=c2=1, c3νkA+k=c1βkS+kI+k.

    As constructed, Vk is a non-negative functional and we have

    Vk=0(Sk,Ak,Ik,Rk)=Ek+.

    Whose derivative along the solution Ek+ gives

    ˙Vk=c1(1S+kSk)[Λβk(θAk+Ik)SkμSkσSSk+σSkkni=1p(i)Si]+c2(1A+kAk)[βk(θAk+Ik)SkνkAkμAkσAAk+σAkkni=1p(i)Ai]+c3(1I+kIk)[νkAkδkIkμIk].

    Since ˙S+k=˙A+k=˙I+k=0 is satisfied at Ek+, we can get:

    ˙Vk=c1(1S+kSk)[βk(θkA+k+I+k)S+kβk(θkAk+Ik)Sk+μ(S+kSk)+σS(S+kSk)+σSkkni=1p(i)(SiS+i)]+c2(1A+kAk)[βk(θkA+k+I+k)S+k+βk(θkAk+Ik)Sk+(νk+μ)(A+kAk)+σA(A+kAk)+σAkkni=1p(i)(AiA+i)]+c3(1I+kIk)[νk(AkA+k)+(δk+μ)(I+kIk)]=ϕ1k+ϕ2k+ϕ3k,

    where,

    ϕ1k=c1(1S+kSk)[βk(θkA+k+I+k)S+kβk(θkAk+Ik)Sk+μ(S+kSk)]+c2(1A+kAk)[βk(θkA+k+I+k)S+k+βk(θkAk+Ik)Sk+(νk+μ)(A+kAk)]+c3(1I+kIk)[νk(AkA+k)+(δk+μ)(I+kIk)];ϕ2k=c1(1S+kSk)[σS(S+kSk)+σSkkni=1p(i)(SiS+i)];ϕ3k=c2(1A+kAk)[σA(A+kAk)+σAkkni=1p(i)(AiA+i)].

    First, simplifying ϕ1k, we can get:

    ϕ1k=(c1βkθkA+kS+kc1βkθkAkSk+c1βkI+kS+kc1βkIkSkc1βkθkA+kS+kS+kSk+c1βkAkS+kc1βkI+kS+kS+kSk+c1βkIkS+kc2βkθkA+kS+kc2βkI+kS+k+c2βkθkAkSk+c2βkIkSk+c2βkθkA+kA+kS+kAk+c2βkI+kA+kS+kAkc2βkθkA+kSkc2βkIkA+kSkAk+c1βkθkA+kS+kc1βkθkA+kS+k)+c1(1S+kSk)(μ)(S+kSk)+c2(1A+kAk)(νk+μ)(A+kAk)+c3(1I+kIk)[νk(AkA+k)+(δk+μ)(I+kIk)]=c1βkθkA+kS+k(SkS+k+S+kSk2)c1(μ)S+k(SkS+k+S+kSk2)+c1βkθkA+kS+k(AkA+k+A+kAk2)c2(νk+μ)A+k(AkA+k+A+kAk2)c3νkA+k(AkA+k+A+kAk2)+c3νkA+k(AkA+k+A+kAk2)+c1βk(1S+kSk)(I+kS+kIkSk)+c1(1A+kAk)(IkSkI+kS+k)+c3(1I+kIk)(νkAkνkA+k)c3(δk+μ)I+k(IkI+k+I+kIk2)=ψ1k+ψ2k+ψ3k,

    with,

    ψ1k=c1βkθkA+kS+k(SkS+k+S+kSk2)c1μS+k(SkS+k+S+kSk2)=c1(Λ+βkI+kS+k)(SkS+k+S+kSk2)+σS(SkS+k+S+kSk2)σSkkni=1p(i)S+i(SkS+k+S+kSk2);ψ2k=c1βkθkA+kS+k(AkA+k+A+kAk2)c2(νk+μ)A+k(AkA+k+A+kAk2)+c3νkA+k(AkA+k+A+kAk2)=σS(AkA+k+A+kAk2)σSkkni=1p(i)A+i(AkA+k+A+kAk2);ψ3k=c3νkA+k(AkA+k+A+kAk2)+c1βk(1S+kSk)(I+kS+kIkSk)+c1βk(1A+kAk)(IkSkI+kS+k)+c3(1I+kIk)(νkAkνkA+k)c3(δk+μ)I+k(IkI+k+I+kIk2)=c1βkS+kI+k(3S+kSkAkI+kA+kIkA+kIkSkAkI+kS+k)0.

    It is seen that ψ3k0, by virtue of the elementary inequality (xyz)1/3x+y+z3.

    Next, we discuss those with migration items:

    ψ1k+ϕ2kc1σSni=1p(i)S+ikk(SiS+iSiS+kS+iSkSkS+k+1),ψ2k+ϕ3k=c2σAni=1p(i)A+ikk(AiA+iAiA+kA+iAkAkA+k+1).

    Then, by virtue of the elementary inequality 1x+lnx0,x>0. we can get that

    ˙Vk=ϕ1k+ϕ2k+ϕ3k=ψ1k+ψ2k+ψ3k+ϕ2k+ϕ3kσSni=1p(i)S+ikk(SiS+iSiS+kS+iSkSkS+k+1)+σAni=1p(i)A+ikk(AiA+iAiA+kA+iAkAkA+k+1)σSni=1p(i)S+ikk(SiS+i+lnSiS+iSkS+klnSkS+k)+σAni=1p(i)A+ikk(AiA+i+lnAiA+iAkA+klnAkA+k).

    Obviously, there exists a positive constant c such that

    σAkkni=1p(i)A+i=cσSkkni=1p(i)S+i.

    Therefore,

    ˙VkσSkkni=1p(i)S+i(SiS+i+lnSiS+iSkS+klnS+kSk+cAiA+i+clnAiA+icAkA+kclnAkA+k)=σSkkni=1p(i)S+i(cAiA+i+clnAiA+i+SiS+i+lnSiS+i)σSkkni=1p(i)S+i(cAkA+k+clnAkA+k+SkS+k+lnSkS+k)=σSkkni=1p(i)S+i[Gi(Si,Ii)Gk(Sk,Ik)],

    where Gi(Si,Ii)=(cAiA+i+clnAiA+i+SiS+i+lnSiS+i). Consider a randomly generated scale-free network graph with adjacency matrix A=(Aij)nn. The corresponding weighted directed graph is denoted as (G,A). Let li=TTiw(T), in which Ti is the set of all spanning trees T of (G,A) that are rooted at vertex i, and w(T) is the weight of T. In particular, if (G,A) is strongly connected, then li>0 for 1in. and consider the corresponding weight matrix W=(wij) of A, where wij=σSAjikjS+j, and kj is the degree of node j. Then the following equation can be obtained from reference [25]:

    ni=1li˙Vi=ni=1linj=1σSAjikjS+j[Gj(Sj,Ij)Gi(Si,Ii)]=0.

    In the context of mean-field, Aji represents the probability of connection between nodes i and j. Then, by the virtue Aji=kjkiNk, it is seen that

    nk=1lk˙Vknk=1lkσSkkni=1p(i)S+i[Gi(Si,Ii)Gk(Sk,Ik)]=ni=1linj=1σSAjikjS+j[Gj(Sj,Ij)Gi(Si,Ii)]=0.

    From another perspective, since we discuss scale-free networks in a mean-field sense, there is no specific form of the adjacency matrix. However, we can be certain that its result corresponds to the expectation of many specific matrices of scale-free networks. If li can be found for each term such that ni=1li˙Vi equals 0, then its expected form, k=1nlk˙Vk, must also equal 0.

    From the previous context, we already know that the local disease equilibrium E+ has a unique positive solution. By virtue of LaSalle's invariance principle, we can conclude that the disease-free equilibrium E+ is globally asymptotically stable.

    Remark 3. In this paper, we approach the representation of scale-free networks statistically. Consequently, there is no specific matrix diagram for a scale-free network. In such cases, finding specific parameters like li becomes challenging. Therefore, we employ statistical concepts to demonstrate the global stability of the model's endemic equilibrium. In particular, assuming that the spanning tree weights of nodes with the same degree in a scale-free network are equal, we can select the weight of the spanning tree of nodes with the parameter lk representing degree k to show that ˙V0.

    The results from the previous section indicate that when R0<1, the disease-free equilibrium E0 of model (2.1) is globally asymptotically stable, implying that the number of infected individuals will tend towards zero, and the disease will eventually be eradicated. Conversely, when R0>1, the endemic equilibrium E+ of model (2.1) is globally asymptotically stable, indicating that the number of infected individuals will tend towards a positive value I+, and the disease will persist indefinitely. To verify the stability of the equilibria I0 and I+ discussed in the previous section, numerical simulations using MATLAB have been conducted in this section.

    Our focus of this study is to offer a theoretical framework for analyzing and interpreting epidemic dynamics and transmission patterns under various conditions. Therefore, the parameters employed in this study, while thoughtfully constructed within the confines of a mathematical model, may not directly mirror specific biological properties. The objective of the model is to explore and comprehend the theoretical dynamics of infectious diseases and potential epidemiological patterns. This approach enables us to analyze and predict the spread of diseases on a broader and more abstract level, thus contributing to a deeper understanding of the nature of infectious disease dynamics.

    To begin our exploration of the dynamics of various populations in the infectious disease model within a scale-free network, we considered the topological characteristics of such a network. Utilizing the preferential attachment algorithm, where nodes tend to connect to existing nodes with higher degrees, we devised an algorithm for the random generation of a scale-free network. This resulted in a network with a node count of N=1000 and an initial network node count of m0=3. Following the principles of the scale-free network model, m=2 links were added for each new node, as illustrated in Figure 1(a). As depicted in Figure 1(b), the node distribution of this scale-free network follows a power-law form.

    Figure 1.  Scale-free graph with N = 1000 nodes, m0=3, and m=2.

    Second, this study places emphasis on investigating the specific impact of varying migration rates among different populations on the disease transmission capability. Accordingly, under the assumption that parameters across different compartments are equal, the dynamics of various populations within the model have been taken into account. This approach facilitates the exploration of how differential migration rates among susceptible, infected, and recovered individuals within a community network influence the overall disease dynamics.

    Select a set of parameter values: β=0.1, θ=0.02, ν=0.1, δ=0.1, σS=0.01, σA=0.01, σR=0.01, Λ=0.1, μ=0.1, and initial variable values S(0)=0.0033, A(0)=0.0033, I(0)=0.0033, R(0)=0, corresponding to a basic reproduction number of R0=0.8124<1.

    From Figure 2, it can be observed that the equilibrium I is stable and tends towards I0. Additionally, when all other parameters are held constant, the disease takes longer to disappear as k increases.

    Figure 2.  Disease-free.

    Select a set of parameter values: β=0.1, θ=0.02, ν=0.1, δ=0.1, σS=0.01, σA=0.01, σR=0.01, Λ=0.1, μ=0.1, and initial variable values S(0)=0.0033, A(0)=0.0033, I(0)=0.0033, R(0)=0, corresponding to a basic reproduction number of R0=2.5235>1.

    From Figure 3, it is evident that the equilibrium I is stable and tends towards I+. Additionally, when all other parameters remain constant, an increase in k leads to an increase in I+, signifying a higher concentration of the disease.

    Figure 3.  Endemic.

    Observations of the expressions for R0 itself and its upper bound in Section 3 indicate that the basic reproduction number R0 is influenced by factors such as the susceptibility migration rate and the asymptomatic migration rate. To further illustrate and discuss potential epidemic scenarios, we provide an example below.

    Building upon the previous discussion, particularly from Eq (3.1), we have already established the following expressions:

    In the presence of migration, we have,

    R0=ρ(FV1)=ρ(βdiag(θ(δ+μ)+v(v+μ+σA)(δ+μ)S0k)+σAv+μ+σAK).

    Clearly, in the absence of migration, we have,

    R0=βθ(δ+μ)+v(v+μ)(δ+μ)Λμ.

    It is evident from both expressions that they are related to the infection rate. To illustrate the specific impact of migration on the numerical values of R0, taking the scale-free network illustrated in Figure 1 as an example, and we select the following parameters: θ=0.02, ν=0.1, δ=0.1, Λ=0.1, μ=0.1, σS=0.1, and σA=0.1. Figure 4(a) is presented to provide an intuitive visualization of the effects of migration.

    Figure 4.  The analysis of R0.

    Next, to further investigate and demonstrate the influence of different population migration rates on R0, we choose the parameters β=0.1, θ=0.02, ν=0.1, δ=0.1, Λ=0.1, and μ=0.1. This allows us to assess the impact of susceptibility migration rate σS and asymptomatic infection migration rate σA on R0, as shown in Figure 4(b).

    From Figure 4(a), it can be observed that, consistent with the expressions for R0, when migration is present, R0 exhibits a nonlinear relationship with β, whereas in the absence of migration, R0 has a linear relationship with β. Furthermore, under the same parameter conditions, when migration is present, the value of R0 is higher than the basic reproduction number R0 in the absence of migration. This indicates that inter-community migration makes it more challenging to eliminate infectious diseases. This result is highly reasonable because, in the presence of migration, disease transmission is not only directly related to the infection rate within the community but also influenced by the importation of cases from other communities, leading to a nonlinear relationship. In contrast, in the absence of migration, R0 is directly related to the infection rate β. Figure 4(b) illustrates that both the susceptibility migration rate and the asymptomatic infection migration rate have an impact on the basic reproduction number R0. Clearly, as the migration rates increase, the basic reproduction number also increases, indicating that inter-community population migration increases the likelihood of disease outbreaks. Therefore, we can conclude that the existence of migration between communities increases the probability of disease outbreaks and widens the scope of disease transmission. If not properly controlled, it may lead to widespread epidemic outbreaks.

    Remark 4. Our results illustrate that community network structure and population migration have a significant impact on the spread of infectious diseases. Notably, scale-free network structures increase the probability of disease outbreaks, and population migration expands the scope of infection. It is important to note that while the model is based on a scale-free network, the parameter values may not directly reflect biological characteristics. However, the theoretical insights provided by this study are crucial for developing effective infectious disease control strategies. Future work will explore the integration of the model with specific biological data to enhance its practical application value and biological accuracy.

    Considering the exacerbation of the epidemic due to the presence of asymptomatic individuals, especially individual migration between communities leading to widespread outbreaks, we establish a network-based SAIR infectious disease model to investigate the impact of individual migration on the spread of the disease in the presence of asymptomatic individuals. Based on this model, we calculate the epidemic threshold R0 and find that disease transmission is not only related to intra-community parameters such as infection rate and recovery rate but is also influenced by network structure and different population migration rates between communities. Furthermore, we observe and prove, using the method of decomposition theorem and constructing a Lyapunov function, the stability of the disease-free equilibrium when R0<1 and the stability of the endemic equilibrium when R0>1.

    Looking ahead, our objective is to enhance our model by incorporating individual connectivity differences and delving into the impact of asymptomatic carriers on disease transmission. While our current model does not differentiate individual connectivity, we acknowledge the significance of this extension. Our research agenda encompasses addressing this aspect in future studies, planning to explore more intricate network structures, and introducing additional data to better capture subtle variations in individual connectivity. This improvement will not only contribute to a more realistic depiction of disease spread dynamics but will also extensively investigate the role of asymptomatic carriers in various connectivity scenarios. In the future, we will consider models with heterogeneous connectivity, conduct numerical tests, and comprehensively assess the influence of individual connectivity on disease dynamics. Through these efforts, we aim to deepen our understanding of disease transmission and provide valuable insights for the field of infectious disease modeling.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    This work was supported by the Master’s Innovation Foundation of Wenzhou University (Grant 3162023004049).

    The authors declare there is no conflict of interest.



    [1] R. Fan, Q. Hou, M. M. Cheng, G. Yu, R. R. Martin, S. M. Hu, Associating inter-image salient instances for weakly supervised semantic segmentation, in Proceedings of the European Conference on Computer Vision, (2018), 367–383. https://doi.org/10.1007/978-3-030-01240-3_23
    [2] N. Meeboonmak, N. Cooharojananone, Aircraft segmentation from remote sensing images using modified deeply supervised salient object detection with short connections, in International Conference on Mathematics and Computers in Science and Engineering, (2020), 184–187. https://doi.org/10.1109/MACISE49704.2020.00040
    [3] X. Yao, R. Li, J. Zhang, J. Sun, C. Zhang, Explicit boundary guided semi-push-pull contrastive learning for supervised anomaly detection, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2023), 24490–24499.
    [4] N. Yu, H. Li, Q. Xu, A full-flow inspection method based on machine vision to detect wafer surface defects, Math. Biosci. Eng., 20 (2023), 11821–11846. https://doi.org/10.3934/mbe.2023526 doi: 10.3934/mbe.2023526
    [5] S. Hong, T. You, S. Kwak, B. Han, Online tracking by learning discriminative saliency map with convolutional neural network, in International Conference on Machine Learning, (2015), 597–606. https://doi.org/10.48550/arXiv.1502.06796
    [6] Q. Yan, L. Xu, J. Shi, J. Jia, Hierarchical saliency detection, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2013), 1155–1162. https://doi.org/10.1109/CVPR.2013.153
    [7] F. Perazzi, P. Krähenbühl, Y. Pritch, A. Hornung, Saliency filters: Contrast based filtering for salient region detection, in 2012 IEEE Conference on Computer Vision and Pattern Recognition, (2012), 733–740. https://doi.org/10.1109/CVPR.2012.6247743
    [8] L. Zhang, W. Chen, W. Wang, Z. Jin, C. Zhao, Z. Cai, et al., CBGRU: A detection method of smart contract vulnerability based on a hybrid model, Sensors, 22 (2022), 3577. https://doi.org/10.3390/s22093577 doi: 10.3390/s22093577
    [9] L. Zhang, Y. Li, T. Jin, W. Wang, Z. Jin, C. Zhao, et al., SPCBIG-EC: a robust serial hybrid model for smart contract vulnerability detection, Sensors, 22 (2022), 4621. https://doi.org/10.3390/s22124621 doi: 10.3390/s22124621
    [10] L. Zhang, J. Wang, W. Wang, Z. Jin, C. Zhao, Z. Cai, et al., A novel smart contract vulnerability detection method based on information graph and ensemble learning, Sensors, 22 (2022), 3581, https://doi.org/10.3390/s22093581 doi: 10.3390/s22093581
    [11] 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. https://doi.org/10.1109/CVPR.2016.90
    [12] Y. Li, H. Jin, Z. Li, A weakly supervised learning-based segmentation network for dental diseases, Math. Biosci. Eng., 20 (2023), 2039–2060. https://doi.org/10.3934/mbe.2023094 doi: 10.3934/mbe.2023094
    [13] F. Chen, H. Ma, W. Zhang, SegT: Separated edge-guidance transformer network for polyp segmentation, Math. Biosci. Eng., 20 (2023), 17803–17821. https://doi.org/10.3934/mbe.2023791 doi: 10.3934/mbe.2023791
    [14] Q. Feng, X. Xu, Z. Wang, Deep learning-based small object detection: A survey, Math. Biosci. Eng., 20 (2023), 6551–6590. https://doi.org/10.3934/mbe.2023282 doi: 10.3934/mbe.2023282
    [15] C. Wu, L. Chen, A model with deep analysis on a large drug network for drug classification, Math. Biosci. Eng., 20 (2023), 383–401. https://doi.org/10.3934/mbe.2023018 doi: 10.3934/mbe.2023018
    [16] X. Qin, Z. Zhang, C. Huang, C. Gao, M. Dehghan, M. Jagersand, BASNet: Boundary-aware salient object detection, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2019), 7479–7489. https://doi.org/10.1109/CVPR.2019.00766
    [17] J. X. Zhao, J. J. Liu, D. P. Fan, Y. Cao, J. Yang, M. M. Cheng, EGNet: Edge guidance network for salient object detection, in Proceedings of the IEEE International Conference on Computer Vision, (2019), 8779–8788. https://doi.org/10.1109/ICCV.2019.00887
    [18] W. Wang, S. Zhao, J. Shen, S. C. Hoi, A. Borji, Salient object detection with pyramid attention and salient edges, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2019), 1448–1457. https://doi.org/10.1109/CVPR.2019.00154
    [19] Y. Liu, P. Wang, Y. Cao, Z. Liang, R. W. Lau, Weakly-supervised salient object detection with saliency bounding boxes, IEEE Trans. Image Process., 30 (2021), 4423–4435. https://doi.org/10.1109/TIP.2021.3071691 doi: 10.1109/TIP.2021.3071691
    [20] G. Li, Y. Xie, L. Lin, Weakly supervised salient object detection using image labels, in Proceedings of the AAAI Conference on Artificial Intelligence, 32 (2018), 7024–7031. https://doi.org/10.1609/aaai.v32i1.12308
    [21] Y. Piao, J. Wang, M. Zhang, H. Lu, MFNet: Multi-filter directive network for weakly supervised salient object detection, in Proceedings of the IEEE International Conference on Computer Vision, (2021), 4136–4145. https://doi.org/10.1109/ICCV48922.2021.00410
    [22] Y. Piao, W. Wu, M. Zhang, Y. Jiang, H. Lu, Noise-sensitive adversarial learning for weakly supervised salient object detection, IEEE Trans. Multimedia, 25 (2023), 2888–2897. https://doi.org/10.1109/TMM.2022.3152567 doi: 10.1109/TMM.2022.3152567
    [23] J. Zhang, X. Yu, A. Li, P. Song, B. Liu, Y. Dai, Weakly-supervised salient object detection via scribble annotations, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2020), 12546–12555. https://doi.org/10.1109/CVPR42600.2020.01256
    [24] B. Zhou, A. Khosla, A. Lapedriza, A. Oliva, A. Torralba, Learning deep features for discriminative localization, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2016), 2921–2929. https://doi.org/10.1109/CVPR.2016.319
    [25] L. Wang, H. Lu, Y. Wang, M. Feng, D. Wang, B. Yin, et al., Learning to detect salient objects with image-level supervision, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2017), 136–145. https://doi.org/10.1109/CVPR.2017.404
    [26] X. Zhu, C. Tang, P. Wang, H. Xu, M. Wang, J. Che, et al., Saliency detection via affinity graph learning and weighted manifold ranking, Neurocomputing, 312 (2018), 239–250. https://doi.org/10.1016/j.neucom.2018.05.106 doi: 10.1016/j.neucom.2018.05.106
    [27] W. Zou, N. Komodakis, HARF: Hierarchy-associated rich features for salient object detection, in Proceedings of the IEEE International Conference on Computer Vision, (2015), 406–414. https://doi.org/10.1109/ICCV.2015.54
    [28] Y. Pang, X. Zhao, L. Zhang, H. Lu, Multi-scale interactive network for salient object detection, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2020), 9413–9422. https://doi.org/10.1109/CVPR42600.2020.00943
    [29] X. Qin, Z. Zhang, C. Huang, M. Dehghan, O. R. Zaiane, M. Jagersand, U2-Net: Going deeper with nested U-structure for salient object detection, Pattern Recognit., 106 (2020), 107404. https://doi.org/10.1016/j.patcog.2020.107404 doi: 10.1016/j.patcog.2020.107404
    [30] X. Zhao, Y. Pang, L. Zhang, H. Lu, L. Zhang, Suppress and balance: A simple gated network for salient object detection, in Proceedings of the European Conference on Computer Vision, (2020), 35–51. https://doi.org/10.1007/978-3-030-58536-5_3
    [31] L. Tang, B. Li, Y. Zhong, S. Ding, M. Song, Disentangled high quality salient object detection, in Proceedings of the IEEE International Conference on Computer Vision, (2021), 3580–3590. https://doi.org/10.1109/ICCV48922.2021.00356
    [32] M. Ma, C. Xia, J. Li, Pyramidal feature shrinking for salient object detection, in Proceedings of the AAAI Conference on Artificial Intelligence, 35 (2021), 2311–2318. https://doi.org/10.1609/aaai.v35i3.16331
    [33] Y. Song, H. Tang, M. Zhao, N. Sebe, W. Wang, Quasi-equilibrium feature pyramid network for salient object detection, IEEE Trans. Image Process., 31 (2022), 7144–7153. https://doi.org/10.1109/TIP.2022.322005 doi: 10.1109/TIP.2022.322005
    [34] M. Zhuge, D. P. Fan, N. Liu, D. Zhang, D. Xu, L. Shao, Salient object detection via integrity learning, IEEE Trans. Pattern Anal. Mach. Intell., 45 (2022), 3738–3752. https://doi.org/10.1109/TPAMI.2022.3179526 doi: 10.1109/TPAMI.2022.3179526
    [35] Z. Wu, S. Li, C. Chen, H. Qin, A. Hao, Salient object detection via dynamic scale routing, IEEE Trans. Image Process., 31 (2022), 6649–6663. https://doi.org/10.1109/TIP.2022.3214332 doi: 10.1109/TIP.2022.3214332
    [36] Y. H. Wu, Y. Liu, L. Zhang, M. M. Cheng, B. Ren, EDN: Salient object detection via extremely-downsampled network, IEEE Trans. Image Process., 31 (2022), 3125–3136. https://doi.org/10.1109/TIP.2022.3164550 doi: 10.1109/TIP.2022.3164550
    [37] M. Ma, C. Xia, C. Xie, X. Chen, J. Li, Boosting broader receptive fields for salient object detection, IEEE Trans. Image Process., 32 (2023), 1026–1038.https://doi.org/10.1109/TIP.2022.3232209 doi: 10.1109/TIP.2022.3232209
    [38] R. Bi, C. Ji, Z. Yang, M. Qiao, P. Lv, H. Wang, Residual based attention-unet combing DAC and RMP modules for automatic liver tumor segmentation in CT, Math. Biosci. Eng., 19 (2022), 4703–4718. https://doi.org/10.3934/mbe.2022219 doi: 10.3934/mbe.2022219
    [39] H. Zhu, X. He, M. Wang, M. Zhang, L. Qing, Medical visual question answering via corresponding feature fusion combined with semantic attention, Math. Biosci. Eng., 19 (2022), 10192–10212. https://doi.org/10.3934/mbe.2022478 doi: 10.3934/mbe.2022478
    [40] C. Jin, J. Huang, T. Wei, Y. Chen, Neural architecture search based on dual attention mechanism for image classification, Math. Biosci. Eng., 20 (2023), 2691–2715. https://doi.org/10.3934/mbe.2023126 doi: 10.3934/mbe.2023126
    [41] M. Chen, S. Yi, M. Yang, Z. Yang, X. Zhang, Unet segmentation network of COVID-19 CT images with multi-scale attention, Math. Biosci. Eng., 20 (2023), 16762–16785. https://doi.org/10.3934/mbe.2023747 doi: 10.3934/mbe.2023747
    [42] N. Liu, N. Zhang, K. Wan, L. Shao, J. Han, Visual saliency transformer, in Proceedings of the IEEE International Conference on Computer Vision, (2021), 4722–4732. https://doi.org/10.1109/ICCV48922.2021.00468
    [43] Z. Wang, P. Wang, Y. Han, X. Zhang, M. Sun, Q. Tian, Curiosity-driven salient object detection with fragment attention, IEEE Trans. Image Process., 31 (2022), 5989–6001. https://doi.org/10.1109/TIP.2022.3203605 doi: 10.1109/TIP.2022.3203605
    [44] C. Xie, C. Xia, M. Ma, Z. Zhao, X. Chen, J. Li, Pyramid grafting network for one-stage high resolution saliency detection, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2022), 11717–11726. https://doi.org/10.1109/CVPR52688.2022.01142
    [45] D. P. Fan, J. Zhang, G. Xu, M. M. Cheng, L. Shao, Salient objects in clutter, IEEE Trans. Pattern Anal. Mach. Intell., 45 (2022), 2344–2366. https://doi.org/10.1109/TPAMI.2022.3166451
    [46] M. M. Cheng, S. H. Gao, A. Borji, Y. Q. Tan, Z. Lin, M. Wang, A highly efficient model to study the semantics of salient object detection, IEEE Trans. Pattern Anal. Mach. Intell., 44 (2021), 8006–8021. https://doi.org/110.1109/TPAMI.2021.3107956
    [47] X. Tian, K. Xu, X. Yang, L. Du, B. Yin, R. W. Lau, Bi-directional object-context prioritization learning for saliency ranking, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2022), 5882–5891.
    [48] X. Tian, X. Yang, B. Yin, R. W. Lau, Weakly-supervised salient instance detection, preprint, arXiv: 2009.13898.
    [49] X. Tian, K. Xu, X. Yang, B. Yin, R. W. Lau, Learning to detect instance-level salient objects using complementary image labels, Int. J. Comput. Vision, 130 (2022), 729–746. https://doi.org/10.1007/s11263-021-01553-w doi: 10.1007/s11263-021-01553-w
    [50] Z. Liang, P. Wang, K. Xu, P. Zhang, R. W. Lau, Weakly-supervised salient object detection on light fields, IEEE Trans. Image Process., 31 (2022), 6295–6305. https://doi.org/10.1109/TIP.2022.3207605 doi: 10.1109/TIP.2022.3207605
    [51] X. Zheng, X. Tan, J. Zhou, L. Ma, R. W. H. Lau, Weakly-supervised saliency detection via salient object subitizing, IEEE Trans. Circuits Syst. Video Technol., 31 (2021), 4370–4380. https://doi.org/10.1109/TCSVT.2021.3049408 doi: 10.1109/TCSVT.2021.3049408
    [52] X. Liu, J. Guo, S. Zheng, Weakly-supervised salient object detection with label decoupling siamese network, in Proceedings of the 8th International Conference on Computing and Artificial Intelligence, (2022), 412–418. https://doi.org/10.1145/3532213.3532275
    [53] Y. Zeng, Y. Zhuge, H. Lu, L. Zhang, M. Qian, Y. Yu, Multi-source weak supervision for saliency detection, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2019), 6074–6083. https://doi.org/10.1109/CVPR.2019.00623
    [54] H. Zhang, Y. Zeng, H. Lu, L. Zhang, J. Li, J. Qi, Learning to detect salient object with multi-source weak supervision, IEEE Trans. Pattern Anal. Mach. Intell., 44 (2021), 3577–3589. https://doi.org/10.1109/TPAMI.2021.3059783 doi: 10.1109/TPAMI.2021.3059783
    [55] C. Rother, GrabCut: interactive foreground extraction using iterated graph cuts, ACM Trans. Graphics, 23 (2004), 309–314. https://doi.org/10.1145/1015706.1015720 doi: 10.1145/1015706.1015720
    [56] Y. Boykov, M. Jolly, Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images, in Proceedings of the IEEE International Conference on Computer Vision, (2001), 105–112. https://doi.org/10.1109/ICCV.2001.937505
    [57] J. J. Liu, Q. Hou, M. M. Cheng, J. Feng, J. Jiang, A simple pooling-based design for real-time salient object detection, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2019), 3917–3926. https://doi.org/10.1109/CVPR.2019.00404
    [58] K. Simonyan, A. Zisserman, Very deep convolutional networks for large-scale image recognition, preprint, arXiv: 1409.1556.
    [59] Y. Li, X. Hou, C. Koch, J. M. Rehg, A. L. Yuille, The secrets of salient object segmentation, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2014), 280–287. https://doi.org/10.1109/CVPR.2014.43
    [60] G. Li, Y. Yu, Visual saliency based on multiscale deep features, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2015), 5455–5463. https://doi.org/10.1109/CVPR.2015.7299184
    [61] Y. Liu, X. Y. Zhang, J. W. Bian, L. Zhang, M. M. Cheng, SAMNet: Stereoscopically attentive multi-scale network for lightweight salient object detection, IEEE Trans. Image Process., 30 (2021), 3804–3814. https://doi.org/10.1109/TIP.2021.3065239 doi: 10.1109/TIP.2021.3065239
    [62] X. Zhang, T. Wang, J. Qi, H. Lu, G. Wang, Progressive attention guided recurrent network for salient object detection, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2018), 714–722.
    [63] T. Zhao, X. Wu, Pyramid feature attention network for saliency detection, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2019), 3085–3094.
    [64] P. Zhang, D. Wang, H. Lu, H. Wang, B. Yin, Learning uncertain convolutional features for accurate saliency detection, in Proceedings of the IEEE International Conference on Computer Vision, (2017), 212–221.
  • This article has been cited by:

    1. Jianshun Lu, The Construction of a Network Alliance of Foreign Language Teacher Development Communities in the Age of Artificial Intelligence, 2024, 9, 2444-8656, 10.2478/amns-2024-3200
    2. Madhab Barman, Nachiketa Mishra, Network-driven stability analysis and optimal control for a weighted networked SAIR model in epidemiology, 2025, 13, 2195-268X, 10.1007/s40435-024-01556-8
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1937) PDF downloads(64) Cited by(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog