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

A single-cell mathematical model of SARS-CoV-2 induced pyroptosis and the effects of anti-inflammatory intervention

  • Both authors contributed equally to this work
  • Received: 02 December 2020 Accepted: 25 March 2021 Published: 01 April 2021
  • MSC : 92C50, 92C37, 34A99

  • Pyroptosis is an inflammatory mode of cell death that can contribute to the cytokine storm associated with severe cases of coronavirus disease 2019 (COVID-19). The formation of the NLRP3 inflammasome is central to pyroptosis, which may be induced by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). Inflammasome formation, and by extension pyroptosis, may be inhibited by certain anti-inflammatory drugs. In this study, we present a single-cell mathematical model that captures the formation of the NLRP3 inflammasome, pyroptotic cell death and responses to anti-inflammatory intervention that hinder the formation of the NLRP3 inflammasome. The model is formulated in terms of a system of ordinary differential equations (ODEs) that describe the dynamics of the key biological components involved in pyroptosis. Our results demonstrate that an anti-inflammatory drug can delay the formation of the NLRP3 inflammasome, and thus may alter the mode of cell death from inflammatory (pyroptosis) to non-inflammatory (e.g., apoptosis). The single-cell model is implemented within a SARS-CoV-2 tissue simulator, in collaboration with a multidisciplinary coalition investigating within host-dynamics of COVID-19. In this paper, we additionally provide an overview of the SARS-CoV-2 tissue simulator and highlight the effects of pyroptosis on a cellular level.

    Citation: Sara J Hamis, Fiona R Macfarlane. A single-cell mathematical model of SARS-CoV-2 induced pyroptosis and the effects of anti-inflammatory intervention[J]. AIMS Mathematics, 2021, 6(6): 6050-6086. doi: 10.3934/math.2021356

    Related Papers:

    [1] Quanjun Wu, Zhu Zhang, Ranran Li, Yufan Liu, Yuan Chai . Regulatory role of excitatory interneurons by combining electrical stimulation for absence seizures in the coupled thalamocortical model. Electronic Research Archive, 2024, 32(3): 1533-1550. doi: 10.3934/era.2024070
    [2] Bojian Chen, Wenbin Wu, Zhezhou Li, Tengfei Han, Zhuolei Chen, Weihao Zhang . Attention-guided cross-modal multiple feature aggregation network for RGB-D salient object detection. Electronic Research Archive, 2024, 32(1): 643-669. doi: 10.3934/era.2024031
    [3] Asma Maiza, Raouf Ziadi, Mohammed A. Saleh, Abdulgader Z. Almaymuni . An improved conjugate gradient algorithm by adapting a new line search technique. Electronic Research Archive, 2025, 33(4): 2148-2171. doi: 10.3934/era.2025094
    [4] Chao Ma, Hong Fu, Pengcheng Lu, Hongpeng Lu . Multi-objective crashworthiness design optimization of a rollover protective structure by an improved constraint-handling technique. Electronic Research Archive, 2023, 31(7): 4278-4302. doi: 10.3934/era.2023218
    [5] Liping Fan, Pengju Yang . Load forecasting of microgrid based on an adaptive cuckoo search optimization improved neural network. Electronic Research Archive, 2024, 32(11): 6364-6378. doi: 10.3934/era.2024296
    [6] Zhenyue Wang, Guowu Yuan, Hao Zhou, Yi Ma, Yutang Ma, Dong Chen . Improved YOLOv7 model for insulator defect detection. Electronic Research Archive, 2024, 32(4): 2880-2896. doi: 10.3934/era.2024131
    [7] Jinjiang Liu, Yuqin Li, Wentao Li, Zhenshuang Li, Yihua Lan . Multiscale lung nodule segmentation based on 3D coordinate attention and edge enhancement. Electronic Research Archive, 2024, 32(5): 3016-3037. doi: 10.3934/era.2024138
    [8] Rongrong Bi, Liang Guo, Botao Yang, Jinke Wang, Changfa Shi . 2.5D cascaded context-based network for liver and tumor segmentation from CT images. Electronic Research Archive, 2023, 31(8): 4324-4345. doi: 10.3934/era.2023221
    [9] Denghui Wu, Zhen-Hui Bu . Multidimensional stability of pyramidal traveling fronts in degenerate Fisher-KPP monostable and combustion equations. Electronic Research Archive, 2021, 29(6): 3721-3740. doi: 10.3934/era.2021058
    [10] Jinmeng Wu, HanYu Hong, YaoZong Zhang, YanBin Hao, Lei Ma, Lei Wang . Word-level dual channel with multi-head semantic attention interaction for community question answering. Electronic Research Archive, 2023, 31(10): 6012-6026. doi: 10.3934/era.2023306
  • Pyroptosis is an inflammatory mode of cell death that can contribute to the cytokine storm associated with severe cases of coronavirus disease 2019 (COVID-19). The formation of the NLRP3 inflammasome is central to pyroptosis, which may be induced by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). Inflammasome formation, and by extension pyroptosis, may be inhibited by certain anti-inflammatory drugs. In this study, we present a single-cell mathematical model that captures the formation of the NLRP3 inflammasome, pyroptotic cell death and responses to anti-inflammatory intervention that hinder the formation of the NLRP3 inflammasome. The model is formulated in terms of a system of ordinary differential equations (ODEs) that describe the dynamics of the key biological components involved in pyroptosis. Our results demonstrate that an anti-inflammatory drug can delay the formation of the NLRP3 inflammasome, and thus may alter the mode of cell death from inflammatory (pyroptosis) to non-inflammatory (e.g., apoptosis). The single-cell model is implemented within a SARS-CoV-2 tissue simulator, in collaboration with a multidisciplinary coalition investigating within host-dynamics of COVID-19. In this paper, we additionally provide an overview of the SARS-CoV-2 tissue simulator and highlight the effects of pyroptosis on a cellular level.



    The topic of stereo matching has witnessed an upsurge in popularity in the field of computer vision, and has been widely applied in 3D reconstruction [1], 3D object detection [2], autonomous driving [3], and so on. The process of stereo matching includes obtaining disparity information from the left and right images taken by the binocular stereo camera and then deducing depth information, etc. Currently, there are a number of stereo matching algorithms. According to the differences in constraint range, these algorithms can be divided into two categories: local stereo matching algorithms and global stereo matching algorithms. Local stereo matching algorithms estimate the disparity based on the local information in the pixel window and compute the local optimal solutions to the disparity. They are characterized by good real-time performance. The commonly used local stereo matching algorithms include Variable Support Window (VSW), Adaptive Support Weight (ASW), and multi-window algorithm [4]. Different from the local stereo matching, global stereo matching algorithms compute the disparity value by finding the minimum value of the constructed global energy function with a high degree of matching accuracy but are computationally complex. Common global stereo matching algorithms encompass belief propagation (BP) [5,6], dynamic programming (DP) [7], and graph cut (GC) algorithms [8]. Scharstein and Szeliski [9] summarized the previous stereo matching algorithms and proposed that their process be divided into four steps: matching cost computation, cost aggregation, disparity computation, and disparity refinement. Among them, cost computation and cost aggregation contribute to the accuracy of matching.

    The matching cost is to measure the correlation between the pixels to be matched and the candidate pixels. Kok and Rajendran [10] made detailed comments on frequently-used measures: sum of squares difference (SSD), sum of absolute difference (SAD), normalized cross-correlation (NCC), and rank transform (RT). By means of these methods, we can presume that each left-image pixel and its corresponding right-image pixel have the same intensity values. Therefore, they cannot be utilized for outdoor images with remarkable differences in lighting intensity. Hirschmuller [11] used the probability distribution function as a matching measure to compute the matching cost. But the disadvantages are obvious due to the complex principle, the computing inefficiency, and the poor anti-interference performance. Stein [12] showed that using census transform (CT) to compute the matching cost can effectively improve the anti-interference performance in the cost volume, but the matching effect in the weak texture region is not satisfactory. Mei et al. [13] proposed a method combining the SAD and CT. This method overcomes the poor matching effect of the CT in the weak texture regions because it combines the advantages of the SAD and the CT and guarantees high matching accuracy.

    The fundamental purpose of cost aggregation is to ensure the cost value to accurately reflect the correlation between pixels. The aggregation cost of local stereo matching is deeply affected by the aggregation window. The large window easily leads to error matching in the regions with discontinuous depth, while the small one results in error matching in the weak texture regions. To solve those problems, Zhang et al. [14] proposed forming a local cross adaptive window for cost aggregation through double thresholds of color and distance, which is less effective in matching in weak texture regions but is less time-consuming. Although the window of the filter window proposed by Hosni et al. [15] is fixed, its advantage is that the computational complexity is independent of the window size. By analyzing those cost aggregation methods, it can be found that they only perform cost aggregation on a single scale layer, without considering that the feature information of the obtained object is a coarse-to-fine process, which results in a higher error matching rate in the weak texture region as a whole. Therefore, Zhang et al. [16] simulated the human visual system and proposed to build a cross-scale cost aggregation (CSCA) framework to incorporate the cost volume of multiple scales to obtain the target cost volume. Although this framework contributes to a good disparity map, the demerits of the high error matching rate in weak texture regions and the time-consuming process still remain. Later, Pang et al. [17] proposed an adaptive multi-scale cost body construction and aggregation stereo matching algorithm, which has strong adaptability to different texture regions and good robustness, but the matching accuracy of this algorithm in the parallax discontinuity region needs to be improved.

    Although research on stereo matching algorithms have made great progress in recent years [18,19,20,21], matching at the correct disparity is challenging in real life due to the photometric and geometric distortions introduced by the change of viewpoint and by ambiguities caused by low texture or repetitive patterns in the scene. To solve the above problems, a novel algorithm, iFCTACP, which multiple matching cost measurement methods and an adaptive cross pyramid structure is proposed. The algorithm first implements the fusion of truncated color absolute difference, truncated gradient absolute difference, and the iFCT (an improved four-moded census transform proposed in this paper). Second, in ACP (an adaptive cross pyramid structure proposed in this paper), gradient information is used to distinguish between weak texture regions and rich texture regions, and a new adaptive window is constructed by using a variable color threshold according to the region of pixels.

    In summary, the contributions of this paper are threefold:

    1) A novel cost metric, iFCT, is presented, which is robust to noise such as illumination and exposure. It can not only improve the matching accuracy but also effectively solve the problem of center pixel distortion. It is a supplement and amendment to the traditional cost metric methods.

    2) A multi-layer adaptive cross pyramid (ACP) structure is proposed for cost aggregation. The ACP can realize the cross-regional connection and information transmission, significantly reducing the possibility of mismatch due to lack of corresponding matching information. This is an improvement on the shortcomings of traditional cross, especially in weak texture regions.

    3) Qualitative and quantitative experiments demonstrate the effectiveness of the algorithm, iFCTACP. The optimal parameters are also explored for different situations.

    The input of the proposed algorithm is an epipolar corrected image. The process consists of four steps: 1) Downsample the input image to obtain multi-scale image, and compute the cost of each scale image by the absolute difference of intensity (AD), iFCT, and gradient fusion, to generate the pyramid initial cost volume. 2) Carry out adaptive cross cost aggregation based on the initial pyramid cost volume. Then, apply the regularization term to optimize the consistency problem of adjacent scales of the pyramid. 3) Conduct scanning linear optimization to further improve the accuracy of the cost aggregation and reduce the matching errors. Then, the initial disparity value of each pixel point is computed using winner-takes-all (WTA) strategy. 4) Optimize the unreliable disparity by disparity refinement (left-right consistency check, disparity filling, weighted median filtering). Finally, output the disparity map.

    The overall process of the iFCTACP algorithm is shown in Figure 1.

    Figure 1.  Overall process of the iFCTACP algorithm.

    The purpose of matching cost computation is to measure the correlation between the pixel in the left image and the pixel to be matched in the right image under different disparities. The CT matching cost has been widely used due to its robustness to weak texture regions. It constructs the description code of the center pixel point by comparing the gray value of the center pixel and its neighborhood. The Hamming distance between the codes is used as the matching cost, as defined in Eq (2.1).

    {ξ(p,q)={1,Ip<Iq0,elseB(p)=qNpξ(p,q)Ccen(p,d)=Hamming[BL(p),BR(pd)], (2.1)

    where p is a pixel in the left image whose coordinates are (x,y); q is a pixel in the neighborhood of p, and Ip and Iq are the gray values of p and q; pd represents the corresponding pixel of p with disparity d in the right image, and the coordinates are (xd,y); Np is the neighborhood of p; indicates bitwise connection; B(p) represents the census code of p; Ccen(p,d) denotes the Hamming distance between the codes of pixels, p and pd.

    The definition above reflects that CT transform is highly dependent on the gray value of the central pixel and cannot completely describe the information within the rectangular transform window. In real life, it is inevitable that the image captured by camera will be affected by noise, which will definitely affect the accuracy of the final matching result. To address this problem, Ma et al. [22] proposed the MCT, which replaces the central pixel value with the mean value of the pixels in the window. To a certain extent, the noise robustness of CT is improved. Nevertheless, the mean value is susceptible to the maximum and minimum value of pixels in the window. MRCT, presented by Lai et al. [23], replaces the original gray value of the neighborhood pixel whose relative distance is greater than one unit from the central pixel with the values interpolation of the four pixels surrounding the neighborhood pixel. Although the error matching of MRCT is reduced to some degree, the anti-interference ability is still poor. Lee et al. [24] proposed the SCT, which compares the luminance of pixels at a certain distance along the symmetric pattern within the matching window. The anti-interference ability has been improved, but the algorithm is more complex.

    In this paper, we propose iFCT as shown in Algorithm 1 with pseudo-code. It not only improves the matching accuracy, but also effectively solves the central pixel distortion problem. These two improvements benefit from taking the mean pixel value ˉI(px,py) (Algorithm 1, Lines 512) within the m×n window of the center pixel p as another constraint, and using the intensity of the matched pixels within the window to compare with the center pixel value I(px,py) and the average value of its neighborhood ˉI(px,py) (Algorithm 1, Lines 1328), as shown in Figure 2. In this way, a new census transform is built. We assign the value of ˉI(px,py) as:

    ˉI(px,py)=m2i=m2n2j=n2I(px+i,py+j)m×n, (2.2)

    where I(px,py) is the center pixel of the window, and I(px+i,py+j) is the intensity of each pixel in the window. The I(px+i,py+j) is compared with I(px,py) and ˉI(px,py). The new census transform is expressed as:

    T(px,py)=imjnξ(I(px,py),I(px+i,py+j),ˉI(px,py)), (2.3)

    where the operator is a bit concatenation operation, and the auxiliary function ξ, which has four modes, is defined as:

    ξ(a,b,c)={01,ifa<b<c;10,ifa>b>c;00,ifbmin(a,c);11,ifbmax(a,c). (2.4)

    Algorithm 1: Pseudocode for iFCT method
      Data: The initial image I;
      Result: Bit string, census(x, y);
    1 for y=M to I.heightM do

    30 end

    Figure 2.  Diagram of IFCT window.

    We call the improved four-mode census transform as iFCT.

    Figure 3 shows the calculation process of iFCT and CT with a neighborhood window of 5×5, where m, n is taken as 3. When the center pixel is affected by noise and changed from 72 to 120, the conventional CT transform code changes significantly, while the iFCT transform code remains unchanged thereby, the anti-interference performance is improved.

    Figure 3.  The calculation process of iFCT and CT.

    In spite of the simplicity and speed of the cost computation of AD, its sensitivity to noise and many error matchings in the obtained disparity map are the lingering problems. In contrast, gradient and CT have better robustness to noise. To improve the matching accuracy and the robustness under noisy conditions, this paper integrates iFCT with the method proposed by Hosni et al. [25], which can be expressed as the following equation:

    C(i,d)=(1α)min(||I(i)I(id)||,τAD)+αmin(||xI(i)xI(id)||,τGrad), (2.5)

    where i is the pixel in left image, id is the matching pixel of i in right image, d is the disparity between i and id; I(i) and I(id) denote the color vectors of i and id; τAD denotes the color intensity truncation value, τGrad is the gradient truncation value; α denotes the balance factor between intensity and gradient; and C(i,d) is the matching cost volume formed by the combination of the absolute differences of truncated color and truncated gradient. Inspired by the idea of normalized fusion [13], this paper uses a variant fusion equation integrates C(i,d) to compute the initial matching cost value, as follows:

    C(i,d)=(1eCcenλcen)+(1eCλ), (2.6)

    where λcen and λ are the weights composed of different costs, which can be adjusted to get better matching effect, and C(i,d) is the final matching cost volume.

    Figure 4 shows two final disparity maps with the Middlebury teddy data set [26]. One is the results of the cost computation combined with the absolute differences of truncated color and truncated gradient proposed by Hosni et al. [25]. The other is the result of the cost computation fused with iFCT. In order to make the results more convincing, we do not do any other post-processing. The comparisons show that the latter produces better disparity maps than those of the former in the repeating texture regions (marked with red circle) and weak texture regions (marked with yellow ellipse).

    Figure 4.  Teddys initial disparity map based on different matching costs. (a) Original left image. (b) Ground truth disparity map. (c) The result combined with the absolute differences of truncated color and truncated gradient. (d) The result fused with iFCT.

    Currently, most matching cost aggregation methods process the original resolution of the image directly. They can obtain high-quality disparity values in rich texture regions, but in weak texture regions they are prone to mismatch. In order to combine multi-scale information and make full use of coarse-scale information, Zhang et al. [16] proposed a cross-scale model to aggregate the multi-scale matching cost by downsampling to obtain multi-scale information. This model added a generalized L2 regularization term to the optimization goal to make the matching cost consistent on adjacent scales.

    One of the essential difficulties in building crossed-based support windows is how to define appropriate rules to include pixels with similar disparity values in the same window. Zhang et al. [14] constructed cross-based support windows by using color similarity and a constant color similarity threshold. However, it cannot handle both discontinuous depth regions and weak texture regions simultaneously. To tackle this problem, Mei et al. [13] analyzed the shortcomings of the cost aggregation method of the cross window proposed by Zhang et al. [16] and improved the matching accuracy in the disparity discontinuous region by setting stricter constraints to determine the arm length of the cross window. However, its fixed threshold setting has a deep impact on the matching accuracy. These methods do not adjust the color and spatial thresholds depending on the type of area where the pixel is located, resulting in an over-extended window arm and more false disparity information in weak texture areas and edge areas.

    Therefore, we present a multi-layer adaptive cross pyramid (ACP) structure for cost aggregation. The proposed cost aggregation method is summarized in Algorithm 2. The arm length of the cross window is determined by gradient information and variable color threshold, and its structure is shown in Figure 5. At first, the gradient threshold is set to classify whether the pixel belongs to the weak texture region or the edge region. For weak texture regions, larger color and distance thresholds are set to obtain more correct disparity information. For the edge regions, the color and distance thresholds are reduced to prevent obtaining too much incorrect disparity information. The improved window arm length constraint for the weak texture regions can be formulated as:

    {G(p)<βDs(pl,p)<L1Dc(pl,p)<τ1,Dc(pl,pl+(1,0))<τ1Dc(pl,p)<τ2,ifL2<Ds(pl,p)<L1, (2.7)

    where, β is the gradient threshold to determine whether the pixel belongs to the weak texture region or the edge region; Ds(pl,p) is the spatial distance between pixel pl and pixel p; Dc(pl,p) is the RGB color difference between pixel pl and pixel p; τ1 and τ2 are color thresholds and τ2<τ1; L1 and L2 are distance thresholds and L2<L1; and τ2 is a variable color threshold. When L2<Ds(pl,p)<L1, the τ2 is strictly limited to prevent including more pixels with different depths. It changes nonlinearly with the current color and arm length. The longer the arm length is, the more strictly the color threshold τ2 is set. It is defined as follows:

    τ2=e((L1Ds(pl,p))λL)τ2+τ2, (2.8)

    where λL is the adjustment parameter that regulates the effect of Ds(pl,p) on the final τ2. For the edge and discontinuous regions, it is necessary to set stricter color and distance thresholds to avoid excessive extension of the arm length which leads to an increase in the error matching rate in the edge region. The window arm length constraints are updated as:

    {G(p)>βDs(pl,p)<λ1L1Dc(pl,p)<τ1,Dc(pl,pl+(1,0))<τ1Dc(pl,p)<λ3τ2,ifλ2L2<Ds(pl,p)<λ1L1, (2.9)

    where the coefficients λ1, λ2, and λ3 are the reduction factors of L1, L2, and τ2, respectively. With the constrains mentioned above, the length of the left, right, upper, and lower arms {hp,h+p,v+p,vp} can be determined by linear extension from center pixel p, pixel by pixel. Therefore, a cross composed of horizontal line segment H(p) and vertical line segment V(p) is constructed as the local window of cost aggregation. To speed up aggregation, we further use an orthogonal integral image (OII) technique [14] for fast cost aggregation over any arbitrarily shaped windows in constant time. First, we build a horizontal integral image SH(x,y) to store the cumulative row sum as:

    SH(x,y)=SH(x1,y)+C(x,y). (2.10)

    Algorithm 2: Pseudocode for ACP method
      Data: The initial image Is, different scales of initial cost volume Cs, s{0,1,...,S}.
      Result: Final cost volume Cs.
    1: for s=0 to S do

    15 end

    Figure 5.  The cross-based support window region at each pixel. V(p) and H(p) are the vertical and horizontal segments of each pixel, respectively.

    The SH(x,y) can be calculated from SH(x1,y) with only one addition. When x=0,SH(1,y)=0, we calculate the horizontal integral EH(x,y), using the horizontal integral image SH(x,y) as follows:

    EH(x,y)=SH(x+h+p,y)SH(xhp1,y). (2.11)

    Taking the calculated horizontal matching cost EH(x,y) as the input, we create a vertical integral image SV(x,y). It stores the cumulative column sum as:

    SV(x,y)=SV(x,y1)+EH(x,y). (2.12)

    Also, only one addition is needed to calculate SV(x,y). When y=0,SH(x,1)=0, the fully aggregated matching cost C(x,y) can be derived from the following equation:

    C(x,y)=SV(x,y+v+p)SV(x,yvp1). (2.13)

    Then, the error matching rate is further decreased by scan-line optimization in four directions.

    Figure 6 shows an example of the support window generated by the improved cost aggregation. It can be found that our support window includes fewer invalid pixels in the discontinuous depth region, which reduces the error matching rate.

    Figure 6.  Examples of support windows on the Monopoly image. (a) Adaptive window based on the cross proposed by Mei et al. [13]. (b) Improved cross adaptive window.

    After cost aggregation, the cost volume is rectified. It is followed by disparity computation. The initial disparity of a pixel is computed by WTA strategy whose implementation is as follows: The corresponding disparity of the smallest cost value within the maximum disparity Lmax search range is taken as the initial disparity value. The process can be expressed as follows:

    dini(p)=argmindD[S(p,d)], (2.14)

    where D is the disparity searching range, dini(p) is the initial disparity of pixel p, and S(p,d) is the matching cost after the cost aggregation. Generally, the minimum cost is selected to represent the optimal matching relationship. During disparity refinement, the outliers are picked up by left-right consistency detection. If the difference of disparity value between the pixel whose disparity is in the left image and the corresponding matching pixel whose disparity is in the right image satisfies the constraint:

    |d1d2|>Th, (2.15)

    where Th is a default disparity threshold, generally set to 1, then p(x,y) is treated as an anomaly point for subsequent processing or will be retained. To correct the anomaly point p, two non-anomaly points, pl and pr, are picked up on the left and right directions of point p, respectively. The minimum disparity value between pl and pr is selected as the corrected disparity value of p, which can be expressed by the following equation:

    d(p)=min(d(pl),d(pr)). (2.16)

    As there may be random noise and discontinuous error matching pixel in the disparity map, the median filter is used to smooth the disparity map, and consequently a high-quality disparity map is obtained.

    The experimental environment: C++ Compiler with OpenCV3.4 library, Windows 10 × 86 operating system, Intel(R) Core(TM) i5-7200U CPU and 4 GB RAM, and Middlebury stereo datasets [26] were used to evaluate the proposed iFCTACP. In the following experiments, the best results among the compared algorithms are marked in bold. In this paper, the percentage of bad pixels in the estimated stereo pair difference is used as the evaluation criterion. The disparity error threshold is set to 1.0 pixel. The error matching rate is calculated for non-occluded regions by dividing the sum of all the mismatch points by the sum of the overall effective disparity points. The parameters used in the experiments are shown in Table 1.

    Table 1.  Parameters used in the experiments.
    Parameters α τAD τGrad λcen λ L1 L2
    Values 0.1 7 2 25 700 34 7
    Parameters τ1 τ2 β λ1 λ2 λ3 λL
    Values 20 6 0.6 0.15 0.25 0.5 3

     | Show Table
    DownLoad: CSV

    We use six sets of images with ground truth provided by the Middlebury dataset [26] (Art, Dolls, Flowerpots, Moebius, Reindeer, and Cloth1) and set three illuminations (0, 1, 2) and three exposures (0, 1, 2). For simplicity, we only take the Art set as an example hereafter. Figure 7 shows the left images of Art under three different illuminations (the exposure is the same) and the left images of Art under three different exposures (the illumination is the same). In order to verify the effectiveness and noise robustness of iFCT, the iFCT and the other four transforms, CT, MCT, SCT, and MRCT, are respectively fused to the cost calculation method, which is composed of the truncated color absolute difference and the truncated gradient absolute difference for the comparative experiment. To verify the superiority of iFCT, all disparity maps are produced with the same cost aggregation method.

    Figure 7.  First row: left images of three different illuminations (under the same exposure 0). (a) Illumination 0. (b) Illumination 1. (c) Illumination 2. Second row: left images of three different exposures (under the same illumination 0). (d) Exposure 0. (e) Exposure 1. (f) Exposure 2.

    Figures 8 to 11 show the disparity map in four kinds of conditions: different illumination, different exposure, 5% salt-and-pepper noise, and Gaussian noise with σ=5, respectively. In these figures, (a)–(c) show the left image of Art, the right image of Art, and the ground truth disparity map, respectively; (d)–(h) show the disparity map obtained by the cost computation method, which uses the truncated color absolute difference and the truncated absolute gradient difference to fuse five different census transform of iFCT, CT, MCT, SCT, and MRCT, respectively. In Figure 8, the left and right image are taken under illumination 2 and illumination 1, respectively, both under exposure 0. In Figure 9, the left image is taken under the condition of exposure 1, the right image is taken under the condition of exposure 2, and both images are taken under illumination 0. In Figure 10, 5% salt-and-pepper noise is added to the left and right images. In Figure 11, Gaussian noise with σ=5 is added to the left and right images. Qualitatively, comparing Figure 8(d) with Figure 8(e)–(h), shows that the fused iFCT is more robust to image illumination changes. Also, comparing Figure 9(d) with Figure 9(e)(h), the disparity map of Figure 9(d) show fewer artifacts than those of Figure 9(e)(h). Comparing Figure 10(d) with Figure 10(e)(h), it is found that Figure 10(e), which is added 5% salt-and-pepper noise, performs better than Figure 10(d), which is obtained by fusing iFCT. The disparity maps obtained by fusing the above five different census transforms under the condition of Gaussian noise with the σ=5 are shown in Figure 11, and showing the effect of the disparity map in Figure 11(f) outperforms the others.

    Figure 8.  Disparity map of Art under different illumination conditions. (a) Left image under illumination 2. (b) Right image under illumination 1. (c) Ground truth disparity map. (d) iFCT. (e) CT. (f) MCT. (g) SCT. (h) MRCT.
    Figure 9.  Disparity map of Art under different exposure conditions. (a) Left image under exposure 1. (b) Right image under exposure 2. (c) Ground truth disparity map. (d) iFCT. (e) CT. (f) MCT. (g) SCT. (h) MRCT.
    Figure 10.  Disparity map of Art under 5% salt-and-pepper noise. (a) Left image under 5% salt-and-pepper noise. (b) Right image under 5% salt-and-pepper noise. (c) Ground truth disparity map. (d) iFCT. (e) CT. (f) MCT. (g) SCT. (h) MRCT.
    Figure 11.  Disparity map of Art under the condition of Gaussian noise with σ=5. (a) Left image with Gaussian noise (σ=5). (b) Right image with Gaussian noise (σ=5). (c) Ground truth disparity map. (d) iFCT. (e) CT. (f) MCT. (g) SCT. (h) MRCT.

    Under the four conditions above, the truncated color absolute difference and truncated gradient absolute difference fuse those five different census transforms mentioned above. The error matching rates of the disparity maps are shown in Tables 2 to 5. For comparison, the disparity map without any noise is also measured in this paper, and the results are shown in Table 6. In Tables 2 and 3, among six pairs of stereo images, those fused with iFCT have the lowest error matching rate and the lowest average error matching rate, which indicates that the iFCT is more robust to illumination change and exposure change than the other four census transforms. Table 4 shows, under the condition of 5% salt-and-pepper noise, that the average error matching rate of the fused CT is the lowest and that of the fused iFCT is at the middle level. In Table 5, the fused iFCT has the lowest error matching rate in 3 pairs of stereo images: Art, Reindeer, and Cloth1. The average error matching rate is only 0.1% than the optimal MCT, indicating that the fused iFCT is more robust to Gaussian noise. In Table 6, the fused iFCT achieves the best average error matching rate, which indicates that the iFCT is effective for noise-free matching. From the above analysis, we can see that iFCT exhibits excellent performance under illumination changes, exposure changes, and free noise. It also has good noise immunity to salt-and-pepper noise and Gaussian noise. In order to test the real-time performance of the algorithm, we test the execution time of it. The measured time is the average of 20 separate runs and the results are shown in Figure 12.

    Table 2.  Error matching rate of various cost computations under different illumination conditions.
    Algorithms Art Dolls Flowerpots Moebius Reindeer Cloth1 Avg
    iFCT 10.12 7.55 5.36 8.56 10.09 0.36 7.00
    CT 10.53 9.21 5.60 8.92 10.59 0.37 7.54
    MCT 12.34 9.84 5.99 9.28 10.86 0.42 8.12
    SCT 14.13 11.60 6.94 10.68 15.80 0.54 9.95
    MRCT 44.4 39.46 8.66 33.08 60.21 14.31 33.36

     | Show Table
    DownLoad: CSV
    Table 3.  Error matching rate of various cost computations under different exposure conditions.
    Algorithms Art Dolls Flowerpots Moebius Reindeer Cloth1 Avg
    iFCT 14.35 7.25 14.85 9.94 10.77 0.63 9.63
    CT 14.99 7.72 15.20 10.99 10.74 0.68 10.05
    MCT 16.69 8.88 16.78 12.26 12.80 0.79 11.37
    SCT 18.52 13.29 22.45 13.45 13.50 1.26 13.75
    MRCT 60.45 61.64 59.90 49.78 62.04 22.12 52.66

     | Show Table
    DownLoad: CSV
    Table 4.  Error matching rate of various cost computations under the condition of 5% salt-and-pepper noise.
    Algorithms Art Dolls Flowerpots Moebius Reindeer Cloth1 Avg
    iFCT 7.67 3.72 7.21 7.42 3.68 0.41 5.01
    CT 6.74 3.14 6.51 7.21 3.38 0.41 4.57
    MCT 6.77 4.98 11.81 10.47 6.63 0.34 6.83
    SCT 6.77 3.06 8.17 7.43 3.28 0.36 4.85
    MRCT 7.77 3.48 9.37 8.90 3.93 1.00 5.74

     | Show Table
    DownLoad: CSV
    Table 5.  Error matching rate of various cost computations under Gaussian noise with σ=5.
    Algorithms Art Dolls Flowerpots Moebius Reindeer Cloth1 Avg
    iFCT 17.90 12.34 33.54 16.84 24.35 0.47 17.57
    CT 19.83 13.12 33.61 17.30 25.40 0.53 18.30
    MCT 18.55 11.90 32.81 16.53 24.68 0.48 17.49
    SCT 22.30 14.86 35.82 19.10 29.78 0.78 20.44
    MRCT 35.06 23.87 48.78 30.23 45.88 5.95 31.63

     | Show Table
    DownLoad: CSV
    Table 6.  Error matching rate of various cost computations under no-noise condition.
    Algorithms Art Dolls Flowerpots Moebius Reindeer Cloth1 Avg
    iFCT 5.81 2.88 5.36 5.60 3.34 0.24 3.87
    CT 6.07 2.69 5.60 5.89 3.12 0.23 3.93
    MCT 7.59 3.35 5.99 6.74 4.17 0.24 4.68
    SCT 6.06 2.69 6.94 6.39 3.11 0.26 4.24
    MRCT 6.80 2.96 8.66 8.90 3.55 0.63 5.25

     | Show Table
    DownLoad: CSV
    Figure 12.  Running time of our algorithm on different images (in seconds).

    To verify the matching accuracy in weak texture regions, six groups of typical weak texture images, Lampshade1, Lampshade2, Midd1, Midd2, Monopoly, and Plastic, are selected from Middlebury for comparing the cost aggregation method based on ACP with four classical methods, AD-Census [13], GF [25], PPEP-GF [27], and Z2ZNCC [28]. All of them use the same cost computation method, iFCT, which was shown to be more robust than other combined cost computation methods in Section 3.1. The stereo matching results of six pairs of weak texture stereo images are shown in Figure 13, and the error matching points are marked in red. Comparing the disparity map of ACP in Figure 13(c) with those of the four classical methods (AD-Census, GF, PPEP-GF, Z2ZNCC) in Figure 13(d)(g), it can be concluded that the ACP method is smoother in weak texture regions, the edges are better maintained, the obtained disparity maps are generally of high quality, and the error matching rate is much lower than that of the other classical methods.

    Figure 13.  The comparisons of cost aggregation method based on ACP with four classical methods using Middlebury dataset. From top to bottom: Lampshade1, Lampshade2, Middle1, Middle2, Monopoly, Plastic. (a) Left image. (b) Ground truth disparity map. (c) Results of the ACP cost aggregation. (d) Results of ad-census cost aggregation. (e) Results of GF cost aggregation. (f) Results of PPEP-GF cost aggregation. (g) Results of Z2ZNCC cost aggregation.

    The matching results and percentage of bad pixels are shown in Table 7. ACP cost aggregation method is applied to six pairs of weak texture stereo images, of which five pairs (Lampshade1, Lampshade2, Midd2, Monopoly, Plastic) show more remarkable results than the four classical cost aggregation methods. In addition, except for the stereo matching images, Plastic and Midd2, the mismatching rates of the other three pairs are less than 4%. Compared with AD-Census, GF, PPEP-GF, and Z2ZNCC, the aggregation error of ACP is reduced by 5.58%, 7.64%, 2.49%, and 6.68%, respectively. From the visual comparison of the original disparity map in Figure 13(b), it can be found that AD-Census performs worse than ACP and Z2ZNCC in the weak texture regions, because AD-Census adopts the same matching cost aggregation method in both the weak texture regions and the edge areas with rich textures and fails to utilize the regional characteristics of pixels in the image. GF and PPEP-GF have high mismatching rate in the weak texture region, because the linear coefficient of the guide filter is affected by the selected regularization parameters, the cost aggregation effect is not ideal, and the accuracy of the final disparity map is affected. On the whole, the cost aggregation method of ACP obviously outperforms the four classical cost aggregation methods in weak texture regions and obtains disparity maps with a more correct area. The ACP achieves the lowest average error matching rate. At the same time, the running time of the above five cost aggregation methods is measured, as shown in Figure 14. To achieve a fair comparison, all of the algorithms are run on the same testing platform, and no parallelism technique is used. Seen from Figure 14, it takes both the AD-Census and ACP methods approximately 4 seconds. The GF method takes a little longer, while the PPEP-GF and Z2ZNCC methods take a little less time.

    Table 7.  Error matching rate of low texture image.
    Algorithms Lampshade1 Lampshade2 Midd1 Midd2 Monopoly Plastic Avg
    ACP 2.41 3.12 14.34 10.53 3.95 14.58 8.12
    AD-census 10.34 10.69 11.82 12.35 5.44 32.07 13.79
    GF 4.66 9.89 26.54 19.28 12.01 22.16 15.76
    PPEP-GF 2.58 6.24 18.79 13.09 6.85 16.13 10.61
    Z2ZNCC 3.12 9.56 24.12 17.75 11.44 22.80 14.8

     | Show Table
    DownLoad: CSV
    Figure 14.  Running time of our algorithm on different images (in seconds).

    To objectively evaluate the overall performance of the iFCTACP, the experiments were carried out on 25 pairs of stereo images from the Middlebury dataset. It was not only compared with the AD-census algorithm [19] but also with other recently proposed methods: the AEGF [29], OLT [30], and DDL algorithms [31]. The quantitative evaluation results are shown in Table 8. Compared with the ther four algorithms, the IFCTACP algorithm has the lower average error rate and better effect on most stereo images. As shown in the paper, 17 out of 25 pairs of stereo images have the lowest error matching rate. Compared with AD-Census algorithm, AEGF algorithm, OLT algorithm and DDL algorithm, the average matching error of ACP algorithm in this paper is reduced by 4.97%, 2.25%, 2.09%, and 1.34%, respectively, showing more stable performance in processing different scenarios. This is due to the fact that DDL learns a discriminant dictionary for stereo matching and has non-local aggregation capability, which can cope well with low-texture regions, but is less effective for high-texture regions. AEGF and OLT do not perform as well as IFCTACP in low-texture areas because their cascaded filters only use fixed-size windows and have no spatial adaptability. The AD-Census algorithm is not ideal when determining the support domain, and the matching accuracy is not high in the weak texture region. In contrast, the parallax map obtained by iFCTACP not only contains less noise, but also has better performance in the weak texture region and high texture region.

    Table 8.  Error matching rate of different algorithms on Middlebury standard stereo image pairs.
    Datasets AD-census AEGF OLT DDL iFCTACP
    Cones 8.61 2.01 3.42 4.27 2.96
    Teddy 6.48 5.21 7.69 6.59 7.45
    Tsukuba 8.04 1.32 2.06 2.63 3.92
    Venus 2.92 0.26 0.54 0.69 1.34
    Aloe 5.18 5.25 2.91 5.28 2.83
    Art 11.58 7.58 6.91 9.47 5.81
    Baby1 5.56 3.18 4.03 2.78 1.79
    Baby2 8.27 4.15 4.86 2.84 1.89
    Baby3 4.21 4.34 4.89 3.19 2.24
    Books 11.05 8.05 8.07 8.16 6.87
    Bowling1 18.77 13.33 14.52 4.38 3.12
    Bowling2 13.27 7.13 6.11 4.43 2.69
    Cloth1 0.20 0.49 0.11 0.25 0.24
    Cloth2 4.15 2.88 1.30 2.14 1.17
    Cloth3 1.68 1.31 0.93 1.80 0.93
    Cloth4 1.32 1.54 0.74 1.21 0.77
    Dolls 5.61 5.36 3.79 5.58 2.88
    Flowerpots 17.26 5.36 11.35 6.80 5.36
    Lampshade1 12.27 11.43 8.27 5.66 2.41
    Lampshade2 15.23 16.98 12.20 4.08 3.12
    Laundry 14.71 14.32 11.98 12.00 11.92
    Moebius 9.97 8.71 8.25 9.60 5.60
    Reindeer 16.70 3.57 4.11 5.40 3.34
    Rocks1 2.54 3.25 1.27 4.14 1.40
    Rocks2 2.04 2.44 1.02 3.26 1.08
    Average error 8.30 5.58 5.42 4.67 3.33

     | Show Table
    DownLoad: CSV

    If the accuracy of the initial disparity image is higher, the accuracy of the final disparity image will also be higher. In order to improve the accuracy of the initial disparity image, it is very important to select appropriate parameters for local stereo matching. Therefore, we will discuss the influence of the selection of different parameters on stereo matching. The average percentage of bad pixels under different parameters is used as the evaluation criteria.

    The factors affecting cost computation are α, τAD, τGrad, λcen, and λ. Among them, α plays an important role in adjusting the proportion of color intensity and gradient cost in the combined cost function; the color intensity threshold τAD and gradient threshold τGrad can effectively suppress some noise interference; and λcen and λ control the proportion of iFCT cost and the combination cost of truncated color absolute difference and truncated gradient absolute difference in the fusion cost, respectively. In this paper, seven sets of images are selected as test images and the parameters are adjusted separately, while other parameters are kept constant. The quantitative relationships between α, τAD, τGrad, λcen, λ and the error matching rate are given in Figure 15(a)(e) in detail. From Figure 15(a) to Figure 15(d), it can be concluded that the error matching rate of the disparity image increases when the parameter α increases, especially for the weak texture images, Plastic and Monopoly, which increases sharply. When τGrad2, most error matching rates of the images do not vary obviously, except for Plastic, whose error matching rate is still increasing. The error matching rates change little when λcen ranges from 20 to 40; the weak texture images, Plastic and Monopoly, are highly sensitive to the parameter λ, whose error matching rate decreases sharply when λ increases. However, the other rich textured images are insensitive to λ. From the experiments, we conclude that the overall performance is relatively better when α = 0.1, τAD = 7, τGrad = 2, λcen = 25, and λ = 700.

    Figure 15.  Experimental results of different parameter settings with Middlebury images. (a) α: Adjusting the proportion of color intensity and gradient cost in the combined cost function. (b) τAD: Color intensity threshold. (c) τGrad: Gradient cost threshold. (d) λcen: Improved census regularization parameters. (e) λ: Regularization parameters of combined cost function. (f) Arm length threshold L1. (g) Arm length threshold L2. (h) Color similarity threshold τ1. (i) Color similarity threshold τ2. (j) β: Gradient threshold. (k) λ1: Scale factor of arm length threshold L1. (l) λ1: Scale factor of arm length threshold L1. (m) λ1: Scale factor of color similarity threshold τ2. (n) λL: Regularization parameters defined by color threshold.

    During the construction of the cross-based supporting window, the arm length threshold L1 and color similarity threshold τ1 are used to retain more useful pixels in weak texture regions, which makes the result more accurate and robust. As shown in Figure 15(f), (h), the error matching rate tends to be stable when L134, while τ1 has little effect on it for most images. To avoid introducing more noise in the discontinuous disparity region when setting L1 and τ1, a stricter color similarity threshold τ2 is set when the arm length exceeds the threshold L2. In Figure 15(g), the parameter L2 has little effect on the error matching rate of most images. In Figure 15(i), the error matching rate of all images does not change much when the parameter τ26. The gradient threshold β is set to determine whether the pixel point belongs to the weak texture region or the edge region. For the edge region, the scale factors λ1, λ2, and λ3 need to be set for reducing the corresponding distance thresholds L1, L2, and color similarity threshold τ2. In Figure 15(j), β reduces the error matching rate for most of the images, especially for the weak texture images Monopoly. However, for Plastic, the error matching rate increases sharply when β>0.6. Similarly, it can be seen from Figure 15(k) that when λ10.15, the error matching rates tend to be stable for most images except for Plastic. Figure 15(l) that shows λ2 reduces the error matching rate especially for Art images and the error matching rate goes up, as λ2 increases. Figure 15(m) shows that the error matching rates of most images tend to be stable when λ30.5. The λL is a variable color threshold. More constraints will be imposed on it when the arm length becomes longer. As shown in Figure 15(n), the error matching rates of the Plastic and Monopoly images fluctuate while those of other images are nearly kept unchanged. In this paper, to obtain a better matching rate, we set L1 = 34, L2 = 7, τ1 = 20, τ2 = 6, λ1 = 0.15, λ2 = 0.25, and λ3 = 0.5.

    In order to improve the anti-noise robustness and obtain better disparity map in large weak texture regions, we propose a stereo matching algorithm, iFCTACP, which encompasses two innovative points. First, the iFCT, a model based on regional information coding, is used as a new and stable method for cost measurement, with the benefits of its strong noise resistance to illumination and exposure. Secondly, the adaptive cross pyramid model, ACP, can build connections among different regions with similar disparity to fully use image region features. The qualitative and quantitative experiments on the Middlebury dataset validate the effectiveness of iFCTACP, outperforming most known local stereo matching algorithms. Since the depth information can better distinguish between near and distant objects, the solution in this paper can be combined with other applications, such as 360 vision, to further improve the multi-target tracking performance.

    The authors declare that they have not used artifcial intelligence tools in the creation of this article.

    This research was funded by the 2023 Fujian Province Young and Middle-aged Teacher Education Research Project (Science and Technology), grant number JZ230076.

    The authors declare there is no conflict of interest.



    [1] P. Zhou, X. Yang, X. Wang, B. Hu, L. Zhang, W. Zhang, et al., A pneumonia outbreak associated with a new coronavirus of probable bat origin, Nature, 579 (2020), 270–273. doi: 10.1038/s41586-020-2012-7
    [2] J. K. Y. Yap, M. Moriyama, A. Iwasaki, Inflammasomes and pyroptosis as therapeutic targets for COVID-19, J. Immunol., 205 (2020), 307–312. doi: 10.4049/jimmunol.2000513
    [3] M. Z. Tay, C. M. Poh, L. Rénia, P. A. MacAry, L. F. P. Ng, The trinity of COVID-19: Immunity, inflammation and intervention, Nat. Rev. Immunol., 579 (2020), 363–374.
    [4] M. Soy, G. Keser, P. Atagündüz, F. Tabak, I. Atagündüz, S. Kayhan, Cytokine storm in COVID-19: Pathogenesis and overview of anti-inflammatory agents used in treatment, Clin. Rheumatol., 39 (2020), 2085–2094. doi: 10.1007/s10067-020-05190-5
    [5] D. Tang, P. Comish, R. Kang, The hallmarks of COVID-19 disease, PLoS Pathog., 16 (2020), e1008536. doi: 10.1371/journal.ppat.1008536
    [6] A. Shah, Novel coronavirus-induced NLRP3 inflammasome activation: A potential drug target in the treatment of COVID-19, Front. Immunol., 11 (2020), 1021. doi: 10.3389/fimmu.2020.01021
    [7] M. Z. Ratajczak, M. Kucia, SARS-CoV-2 infection and overactivation of NLRP3 inflammasome as a trigger of cytokine storm and risk factor for damage of hematopoietic stem cells, Leukemia, 4 (2020), 1726–1729.
    [8] Y. Fu, Y. Cheng, Y. Wu, Understanding SARS-CoV-2-mediated inflammatory responses: From mechanisms to potential therapeutic tools, Virol. Sin., 35 (2020), 266–271. doi: 10.1007/s12250-020-00207-4
    [9] S. Nagashima, M. C. Mendes, A. P. Camargo, N. H. Borges, T. M. Godoy, A. F. R. Miggiolaro, et al., Endothelial dysfunction and thrombosis in patients with COVID-19-brief report, Arterioscler. Thromb. Vasc. Biol., 40 (2020), 2404–2407. doi: 10.1161/ATVBAHA.120.314860
    [10] Y. Jamilloux, T. Henry, A. Belot, S. Viel, M. Fauter, T. El Jammal, et al., Should we stimulate or suppress immune responses in COVID-19: Cytokine and anti-cytokine interventions, Autoimmun. Rev., 19 (2020), 102567. doi: 10.1016/j.autrev.2020.102567
    [11] C. Y. Taabazuing, M. C. Okondo, D. A. Bachovchin, Pyroptosis and apoptosis pathways engage in bidirectional crosstalk in monocytes and macrophages, Cell Chem. Biol., 24 (2017), 507–514. doi: 10.1016/j.chembiol.2017.03.009
    [12] N. Kelley, D. Jeltema, Y. Duan, Y. He, The NLRP3 inflammasome: An overview of mechanisms of activation and regulation, Int. J. Mol. Sci., 20 (2019), 3328. doi: 10.3390/ijms20133328
    [13] T. Bergsbaken, S. L. Fink, B. T. Cookson, Pyroptosis: Host cell death and inflammation, Nat. Rev. Microbiol., 7 (2009), 99–109. doi: 10.1038/nrmicro2070
    [14] C. A. Dinarello, Immunological and inflammatory functions of the interleukin-1 family, Annu. Rev. Immunol., 27 (2009), 519–550. doi: 10.1146/annurev.immunol.021908.132612
    [15] Y. He, H. Hara, G. Núñez, Mechanism and regulation of NLRP3 inflammasome activation, Trends Biochem. Sci., 41 (2016), 1012–1021. doi: 10.1016/j.tibs.2016.09.002
    [16] Z. B. Zalinger, R. Elliott, S.R. Weiss, Role of the inflammasome-related cytokines IL-1 and IL-18 during infection with murine coronavirus, J. Neurovirol., 23 (2017), 845–854. doi: 10.1007/s13365-017-0574-4
    [17] A. Stutz, D. T. Golenbock, E. Latz, Inflammasomes: Too big to miss, J. Clin. Invest., 119 (2009), 3502–3511. doi: 10.1172/JCI40599
    [18] J. J. O'Shea, M. Gadina, R. M. Siegel, J. Farber, Cytokines, in Rheumatology, (2015), 99–112.
    [19] P. Song, W. Li, J. Xie, Y. Hou, C. You, Cytokine storm induced by SARS-CoV-2, Clin. Chim. Acta, 509 (2020), 280–287. doi: 10.1016/j.cca.2020.06.017
    [20] C. Huang, Y. Wang, X. Li, L. Ren, J. Zhao, Y. Hu, et al., Clinical features of patients infected with 2019 novel coronavirus in Wuhan, China, The Lancet, 395 (2020), 497–506. doi: 10.1016/S0140-6736(20)30183-5
    [21] M. Bertinaria, S. Gastaldi, E. Marini, M. Giorgis, Development of covalent NLRP3 inflammasome inhibitors: Chemistry and biological activity, Arch. Biochem. Biophys., 670 (2019), 116–139. doi: 10.1016/j.abb.2018.11.013
    [22] K. Tsuchiya, Inflammasome-associated cell death: Pyroptosis, apoptosis, and physiological implications, Microbiol. Immunol., 64 (2020), 252–269. doi: 10.1111/1348-0421.12771
    [23] S. L. Fink, B. T. Cookson, Apoptosis, pyroptosis, and necrosis: Mechanistic description of dead and dying eukaryotic cells, Infect. Immun., 73 (2005), 1907–1916. doi: 10.1128/IAI.73.4.1907-1916.2005
    [24] A. G. Kozloski, Inflammasome, Mater. Methods, 10 (2020), 2869.
    [25] S. Christgen, D. E. Place, T. D. Kanneganti, Toward targeting inflammasomes: Insights into their regulation and activation, Cell Res., 30 (2020), 315–327. doi: 10.1038/s41422-020-0295-8
    [26] Z. Zheng, G. Li, Mechanisms and therapeutic regulation of pyroptosis in inflammatory diseases and cancer, Int. J. Mol. Sci., 21 (2020), 1456. doi: 10.3390/ijms21041456
    [27] M. G. Sanders, M. J. Parsons, A. G. Howard, J. Liu, S. R. Fassio, J. A. Martinez, et al., Single-cell imaging of inflammatory caspase dimerization reveals differential recruitment to inflammasomes, Cell Death Dis., 6 (2015), e1813. doi: 10.1038/cddis.2015.186
    [28] C. Semino, S. Carta, M. Gattorno, R. Sitia, A. Rubartelli, Progressive waves of IL-1β release by primary human monocytes via sequential activation of vesicular and gasdermin D-mediated secretory pathways, Cell Death Dis., 9 (2018), 1–14. doi: 10.1038/s41419-017-0012-9
    [29] G. Lopez-Castejon, D. Brough, Understanding the mechanism of IL-1β secretion, Cytokine Growth Factor Rev., 22 (2011), 189–195. doi: 10.1016/j.cytogfr.2011.10.001
    [30] P. Broz, P. Pelegrín, F. Shao, The gasdermins, a protein family executing cell death and inflammation, Nat. Rev. Immunol., 20 (2019), 143–157.
    [31] L. DiPeso, D. X. Ji, R. E. Vance, J. V. Price, Cell death and cell lysis are separable events during pyroptosis, Cell Death Dis., 3 (2017), 1–10.
    [32] D. Brough, N. J. Rothwell, Caspase-1-dependent processing of pro-interleukin-1β is cytosolic and precedes cell death, J. Cell Sci., 120 (2007), 772–781. doi: 10.1242/jcs.03377
    [33] K. Schleich, I. N. Lavrik, Mathematical modeling of apoptosis, Cell Comm. Signal., 11 (2013), 1–7. doi: 10.1186/1478-811X-11-1
    [34] S. L. Spencer, P. K. Sorger, Measuring and modeling apoptosis in single cells, Cell, 144 (2011), 926–939. doi: 10.1016/j.cell.2011.03.002
    [35] W. Wang, T. Zhang, Caspase-1-mediated pyroptosis of the predominance for driving CD4 T cells death: A nonlocal spatial mathematical model, Bull. Math. Biol., 80 (2018), 540–582. doi: 10.1007/s11538-017-0389-8
    [36] D. Veltman, T. Laeremans, E. Passante, H. J. Huber, Signal transduction analysis of the NLRP3-inflammasome pathway after cellular damage and its paracrine regulation, J. Theor. Biol., 415 (2017), 125–136. doi: 10.1016/j.jtbi.2016.12.016
    [37] Y. Bozkurt, A. Demir, B. Erman, A. Gül, Unified modeling of familial mediterranean fever and cryopyrin associated periodic syndromes, Comp. Math. Meth. Med., 15 (2015), 893507.
    [38] F. López-Caamal, H. J. Huber, Stable IL-1β-activation in an inflammasome signalling model depends on positive and negative-feedbacks and tight regulation of protein production, IEEE ACM T. Comput. Bi., 16 (2018), 627–637.
    [39] WHO, World Health Organisation Statement on the Pandemic, 2020. Available from: https://www.who.int/dg/speeches/detail/who-director-general-s-opening-remarks-at-the-media-briefing-on-covid-19–-11-march-2020.
    [40] F. Akpinar, B. Inankur, J. Yin, Spatial-temporal patterns of viral amplification and interference initiated by a single infected cell, J. Virol., 90 (2016), 7552–7566. doi: 10.1128/JVI.00807-16
    [41] A. Bankhead, E. Mancini, A. C. Sims, R. S. Baric, S. McWeeney, P. M. A. Sloot, A simulation framework to investigate in vitro viral infection dynamics, J. Comput. Sci., 4 (2013), 127–134. doi: 10.1016/j.jocs.2011.08.007
    [42] A. L. Bauer, C. Beauchemin, A. S. Perelson, Agent-based modeling of host–pathogen systems: The successes and challenges, Inf. Sci., 179 (2009), 1379–1389. doi: 10.1016/j.ins.2008.11.012
    [43] G. Bocharov, A. Meyerhans, N. Bessonov, S. Trofimchuk, V. Volpert, Spatiotemporal dynamics of virus infection spreading in tissues, PLoS One, 11 (2016), e0168576. doi: 10.1371/journal.pone.0168576
    [44] C. Beauchemin, S. Forrest, F. T. Koster, Modeling influenza viral dynamics in tissue, in International Conference on Artificial Immune Systems (Springer), (2006), 23–36.
    [45] C. Beauchemin, Probing the effects of the well-mixed assumption on viral infection dynamics, J. Theor. Biol., 242 (2006), 464–477. doi: 10.1016/j.jtbi.2006.03.014
    [46] C. Beauchemin, J. Samuel, J. Tuszynski, A simple cellular automaton model for influenza A viral infections, J. Theor. Biol., 232 (2005), 223–234. doi: 10.1016/j.jtbi.2004.08.001
    [47] D. Levin, S. Forrest, S. Banerjee, C. Clay, J. Cannon, M. Moses, et al., A spatial model of the efficiency of T cell search in the influenza-infected lung, J. Theor. Biol., 398 (2016), 52–63. doi: 10.1016/j.jtbi.2016.02.022
    [48] N. Fachada, V. V. Lopes, A. Rosa, Simulating antigenic drift and shift in influenza A, in Proceedings of the 2009 ACM symposium on Applied Computing, (2009), 2093–2100.
    [49] A. L. Jenner, F. Frascoli, A. C. F. Coster, P. S. Kim, Enhancing oncolytic virotherapy: Observations from a Voronoi cell-based model, J. Theor. Biol., 485 (2020), 110052. doi: 10.1016/j.jtbi.2019.110052
    [50] D. Wodarz, A. Hofacre, J. W. Lau, Z. Sun, H. Fan, N. L. Komarova, Complex spatial dynamics of oncolytic viruses in vitro: Mathematical and experimental approaches, PLoS Comput. Biol., 8 (2012), e1002547. doi: 10.1371/journal.pcbi.1002547
    [51] G. An, Introduction of an agent-based multi-scale modular architecture for dynamic knowledge representation of acute inflammation, Theor. Biol. Med., 5 (2008), 11. doi: 10.1186/1742-4682-5-11
    [52] R. C. Cockrell, G. An, Examining the controllability of sepsis using genetic algorithms on an agent-based model of systemic inflammation, PLoS Comput. Biol., 14 (2018), e1005876. doi: 10.1371/journal.pcbi.1005876
    [53] F. Fatehi, R. J. Bingham, E. C. Dykeman, P. G. Stockley, R. Twarock, Comparing antiviral strategies against COVID-19 via multi-scale within host modelling, preprint, arXiv: 2010.08957.
    [54] T. J. Sego, J. O. Aponte-Serrano, J. F. Gianlupi, S. R. Heaps, K. Breithaupt, L. Brusch, et al., A modular framework for multiscale, multicellular, spatiotemporal modeling of acute primary viral infection and immune response in epithelial tissues and its application to drug therapy timing and effectiveness, PLoS Comput. Biol., 16 (2020), e1008451. doi: 10.1371/journal.pcbi.1008451
    [55] Y. Wang, G. An, A. Becker, C. Cockrell, N. Collier, M. Craig, et al., Rapid community-driven development of a SARS-CoV-2 tissue simulator, preprint, bioRχiv: 2020.04.02.019075. Available from: https://www.biorxiv.org/content/10.1101/2020.04.02.019075v3.
    [56] A. V. Bagaev, A. Y. Garaeva, E. S. Lebedeva, A. V. Pichugin, R. I. Ataullakhanov, F. I. Ataullakhanov, Elevated pre-activation basal level of nuclear NF-κB in native macrophages accelerates LPS-induced translocation of cytosolic NF-κB into the cell nucleus, Sci. Reports, 9 (2019), 1–16.
    [57] C. Zhang, C. Zhao, X. Chen, R. Tao, S. Wang, G. Meng, et al., Induction of ASC pyroptosis requires gasdermin D or caspase-1/11-dependent mediators and IFNβ from pyroptotic macrophages, Cell Death Dis., 11 (2020), 470. doi: 10.1038/s41419-020-2664-0
    [58] Y. Huang, H. Jiang, Y. Chen, X. Wang, Y. Yang, J. Tao, et al., Tranilast directly targets NLRP3 to treat inflammasome-driven diseases, EMBO Mol. Med., 10 (2018), e8689.
    [59] M. S. Salahudeen, P. S. Nishtala, An overview of pharmacodynamic modelling, ligand-binding approach and its application in clinical practice, Saudi Pharm. J., 25 (2017), 165–175. doi: 10.1016/j.jsps.2016.07.002
    [60] N. M. de Vasconcelos, N. Van Opdenbosch, H. Van Gorp, E. Parthoens, M. Lamkanfi, Single-cell analysis of pyroptosis dynamics reveals conserved GSDMD-mediated subcellular events that precede plasma membrane rupture, Cell Death Diff., 26 (2019), 146–161. doi: 10.1038/s41418-018-0106-7
    [61] S. Han, T. B. Lear, J. A. Jerome, S. Rajbhandari, C. A. Snavely, D. L. Gulick, et al., Lipopolysaccharide primes the NALP3 inflammasome by inhibiting its ubiquitination and degradation mediated by the SCFFBXL2 E3 ligase, J. Bio. Chem., 290 (2015), 18124–18133. doi: 10.1074/jbc.M115.645549
    [62] J. Cheng, A. L. Waite, E. R., Tkaczyk, K. Ke, N. Richards, A. J. Hunt, et al., Kinetic properties of ASC protein aggregation in epithelial cells, J. Cell. Physiol., 222 (2010), 738–747.
    [63] J. Ruland, Inflammasome: Putting the pieces together, Cell, 156 (2014), 1127–1129. doi: 10.1016/j.cell.2014.02.038
    [64] J. Chai, Y. Shi, Apoptosome and inflammasome: Conserved machineries for caspase activation, Nat. Sci. Rev., 1 (2014), 101–118. doi: 10.1093/nsr/nwt025
    [65] A. Iliev, N. Kyurkchiev, S. Markov, On the approximation of the step function by some sigmoid functions, Math. Comput. Simul., 133 (2017), 223–234. doi: 10.1016/j.matcom.2015.11.005
    [66] MATLAB, version 1.8.0_202 (R2019n). The MathWorks Inc., Natick, Massachusetts, 2019.
    [67] M. A. Moors, S. B. Mizel, Proteasome-mediated regulation of interleukin-1β turnover and export in human monocytes, J. Leukocyte Biol., 68 (2000), 131–136.
    [68] F. Martín-Sánchez, C. Diamond, M. Zeitler, A. I. Gomez, A. Baroja-Mazo, J. Bagnall, et al., Inflammasome-dependent IL-1β release depends upon membrane permeabilisation, Cell Death Diff., 23 (2016), 1219–1231. doi: 10.1038/cdd.2015.176
    [69] G. Qian, A. Mahdi, Sensitivity analysis methods in the biomedical sciences, Math Biosci., 323 (2020), 108306. doi: 10.1016/j.mbs.2020.108306
    [70] S. Hamis, S. Stratiev, G. G. Powathil, Uncertainty and sensitivity analyses methods for agent-based mathematical models: An introductory review, in The Physics of Cancer: Research Advances (ed. Bernard Gerstman), Singapore: World Scientific Publishing, 2021.
    [71] R. P. Dickinson, R. J. Gelinas, Sensitivity analysis of ordinary differential equation systems - A direct method, J. Comput. Phys., 21 (1976), 123–143. doi: 10.1016/0021-9991(76)90007-3
    [72] A. Ghaffarizadeh, R. Heiland, S. H. Friedman, S. M. Mumenthaler, P. Macklin, PhysiCell: An open source physics-based cell simulator for 3-D multicellular systems, PLoS Comput. Biol., 14 (2018), e1005991. doi: 10.1371/journal.pcbi.1005991
    [73] K. Lipinska, K. E. Malone, M. Moerland, C. Kluft, Applying caspase-1 inhibitors for inflammasome assays in human whole blood, J. Immunol. Meth., 411 (2014), 66–69. doi: 10.1016/j.jim.2014.05.018
    [74] K. Schroder, J. Tschopp, The inflammasomes, Cell, 140 (2010), 821–832.
    [75] W. He, H. Wan, L. Hu, P. Chen, X. Wang, Z. Huang, et al., Gasdermin D is an executor of pyroptosis and required for interleukin-1β secretion, Cell Res., 25 (2015), 1285–1298. doi: 10.1038/cr.2015.139
    [76] S. Lee, M. Hirohama, M. Noguchi, K. Nagata, A. Kawaguchi, Influenza A virus infection triggers pyroptosis and apoptosis of respiratory epithelial cells through the type Ⅰ interferon signaling pathway in a mutually exclusive manner, J. Virol., 92 (2018), e00396-18.
    [77] M. P. Lythgoe, P. Middleton, Ongoing clinical trials for the management of the COVID-19 pandemic, Trends Pharmacol. Sci., 41 (2020), 363–382. doi: 10.1016/j.tips.2020.03.006
    [78] K. Sharun, R. Tiwari, J. Dhama, K. Dhama, Dexamethasone to combat cytokine storm in COVID-19: Clinical trials and preliminary evidence, Int. J. Surg., 82 (2020), 179–181. doi: 10.1016/j.ijsu.2020.08.038
    [79] RECOVERY Collaborative Group, Dexamethasone in hospitalized patients with covid-19: Preliminary report, N. Engl. J. Med., 384 (2020), 693–704. doi: 10.1056/NEJMoa2021436
    [80] T. Rhen, J. A. Cidlowski, Antiinflammatory action of glucocorticoids: New mechanisms for old drugs, N. Engl. J. Med., 353 (2005), 1711–1723. doi: 10.1056/NEJMra050541
    [81] M. Cornut, E. Bourdonnay, H. Thomas, Transcriptional Regulation of Inflammasomes, Int. J. Mol. Sci., 21 (2020), 8087. doi: 10.3390/ijms21218087
    [82] S. Christgen, D. E. Place, T. D. Kanneganti, Toward targeting inflammasomes: Insights into their regulation and activation, Cell Res., 30 (2020), 315–327. doi: 10.1038/s41422-020-0295-8
    [83] F. Chen, G. Jiang, H. Liu, Z. Li, Y. Pei, H. Wang, et al., Melatonin alleviates intervertebral disc degeneration by disrupting the IL-1β/NF-κB-NLRP3 inflammasome positive feedback loop, Bone Res., 8 (2020), 1–13. doi: 10.1038/s41413-019-0078-3
    [84] H. Wu, C. Zhao, Q. Xie, J. Xu, G. Fei, TLR2-melatonin feedback loop regulates the activation of NLRP3 inflammasome in murine allergic airway inflammation, Front. Immunol., 11 (2020), 172. doi: 10.3389/fimmu.2020.00172
    [85] B. B. Mishra, V. A. K. Rathinam, G. W. Martens, A. J. Martinot, H. Kornfeld, K. A. Fitzgerald, et al., Nitric oxide controls the immunopathology of tuberculosis by inhibiting NLRP3 inflammasome–dependent processing of IL-1β, Nat. Immunol., 14 (2013), 52–60. doi: 10.1038/ni.2474
    [86] G. Guarda, M. Braun, F. Staehli, A. Tardivel, C. Mattmann, I. Förster, ., Type Ⅰ interferon inhibits interleukin-1 production and inflammasome activation, Immunity, 34 (2011), 213–223. doi: 10.1016/j.immuni.2011.02.006
    [87] K. G. Lokugamage, A. Hage, M. de Vries, A. M. Valero-JImenez, C. Schindewolf, M. Dittmann, et al., Type Ⅰ interferon susceptibility distinguishes SARS-CoV-2 from SARS-CoV, J. Virol., 94 (2020), e01410-20.
    [88] C. Juliana, T. Fernandes-Alnemri, S. Kang, A. Farias, F. Qin, E. S. Alnemri, Non-transcriptional priming and deubiquitination regulate NLRP3 inflammasome activation, J. Biol. Chem., 287 (2012), 36617–36622. doi: 10.1074/jbc.M112.407130
    [89] J. S. Lolkema, D. Slotboom, The Hill analysis and co-ion–driven transporter kinetics, J. Gen. Physio., 145 (2015), 565–574. doi: 10.1085/jgp.201411332
  • Reader Comments
  • © 2021 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(4782) PDF downloads(290) Cited by(2)

Figures and Tables

Figures(12)  /  Tables(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog