<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">jcc</journal-id>
      <journal-title-group>
        <journal-title>Journal of Computer and Communications</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2327-5227</issn>
      <issn pub-type="ppub">2327-5219</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/jcc.2026.146005</article-id>
      <article-id pub-id-type="publisher-id">jcc-151999</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Computer Science</subject>
          <subject>Communications</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>A Novel Polyp Segmentation Method Based on the Vision Transformer and Attention Mechanism</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Guo</surname>
            <given-names>Xinping</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Nie</surname>
            <given-names>Yongqi</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Jia</surname>
            <given-names>Xiuzhu</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Lou</surname>
            <given-names>Mengying</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Li</surname>
            <given-names>Zhiyuan</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Han</surname>
            <given-names>Xiaoyu</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Yu</surname>
            <given-names>Lu</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> School of Medical Imaging, Qilu Medical University, Zibo, China </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>11</day>
        <month>06</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>06</month>
        <year>2026</year>
      </pub-date>
      <volume>14</volume>
      <issue>06</issue>
      <fpage>55</fpage>
      <lpage>70</lpage>
      <history>
        <date date-type="received">
          <day>19</day>
          <month>05</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>20</day>
          <month>06</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>23</day>
          <month>06</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/jcc.2026.146005">https://doi.org/10.4236/jcc.2026.146005</self-uri>
      <abstract>
        <p>The accurate segmentation of the polyp is very important for the diagnosis and treatment plans of colorectal cancer. Although the UNet model and models with the U-shaped structure have achieved great success in polyp image segmentation, they are still limited by the colors, sizes, and shapes of polyps, as well as the low contrast, various noise, and blurred edges of the colonoscopy, which can easily result in a large amount of redundant information, weak complementarity between different levels of features, and inaccurate polyp localization. To deal with the special characteristics of the polyp images and improve the segmentation performance, a new segmentation model named VTANet, which is based on the pyramid vision transformer and BAM (Bottleneck Attention Module), is developed. The proposed model consists of four modules: the pyramid vision transformer (PVT) encoder, the Feature Aggregation Module (FAM), the Adaptive Attention Fusion Module (AAFM), and the Aggregation Similarity Module (ASM). The PVT learns a more robust representation model; the FAM enhances the complementarity between features by cascading the encoder features and acquiring richer context and fine-grained features. The AAFM makes polyp localization more accurate by introducing the BAM attention module to obtain richer details of the polyps. To verify effectiveness and accuracy, experiments on five popularly used datasets are carefully designed and implemented. The proposed VTANet achieves competitive and generally superior performance across five public datasets. Although it does not obtain the best score on every metric, especially on several MAE or E-measure results, it consistently improves the main overlap-based metrics such as mDice and mIoU on most datasets. This indicates that VTANet provides a favorable balance between region-level accuracy, boundary preservation, and generalization ability.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Polyp Segmentation</kwd>
        <kwd>UNet Model</kwd>
        <kwd>The Attention Mechanism</kwd>
        <kwd>The Pyramid Vision Transformer</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>As shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>, colorectal cancer is the third most prevalent and second most lethal cancer in the world. According to statistical reports, colorectal cancer also shows an increasing trend in prevalence and mortality rate in China, accounting for almost 23.7% of the 4.57 million new cancer cases each year [<xref ref-type="bibr" rid="B1">1</xref>]. Polyps, which grow abnormally in the colon and rectum over time, are the main cause of colorectal cancer. When cells in the colon or rectum grow out of control, it is easy for cancer to develop, which can even lead to death. Thus, the ability to quickly and accurately detect the location of polyps and provide treatments, such as colonoscopy and resection operation at an early stage, is very important for the health of patients. </p>
      <p>The precise localization and extraction of the polyps are crucial steps to make the diagnosis and treatment plans. Medical image segmentation provides a strong and helpful tool for doctors to carefully observe the lesion and accurately implement the operation [<xref ref-type="bibr" rid="B2">2</xref>]. However, as shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>, the segmentation of the polyp is a challenging task. Firstly, even if they are of the same type, the size, color, and texture are different. Secondly, due to the reflection of the intestinal mucus and polyps under colonoscopy, the contrast between polyps and the surrounding mucosa is not strong enough, and the boundary is not very clear. The two above reasons may cause missed detection and inaccurate segmentation of polyps. Thus, an accurate segmentation method for potential polyps in the early stage is of great significance for preventing colorectal cancer.</p>
      <fig id="fig1">
        <label>Figure 1</label>
        <graphic xlink:href="https://html.scirp.org/file/1733572-rId15.jpeg?20260623112848" />
      </fig>
      <p><bold>Figure 1.</bold>The prevalence and mortality of colorectal cancer. </p>
      <p>In traditional medical image segmentation, the early conventional colon polyp image segmentation algorithm mainly analyzes the characteristics of colon polyps. Mamonov <italic>et al.</italic> designed a binary classifier to mark each frame of an image as containing or not containing polyps according to the geometric analysis and texture content on each edge of a colonoscopy video [<xref ref-type="bibr" rid="B3">3</xref>]. Bernal <italic>et al.</italic> obtained the polyp boundary information using a Window Median Depth of Valleys Accumulation (WM-DOVA) energy map, and detected intestinal polyps through polyp texture to complete the detection of the polyp area [<xref ref-type="bibr" rid="B4">4</xref>]. Sasmal <italic>et al.</italic> proposed a detection method based on the shape of polyps, mainly using the principal component analysis (PCA) method and the region-based active contour model to complete the segmentation [<xref ref-type="bibr" rid="B5">5</xref>]. For these segmentation algorithms, they heavily relied on the manual extraction of features, and the polyps and their surrounding tissues are distinguished by the training classifiers. The expressive ability of the manually extracted features is quite limited. Although the traditional algorithms are relatively simple in implementation, they cannot consider the effective features of the polyp area at the same time and cannot combine these features. Therefore, the segmentation results of them are not satisfying. </p>
      <p>Recently, it has been reported that, compared with traditional segmentation methods, deep learning-based segmentation methods perform better. The main principle of the deep learning-based colon polyp image segmentation algorithms is to design a convolutional neural network model, use colon polyp images and labels to train the model, and then use the trained model for segmentation. The typical models include CNN, GAN, and the UNet model [<xref ref-type="bibr" rid="B6">6</xref>]. For example, Ronneberger <italic>et al.</italic> proposed a fully symmetric UNet network with an encoder-decoder structure [<xref ref-type="bibr" rid="B7">7</xref>]. The UNet network uses skip connections between the encoder and the decoder for feature fusion, which performs well in cell segmentation tasks. Inspired by the successful application of the UNet network in biomedical image segmentation, more and more related works on the UNet model and its variant structures are used to segment polyps. For example, Zhang <italic>et al.</italic> proposed a U-shaped network ResUNet with a deep residual system [<xref ref-type="bibr" rid="B8">8</xref>]. The residual connection is introduced into each convolution module of the UNet to obtain deeper image features, thereby improving the accuracy of segmentation results. Zhou <italic>et al.</italic> proposed the UNet++ model by reducing the depth of the unknown network; it redesigns the jump connection and designs a scheme to prune the network to improve the performance of UNet [<xref ref-type="bibr" rid="B9">9</xref>]. Fan <italic>et al.</italic> proposed a parallel reverse attention network, PraNet, for accurate segmentation of polyps [<xref ref-type="bibr" rid="B10">10</xref>]. Jha <italic>et al.</italic> proposed a double UNet network. By cascading two variants of the UNet structure to form a dual-network structure, the entire network has more robust feature extraction capabilities and a larger receptive field [<xref ref-type="bibr" rid="B11">11</xref>].</p>
      <fig id="fig2">
        <label>Figure 2</label>
        <graphic xlink:href="https://html.scirp.org/file/1733572-rId16.jpeg?20260623112848" />
      </fig>
      <p><bold>Figure 2.</bold> Examples of the colorectal polyp in endoscopic images. In each image, the red line indicates the polyp contour. The polyp varies in morphology, size, and brightness. </p>
      <p>Though good results have been obtained by the above-mentioned deep learning-based segmentation algorithms, there is still much room for improvement to accurately segment the polyps due to the special characteristics of the polyps: (1) the colors of polyps and surrounding tissues are extremely similar; (2) a diversity of sizes, shapes, and textures of the polyps; (3) some polyps may be hidden in the folds of the colon. </p>
      <p>In order to address the special characteristics of polyp segmentation, a new segmentation model named VTANet, which is based on the pyramid vision transformer and BAM attention, is proposed in this paper. Experiments on five public polyp image datasets demonstrate that the proposed model greatly improves polyp image segmentation performance. Compared with existing transformer-based or attention-based polyp segmentation methods, VTANet is not a simple replacement of the CNN backbone with a transformer encoder. Instead, it integrates PVTv2, BAM, FAM, AAFM, and ASM into a unified segmentation framework. PVTv2 is used to extract multi-scale global contextual representations with a relatively low computational cost. FAM aggregates high-level encoder features to enhance semantic consistency and lesion localization. AAFM introduces BAM-based channel-spatial attention to strengthen low-level boundary, texture, and color representations. ASM further models the similarity relationship between low-level detail features and high-level semantic cues, allowing detailed appearance information to be injected into global semantic representations. Therefore, the novelty of VTANet lies in the cooperative design of transformer-based hierarchical encoding, attention-guided low-level feature refinement, high-level feature aggregation, and similarity-based feature interaction for accurate polyp segmentation. </p>
    </sec>
    <sec id="sec2">
      <title>2. The Whole Method</title>
      <sec id="sec2dot1">
        <title>2.1. The Architecture of the VTANet</title>
        <fig id="fig3">
          <label>Figure 3</label>
          <graphic xlink:href="https://html.scirp.org/file/1733572-rId17.jpeg?20260623112849" />
        </fig>
        <p><bold>Figure 3.</bold> The architecture of the VTANet model. </p>
        <p>As shown in <xref ref-type="fig" rid="fig3">Figure 3</xref>, the proposed VTANet model consists of four key modules: the pyramid vision transformer (PVT) encoder, the Feature Aggregation Module (FAM), the Attention Fusion Module (AAFM), and the Aggregation Similarity Module (ASM). PVT is used to obtain the long-range dependency features from the encoder. FAM aggregates the high-level features to obtain the semantic and location information of polyps. AAFM removes noise and enhances the low-level polyp representation information, including texture, color, and edge. ASM combines the low-level and high-level features provided by AAFM and FAM, effectively transmitting information to the whole region.</p>
      </sec>
      <sec id="sec2dot2">
        <title>2.2. The Transformer Encoder</title>
        <p>Due to uncontrollable factors in the collection of polyp images, they tend to contain significant noise, such as motion blur, rotation, and reflection. Some recent work has reported that the vision transformer shows more robust performance and better robustness than CNNs [<xref ref-type="bibr" rid="B12">12</xref>]-[<xref ref-type="bibr" rid="B14">14</xref>]. Inspired by these ideas, the vision transformer is used as the backbone network to extract more robust and powerful polyp information. Different from the fixed columnar structure or shift window, the PVT is a pyramid architecture whose representation is calculated with spatial-reduction attention operations. Thus, it can reduce resource consumption. Specifically, the encoder part uses an improved version of PVT, namely PVTV2, with more powerful feature extraction capabilities. In order to make PVTV2 suitable for the segmentation task of polyps, the last classification layer is deleted, and four multi-scale feature maps (x1, x2, x3, x4) are generated at different stages. In these feature maps, x1 provides polyp information in the underlying features; x2, x3, x4 provide the advanced features of polyps, such as semantic and location information. </p>
      </sec>
      <sec id="sec2dot3">
        <title>2.3. Feature Aggregation Module</title>
        <p>The primary purpose of the FAM module is to combine high-level features from the encoder into a better feature representation to improve performance. It captures different information through different features to enhance the robustness of the model and reduce overfitting. Specifically, we define <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> F </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> as a convolutional unit composed of a 3 × 3 convolutional layer with padding set to 1. Batch normalization and ReLU [<xref ref-type="bibr" rid="B15">15</xref>] are used. We define <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> G </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> as a convolutional unit composed of a 1 × 1 convolutional layer with padding set to 1 and ReLU. Firstly, the highest-level feature map <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 4 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is up-sampled, and the up-sampled results are passed through the convolution unit <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> F </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> to obtain <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mrow><mml:mn> 4 </mml:mn><mml:mo> − </mml:mo><mml:mi> t </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> . Then, the obtained result <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mrow><mml:mn> 4 </mml:mn><mml:mo> − </mml:mo><mml:mi> t </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is spliced with the feature mapping <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> in the encoder to generate the fusion feature <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mrow><mml:mn> 3 </mml:mn><mml:mo> − </mml:mo><mml:mi> a </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> . The result obtained by <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mrow><mml:mn> 3 </mml:mn><mml:mo> − </mml:mo><mml:mi> a </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> through the convolution unit <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> G </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is up-sampled, and the up-sampled result is passed through the convolution unit <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> F </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> to obtain <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mrow><mml:mn> 3 </mml:mn><mml:mo> − </mml:mo><mml:mi> t </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> . Then, the obtained result <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mrow><mml:mn> 3 </mml:mn><mml:mo> − </mml:mo><mml:mi> t </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is spliced with the feature map <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> in the encoder to generate the fusion feature <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mrow><mml:mn> 2 </mml:mn><mml:mo> − </mml:mo><mml:mi> a </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> . Finally, the obtained feature fusion <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mrow><mml:mn> 2 </mml:mn><mml:mo> − </mml:mo><mml:mi> a </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> obtains the final output feature fam-feature of the module through the convolution unit G2(·). The process is described by the following equations. </p>
        <disp-formula id="FD1">
          <label>(1)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>a</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>G</mml:mi>
                <mml:mn>1</mml:mn>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>X</mml:mi>
                    <mml:mrow>
                      <mml:mn>3</mml:mn>
                      <mml:mo>−</mml:mo>
                      <mml:mi>a</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mrow>
                <mml:mo>{</mml:mo>
                <mml:mrow>
                  <mml:mi>C</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>n</mml:mi>
                  <mml:mi>c</mml:mi>
                  <mml:mi>a</mml:mi>
                  <mml:mi>t</mml:mi>
                  <mml:mrow>
                    <mml:mo>{</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>X</mml:mi>
                        <mml:mn>3</mml:mn>
                      </mml:msub>
                      <mml:mo>,</mml:mo>
                      <mml:mi>u</mml:mi>
                      <mml:mi>p</mml:mi>
                      <mml:mrow>
                        <mml:mo>{</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>F</mml:mi>
                            <mml:mn>1</mml:mn>
                          </mml:msub>
                          <mml:mrow>
                            <mml:mo>{</mml:mo>
                            <mml:mrow>
                              <mml:msub>
                                <mml:mi>X</mml:mi>
                                <mml:mn>4</mml:mn>
                              </mml:msub>
                            </mml:mrow>
                            <mml:mo>}</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mo>}</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>}</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>}</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD2">
          <label>(2)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>f</mml:mi>
              <mml:mi>e</mml:mi>
              <mml:mi>a</mml:mi>
              <mml:mi>t</mml:mi>
              <mml:mi>u</mml:mi>
              <mml:mi>r</mml:mi>
              <mml:mi>e</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>G</mml:mi>
                <mml:mn>2</mml:mn>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>X</mml:mi>
                    <mml:mrow>
                      <mml:mn>2</mml:mn>
                      <mml:mo>−</mml:mo>
                      <mml:mi>a</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mrow>
                <mml:mo>{</mml:mo>
                <mml:mrow>
                  <mml:mi>C</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>n</mml:mi>
                  <mml:mi>c</mml:mi>
                  <mml:mi>a</mml:mi>
                  <mml:mi>t</mml:mi>
                  <mml:mrow>
                    <mml:mo>{</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>X</mml:mi>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                      <mml:mo>,</mml:mo>
                      <mml:mi>u</mml:mi>
                      <mml:mi>p</mml:mi>
                      <mml:mrow>
                        <mml:mo>{</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>F</mml:mi>
                            <mml:mn>2</mml:mn>
                          </mml:msub>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>a</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mo>}</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>}</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>}</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
      </sec>
      <sec id="sec2dot4">
        <title>2.4. The Adaptive Attention Fusion Module</title>
        <p>The low-level features usually contain rich details, such as the texture, color, and edge of polyps. However, polyps are often very similar in appearance to the background. Therefore, a powerful extractor is needed to identify the details of polyps. As shown in <xref ref-type="fig" rid="fig4">Figure 4</xref>, an adaptive attention fusion module is introduced to capture the details of polyps from different dimensions of the low-level feature map <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> . Precisely, the adaptive attention fusion module consists of the channel attention operation Attc(·) and the spatial attention operation Atts(·) [<xref ref-type="bibr" rid="B16">16</xref>]. Firstly, the feature map <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> generated by the encoder is encoded into a one-dimensional feature vector through global average pooling so that each channel has a global receptive field; then, the fully connected layer is used to reduce the dimension of the one-dimensional feature vector, and the ReLU activation function is used for nonlinear processing. Then the fully connected layer is used to increase the dimension. Finally, the corresponding weight <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> M </mml:mi><mml:mi> c </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is obtained by batch normalization. In summary, the calculation formula for the channel attention operation is described by Equation (3): </p>
        <disp-formula id="FD3">
          <label>(3)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>M</mml:mi>
                <mml:mi>c</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>X</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mi>B</mml:mi>
              <mml:mi>N</mml:mi>
              <mml:mrow>
                <mml:mo>{</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>W</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>{</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>W</mml:mi>
                        <mml:mn>0</mml:mn>
                      </mml:msub>
                      <mml:mi>A</mml:mi>
                      <mml:mi>v</mml:mi>
                      <mml:mi>g</mml:mi>
                      <mml:mi>P</mml:mi>
                      <mml:mi>o</mml:mi>
                      <mml:mi>o</mml:mi>
                      <mml:mi>l</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>X</mml:mi>
                            <mml:mn>1</mml:mn>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>}</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>}</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The spatial attention operation process in parallel with the channel attention is as follows: Firstly, the <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> feature map is reduced by a 11 convolution, and then the feature information is extracted by two dilated convolutions with a convolution kernel size of 33. The dilated convolution has a larger receptive field. Finally, the feature map is mapped to 1 × <italic>W</italic> × <italic>H</italic> by a 1 * 1 convolution, and the spatial attention map <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> M </mml:mi><mml:mi> s </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is obtained. The calculation formula is described by Equation (4): </p>
        <disp-formula id="FD4">
          <label>(4)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>M</mml:mi>
                <mml:mi>s</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>X</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mi>B</mml:mi>
              <mml:mi>N</mml:mi>
              <mml:mrow>
                <mml:mo>{</mml:mo>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mi>f</mml:mi>
                    <mml:mn>3</mml:mn>
                    <mml:mrow>
                      <mml:mn>11</mml:mn>
                    </mml:mrow>
                  </mml:msubsup>
                  <mml:mrow>
                    <mml:mo>{</mml:mo>
                    <mml:mrow>
                      <mml:msubsup>
                        <mml:mi>f</mml:mi>
                        <mml:mn>2</mml:mn>
                        <mml:mrow>
                          <mml:mn>33</mml:mn>
                        </mml:mrow>
                      </mml:msubsup>
                      <mml:mrow>
                        <mml:mo>{</mml:mo>
                        <mml:mrow>
                          <mml:msubsup>
                            <mml:mi>f</mml:mi>
                            <mml:mn>1</mml:mn>
                            <mml:mrow>
                              <mml:mn>33</mml:mn>
                            </mml:mrow>
                          </mml:msubsup>
                          <mml:mrow>
                            <mml:mo>{</mml:mo>
                            <mml:mrow>
                              <mml:msubsup>
                                <mml:mi>f</mml:mi>
                                <mml:mn>0</mml:mn>
                                <mml:mrow>
                                  <mml:mn>11</mml:mn>
                                </mml:mrow>
                              </mml:msubsup>
                              <mml:mrow>
                                <mml:mo>{</mml:mo>
                                <mml:mi>f</mml:mi>
                                <mml:mo>}</mml:mo>
                              </mml:mrow>
                            </mml:mrow>
                            <mml:mo>}</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mo>}</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>}</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>}</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>When the channel attention and spatial attention are fused, the <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> M </mml:mi><mml:mi> c </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> M </mml:mi><mml:mi> s </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> are extended to the same latitude through the broadcast mechanism. Then, the weights are added to obtain the attention vector <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> M </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . Finally, the input feature graph <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is multiplied by <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> M </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> element-wise and then added to <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> through the residual structure. The formula is as follows: </p>
        <disp-formula id="FD5">
          <label>(5)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:msup>
                  <mml:mi>X</mml:mi>
                  <mml:mo>′</mml:mo>
                </mml:msup>
                <mml:mn>1</mml:mn>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>X</mml:mi>
                <mml:mn>1</mml:mn>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>X</mml:mi>
                <mml:mn>1</mml:mn>
              </mml:msub>
              <mml:mo>×</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>M</mml:mi>
                    <mml:mi>c</mml:mi>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>X</mml:mi>
                        <mml:mn>1</mml:mn>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mi>M</mml:mi>
                    <mml:mi>s</mml:mi>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>U</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
      </sec>
      <sec id="sec2dot5">
        <title>2.5. The Aggregation Similarity Module</title>
        <p>The non-local operation is introduced into the graph convolution domain to implement the aggregate similarity module, which explores the relationship between the low-level local features from AAFM and the high-level cues from FAM. Therefore, ASM can use global attention to inject detailed appearance features into high-level semantic features. Given a feature map <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> Y </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> containing high-level semantic information and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> Y </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> with rich appearance details, they are merged through self-attention. Firstly, the summation of the two linear mapping functions <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> W </mml:mi><mml:mi> θ </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> W </mml:mi><mml:mi> Φ </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is applied on <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> Y </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> . The dimension of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> Y </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is reduced to obtain the feature mapping <inline-formula><mml:math><mml:mrow><mml:mi> Q </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> R </mml:mi><mml:mrow><mml:mfrac><mml:mi> H </mml:mi><mml:mn> 8 </mml:mn></mml:mfrac><mml:mo> × </mml:mo><mml:mfrac><mml:mi> W </mml:mi><mml:mn> 8 </mml:mn></mml:mfrac><mml:mo> × </mml:mo><mml:mn> 16 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:mi> K </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> R </mml:mi><mml:mrow><mml:mfrac><mml:mi> H </mml:mi><mml:mn> 8 </mml:mn></mml:mfrac><mml:mo> × </mml:mo><mml:mfrac><mml:mi> W </mml:mi><mml:mn> 8 </mml:mn></mml:mfrac><mml:mo> × </mml:mo><mml:mn> 16 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> . Then, the convolution operation with a kernel size of 1 * 1 is used as the linear mapping process [<xref ref-type="bibr" rid="B17">17</xref>]. The process can be expressed as: </p>
        <disp-formula id="FD6">
          <label>(6)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>Q</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>W</mml:mi>
                <mml:mi>θ</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>Y</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>,</mml:mo>
              <mml:mi>K</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>W</mml:mi>
                <mml:mi>Φ</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>Y</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <fig id="fig4">
          <label>Figure 4</label>
          <graphic xlink:href="https://html.scirp.org/file/1733572-rId92.jpeg?20260623112850" />
        </fig>
        <p><bold>Figure 4.</bold> The network structure of BAM. </p>
        <p>For <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> Y </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> , we use the convolution unit <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> W </mml:mi><mml:mi> g </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> to reduce the channel dimension to 32 and interpolate it to the same size as <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> Y </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> . Then, the softmax function is applied to the channel dimension, and the second channel is selected as the attention mapping to obtain <inline-formula><mml:math><mml:mrow><mml:msub><mml:msup><mml:mi> T </mml:mi><mml:mo> ′ </mml:mo></mml:msup><mml:mn> 2 </mml:mn></mml:msub><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> R </mml:mi><mml:mrow><mml:mfrac><mml:mi> H </mml:mi><mml:mn> 8 </mml:mn></mml:mfrac><mml:mo> × </mml:mo><mml:mfrac><mml:mi> W </mml:mi><mml:mn> 8 </mml:mn></mml:mfrac><mml:mo> × </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> . Next, calculate the Hadamard product between K and <inline-formula><mml:math><mml:mrow><mml:msub><mml:msup><mml:mi> T </mml:mi><mml:mo> ′ </mml:mo></mml:msup><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> . This operation assigns different weights to the pixels, thereby increasing the weight of the edge pixels. After that, the adaptive pooling operation is used to reduce the displacement of the feature, and center clipping is applied to obtain the feature map <inline-formula><mml:math><mml:mrow><mml:mi> V </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> R </mml:mi><mml:mrow><mml:mn> 4 </mml:mn><mml:mo> × </mml:mo><mml:mn> 4 </mml:mn><mml:mo> × </mml:mo><mml:mn> 16 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> . The process can be expressed as follows: </p>
        <disp-formula id="FD7">
          <label>(7)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>V</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mi>A</mml:mi>
              <mml:mi>P</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>K</mml:mi>
                  <mml:mo>×</mml:mo>
                  <mml:mi>F</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>W</mml:mi>
                        <mml:mi>g</mml:mi>
                      </mml:msub>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>Y</mml:mi>
                            <mml:mn>2</mml:mn>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where AP represents pooling and clipping operations. </p>
      </sec>
    </sec>
    <sec id="sec3">
      <title>3. Experimental Results and Discussion</title>
      <sec id="sec3dot1">
        <title>3.1. The Experimental Setting</title>
        <p>To evaluate the proposed method, five public polyp datasets, <italic>i.e.</italic>, the Kvasir-SEG [<xref ref-type="bibr" rid="B18">18</xref>], ClinicDB [<xref ref-type="bibr" rid="B19">19</xref>], ColonDB [<xref ref-type="bibr" rid="B20">20</xref>], Endoscene [<xref ref-type="bibr" rid="B21">21</xref>], and ETIS [<xref ref-type="bibr" rid="B22">22</xref>], are used. Specifically, the ClinicDB and Kvasir-SEG datasets are used to assess the learning ability of the model. The ClinicDB contains 612 images that are extracted from colonoscopy videos. Kvasir-SEG includes 1000 polyp images. In the experiment, the same 548 and 900 images in the ClinicDB and Kvasir-SEG datasets are used as the training sets, and the remaining 64 and 100 images are used as the corresponding testing sets. </p>
        <p>During training, the official training images from Kvasir-SEG and ClinicDB were used. A validation subset was separated from the training set to monitor model convergence and select the best checkpoint. The checkpoint with the highest validation mDice was used for final testing. All experiments were conducted with a fixed random seed to reduce the influence of random initialization and data shuffling. The PVTv2 encoder was initialized with ImageNet-pretrained weights, while the newly added FAM, AAFM, ASM, and prediction layers were randomly initialized. The multi-scale training strategy refers to random resizing of the input images within a predefined scale range before cropping or resizing them to 352 × 352, so that the model can learn scale-robust representations for polyps of different sizes. </p>
        <p>All the experiments are implemented using the PyTorch framework. Considering the difference in the size of each polyp image, a multi-scale strategy is used in training. In addition, the AdamW optimizer is used to update the network parameters, which is widely used in transformer networks [<xref ref-type="bibr" rid="B23">23</xref>][<xref ref-type="bibr" rid="B24">24</xref>]. The learning rate is set to 1e−4, and the weight decay is also adjusted to 1e−4. In addition, the size of the input image is adjusted to 352 × 352, and the minibatch size is 16 for 100 epochs. In the test section, only the image size is adjusted to 352 × 352, and there is no post-processing optimization strategy. </p>
        <p>The training process uses two loss functions to optimize the output model, which can be expressed by the following formula: </p>
        <disp-formula id="FD8">
          <label>(8)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>L</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>L</mml:mi>
                <mml:mrow>
                  <mml:mi>m</mml:mi>
                  <mml:mi>a</mml:mi>
                  <mml:mi>i</mml:mi>
                  <mml:mi>n</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>L</mml:mi>
                <mml:mrow>
                  <mml:mi>a</mml:mi>
                  <mml:mi>u</mml:mi>
                  <mml:mi>x</mml:mi>
                </mml:mrow>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> L </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> i </mml:mi><mml:mi> n </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> L </mml:mi><mml:mrow><mml:mi> a </mml:mi><mml:mi> u </mml:mi><mml:mi> x </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are the primary and auxiliary loss functions, respectively. </p>
        <p>The main loss function calculates the loss between the final segmentation result and the ground truth. The formula can be written as: </p>
        <disp-formula id="FD9">
          <label>(9)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>L</mml:mi>
                <mml:mrow>
                  <mml:mi>m</mml:mi>
                  <mml:mi>a</mml:mi>
                  <mml:mi>i</mml:mi>
                  <mml:mi>n</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msubsup>
                <mml:mi>L</mml:mi>
                <mml:mrow>
                  <mml:mi>I</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>U</mml:mi>
                </mml:mrow>
                <mml:mi>w</mml:mi>
              </mml:msubsup>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>Y</mml:mi>
                    <mml:mn>2</mml:mn>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:mi>G</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>+</mml:mo>
              <mml:msubsup>
                <mml:mi>L</mml:mi>
                <mml:mrow>
                  <mml:mi>B</mml:mi>
                  <mml:mi>C</mml:mi>
                  <mml:mi>E</mml:mi>
                </mml:mrow>
                <mml:mi>w</mml:mi>
              </mml:msubsup>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>Y</mml:mi>
                    <mml:mn>2</mml:mn>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:mi>G</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The auxiliary loss function calculates the loss between the intermediate result from FAM and the ground truth. The formula can be written as: </p>
        <disp-formula id="FD10">
          <label>(10)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>L</mml:mi>
                <mml:mrow>
                  <mml:mi>a</mml:mi>
                  <mml:mi>u</mml:mi>
                  <mml:mi>x</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msubsup>
                <mml:mi>L</mml:mi>
                <mml:mrow>
                  <mml:mi>I</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>U</mml:mi>
                </mml:mrow>
                <mml:mi>w</mml:mi>
              </mml:msubsup>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>Y</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:mi>G</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>+</mml:mo>
              <mml:msubsup>
                <mml:mi>L</mml:mi>
                <mml:mrow>
                  <mml:mi>B</mml:mi>
                  <mml:mi>C</mml:mi>
                  <mml:mi>E</mml:mi>
                </mml:mrow>
                <mml:mi>w</mml:mi>
              </mml:msubsup>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>Y</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:mi>G</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> L </mml:mi><mml:mrow><mml:mi> I </mml:mi><mml:mi> o </mml:mi><mml:mi> U </mml:mi></mml:mrow><mml:mi> w </mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> L </mml:mi><mml:mrow><mml:mi> B </mml:mi><mml:mi> C </mml:mi><mml:mi> E </mml:mi></mml:mrow><mml:mi> w </mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> are the weighted intersection over union (IoU) loss and weighted binary cross-entropy (BCE) loss. </p>
        <p>The prediction graph is limited in terms of global structure (object level) and local detail (pixel level) perspectives, which is different from the standard BCE loss function (treating all pixels equally). </p>
        <p>Six popularly used evaluation indices, including the Dice, IoU, mean absolute error (MAE), weighted F-measure (<inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> F </mml:mi><mml:mi> β </mml:mi><mml:mi> w </mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> ), S-measure (Sα) [<xref ref-type="bibr" rid="B25">25</xref>], and E-measure (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> E </mml:mi><mml:mi> ε </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> ) [<xref ref-type="bibr" rid="B26">26</xref>], are adopted to evaluate the performances. The Dice and IoU are region-level similarity measures that mainly focus on the internal consistency of segmented objects. We use the average values of Dice and IoU, denoted as mDice and mIoU, respectively. MAE measures the difference between the model prediction results and the actual labels. The weighted F-measure (<inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> F </mml:mi><mml:mi> β </mml:mi><mml:mi> w </mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula> ) comprehensively considers the recall and precision, MAE measures the average pixel-wise absolute error between the normalized saliency prediction map and the binary ground-truth mask, and S-measure evaluates the structural similarity between the real-valued saliency map and the binary ground-truth. It considers object-aware and region-aware structure similarities. E-measure considers the global means of the image and local pixel matching simultaneously [<xref ref-type="bibr" rid="B27">27</xref>]. </p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. Experimental Results</title>
        <p>In order to verify the effectiveness and robustness of the proposed model, 7 famous network models are compared, namely: UNet [<xref ref-type="bibr" rid="B7">7</xref>], UNet++ [<xref ref-type="bibr" rid="B9">9</xref>], MSEG [<xref ref-type="bibr" rid="B28">28</xref>], ACSNet [<xref ref-type="bibr" rid="B29">29</xref>], PraNet [<xref ref-type="bibr" rid="B10">10</xref>], EU-Net [<xref ref-type="bibr" rid="B30">30</xref>], and SANet [<xref ref-type="bibr" rid="B31">31</xref>]. </p>
        <p>As can be seen from <bold>Table 1</bold>, the mDice, mIoU, Sα, m, MAE scores of the proposed model on the ETIS dataset are higher than those of UNet by 2.89%, 2.74%, 2.7%, 1.09%, 1.64%, and 0.3%, respectively. In addition, it can be seen from <bold>Tables 2</bold><bold>-</bold><bold>5</bold>that the six evaluation metrics also achieve good results on the other four datasets. The combined results show that the model has better learning ability. </p>
        <p>All comparison methods were retrained using the same data preprocessing, input resolution, training schedule, optimizer, and evaluation metrics. </p>
        <p><bold>Table 1.</bold> The segmentation results of endoscene dataset.</p>
        <table-wrap id="tbl1">
          <label>Table 1</label>
          <table>
            <tbody>
              <tr>
                <td>
                </td>
                <td>
                  <italic>mDice</italic>
                </td>
                <td>
                  <italic>
                    <bold>mIoU</bold>
                  </italic>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msubsup>
                          <mml:mi>F</mml:mi>
                          <mml:mi>β</mml:mi>
                          <mml:mi>w</mml:mi>
                        </mml:msubsup>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>S</mml:mi>
                          <mml:mi>α</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>m</mml:mi>
                        </mml:mstyle>
                        <mml:msub>
                          <mml:mi>E</mml:mi>
                          <mml:mi>ε</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <italic>MAE</italic>
                </td>
              </tr>
              <tr>
                <td>UNet</td>
                <td>0.710</td>
                <td>0.627</td>
                <td>0.684</td>
                <td>0.843</td>
                <td>0.847</td>
                <td>0.022</td>
              </tr>
              <tr>
                <td>UNet++</td>
                <td>0.707</td>
                <td>0.624</td>
                <td>0.687</td>
                <td>0.839</td>
                <td>0.834</td>
                <td>0.018</td>
              </tr>
              <tr>
                <td>MSEG</td>
                <td>0.874</td>
                <td>0.804</td>
                <td>0.852</td>
                <td>0.924</td>
                <td>0.948</td>
                <td>0.009</td>
              </tr>
              <tr>
                <td>ASCNet</td>
                <td>0.863</td>
                <td>0.787</td>
                <td>0.825</td>
                <td>0.923</td>
                <td>0.939</td>
                <td>0.013</td>
              </tr>
              <tr>
                <td>PraNet</td>
                <td>0.871</td>
                <td>0.797</td>
                <td>0.843</td>
                <td>0.925</td>
                <td>0.950</td>
                <td>0.010</td>
              </tr>
              <tr>
                <td>SANet</td>
                <td>0.837</td>
                <td>0.765</td>
                <td>0.805</td>
                <td>0.904</td>
                <td>0.919</td>
                <td>0.015</td>
              </tr>
              <tr>
                <td>EU-Net</td>
                <td>0.888</td>
                <td>0.815</td>
                <td>0.859</td>
                <td>0.928</td>
                <td>0.962</td>
                <td>0.008</td>
              </tr>
              <tr>
                <td>VTANet</td>
                <td>0.904</td>
                <td>0.826</td>
                <td>0.872</td>
                <td>0.941</td>
                <td>0.978</td>
                <td>0.009</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 2.</bold>The segmentation results of kvasir-seg dataset.</p>
        <table-wrap id="tbl2">
          <label>Table 2</label>
          <table>
            <tbody>
              <tr>
                <td>
                </td>
                <td>
                  <italic>mDice</italic>
                </td>
                <td>
                  <italic>
                    <bold>mIoU</bold>
                  </italic>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msubsup>
                          <mml:mi>F</mml:mi>
                          <mml:mi>β</mml:mi>
                          <mml:mi>w</mml:mi>
                        </mml:msubsup>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>S</mml:mi>
                          <mml:mi>α</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>m</mml:mi>
                        </mml:mstyle>
                        <mml:msub>
                          <mml:mi>E</mml:mi>
                          <mml:mi>ε</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <italic>MAE</italic>
                </td>
              </tr>
              <tr>
                <td>UNet</td>
                <td>0.818</td>
                <td>0.746</td>
                <td>0.794</td>
                <td>0.858</td>
                <td>0.881</td>
                <td>0.055</td>
              </tr>
              <tr>
                <td>UNet++</td>
                <td>0.821</td>
                <td>0.743</td>
                <td>0.808</td>
                <td>0.862</td>
                <td>0.886</td>
                <td>0.048</td>
              </tr>
              <tr>
                <td>MSEG</td>
                <td>0.897</td>
                <td>0.839</td>
                <td>0.885</td>
                <td>0.912</td>
                <td>0.942</td>
                <td>0.028</td>
              </tr>
              <tr>
                <td>ASCNet</td>
                <td>0.898</td>
                <td>0.838</td>
                <td>0.882</td>
                <td>0.920</td>
                <td>0.941</td>
                <td>0.032</td>
              </tr>
              <tr>
                <td>PraNet</td>
                <td>0.898</td>
                <td>0.840</td>
                <td>0.885</td>
                <td>0.915</td>
                <td>0.944</td>
                <td>0.030</td>
              </tr>
              <tr>
                <td>SANet</td>
                <td>0.904</td>
                <td>0.847</td>
                <td>0.892</td>
                <td>0.915</td>
                <td>0.949</td>
                <td>0.027</td>
              </tr>
              <tr>
                <td>EU-Net</td>
                <td>0.908</td>
                <td>0.854</td>
                <td>0.893</td>
                <td>0.917</td>
                <td>0.951</td>
                <td>0.028</td>
              </tr>
              <tr>
                <td>VTANet</td>
                <td>0.921</td>
                <td>0.865</td>
                <td>0.912</td>
                <td>0.923</td>
                <td>0.956</td>
                <td>0.023</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 3.</bold>The segmentation results of the clinicdb dataset.</p>
        <table-wrap id="tbl3">
          <label>Table 3</label>
          <table>
            <tbody>
              <tr>
                <td>
                </td>
                <td>
                  <italic>mDice</italic>
                </td>
                <td>
                  <italic>
                    <bold>mIoU</bold>
                  </italic>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msubsup>
                          <mml:mi>F</mml:mi>
                          <mml:mi>β</mml:mi>
                          <mml:mi>w</mml:mi>
                        </mml:msubsup>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>S</mml:mi>
                          <mml:mi>α</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>m</mml:mi>
                        </mml:mstyle>
                        <mml:msub>
                          <mml:mi>E</mml:mi>
                          <mml:mi>ε</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <italic>MAE</italic>
                </td>
              </tr>
              <tr>
                <td>UNet</td>
                <td>0.823</td>
                <td>0.755</td>
                <td>0.811</td>
                <td>0.889</td>
                <td>0.913</td>
                <td>0.019</td>
              </tr>
              <tr>
                <td>UNet++</td>
                <td>0.794</td>
                <td>0.729</td>
                <td>0.785</td>
                <td>0.873</td>
                <td>0.891</td>
                <td>0.022</td>
              </tr>
              <tr>
                <td>MSEG</td>
                <td>0.909</td>
                <td>0.864</td>
                <td>0.907</td>
                <td>0.938</td>
                <td>0.961</td>
                <td>0.007</td>
              </tr>
              <tr>
                <td>ASCNet</td>
                <td>0.882</td>
                <td>0.826</td>
                <td>0.873</td>
                <td>0.927</td>
                <td>0.947</td>
                <td>0.011</td>
              </tr>
              <tr>
                <td>PraNet</td>
                <td>0.899</td>
                <td>0.849</td>
                <td>0.896</td>
                <td>0.936</td>
                <td>0.979</td>
                <td>0.009</td>
              </tr>
              <tr>
                <td>SANet</td>
                <td>0.912</td>
                <td>0.856</td>
                <td>0.907</td>
                <td>0.929</td>
                <td>0.968</td>
                <td>0.012</td>
              </tr>
              <tr>
                <td>EU-Net</td>
                <td>0.902</td>
                <td>0.846</td>
                <td>0.891</td>
                <td>0.936</td>
                <td>0.959</td>
                <td>0.011</td>
              </tr>
              <tr>
                <td>VTANet</td>
                <td>0.916</td>
                <td>0.867</td>
                <td>0.916</td>
                <td>0.943</td>
                <td>0.972</td>
                <td>0.010</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 4.</bold>The segmentation results of ColonDB dataset.</p>
        <table-wrap id="tbl4">
          <label>Table 4</label>
          <table>
            <tbody>
              <tr>
                <td>
                </td>
                <td>
                  <italic>mDice</italic>
                </td>
                <td>
                  <italic>
                    <bold>mIoU</bold>
                  </italic>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msubsup>
                          <mml:mi>F</mml:mi>
                          <mml:mi>β</mml:mi>
                          <mml:mi>w</mml:mi>
                        </mml:msubsup>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>S</mml:mi>
                          <mml:mi>α</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>m</mml:mi>
                        </mml:mstyle>
                        <mml:msub>
                          <mml:mi>E</mml:mi>
                          <mml:mi>ε</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <italic>MAE</italic>
                </td>
              </tr>
              <tr>
                <td>UNet</td>
                <td>0.512</td>
                <td>0.432</td>
                <td>0.498</td>
                <td>0.713</td>
                <td>0.696</td>
                <td>0.061</td>
              </tr>
              <tr>
                <td>UNet++</td>
                <td>0.483</td>
                <td>0.410</td>
                <td>0.467</td>
                <td>0.691</td>
                <td>0.680</td>
                <td>0.064</td>
              </tr>
              <tr>
                <td>MSEG</td>
                <td>0.735</td>
                <td>0.666</td>
                <td>0.724</td>
                <td>0.834</td>
                <td>0.859</td>
                <td>0.038</td>
              </tr>
              <tr>
                <td>ASCNet</td>
                <td>0.716</td>
                <td>0.649</td>
                <td>0.697</td>
                <td>0.829</td>
                <td>0.839</td>
                <td>0.039</td>
              </tr>
              <tr>
                <td>PraNet</td>
                <td>0.712</td>
                <td>0.640</td>
                <td>0.699</td>
                <td>0.820</td>
                <td>0.847</td>
                <td>0.043</td>
              </tr>
              <tr>
                <td>SANet</td>
                <td>0.753</td>
                <td>0.670</td>
                <td>0.726</td>
                <td>0.837</td>
                <td>0.869</td>
                <td>0.043</td>
              </tr>
              <tr>
                <td>EU-Net</td>
                <td>0.756</td>
                <td>0.681</td>
                <td>0.730</td>
                <td>0.831</td>
                <td>0.863</td>
                <td>0.045</td>
              </tr>
              <tr>
                <td>VTANet</td>
                <td>0.767</td>
                <td>0.694</td>
                <td>0.743</td>
                <td>0.856</td>
                <td>0.876</td>
                <td>0.041</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 5.</bold>The segmentation results of etis dataset.</p>
        <table-wrap id="tbl5">
          <label>Table 5</label>
          <table>
            <tbody>
              <tr>
                <td>
                </td>
                <td>
                  <italic>mDice</italic>
                </td>
                <td>
                  <italic>
                    <bold>mIoU</bold>
                  </italic>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msubsup>
                          <mml:mi>F</mml:mi>
                          <mml:mi>β</mml:mi>
                          <mml:mi>w</mml:mi>
                        </mml:msubsup>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>S</mml:mi>
                          <mml:mi>α</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>m</mml:mi>
                        </mml:mstyle>
                        <mml:msub>
                          <mml:mi>E</mml:mi>
                          <mml:mi>ε</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <italic>MAE</italic>
                </td>
              </tr>
              <tr>
                <td>UNet</td>
                <td>0.398</td>
                <td>0.335</td>
                <td>0.366</td>
                <td>0.684</td>
                <td>0.643</td>
                <td>0.036</td>
              </tr>
              <tr>
                <td>UNet++</td>
                <td>0.401</td>
                <td>0.344</td>
                <td>0.390</td>
                <td>0.683</td>
                <td>0.629</td>
                <td>0.035</td>
              </tr>
              <tr>
                <td>MSEG</td>
                <td>0.700</td>
                <td>0.630</td>
                <td>0.671</td>
                <td>0.828</td>
                <td>0.854</td>
                <td>0.015</td>
              </tr>
              <tr>
                <td>ASCNet</td>
                <td>0.578</td>
                <td>0.509</td>
                <td>0.530</td>
                <td>0.754</td>
                <td>0.737</td>
                <td>0.059</td>
              </tr>
              <tr>
                <td>PraNet</td>
                <td>0.628</td>
                <td>0.567</td>
                <td>0.600</td>
                <td>0.794</td>
                <td>0.808</td>
                <td>0.031</td>
              </tr>
              <tr>
                <td>SANet</td>
                <td>0.687</td>
                <td>0.609</td>
                <td>0.636</td>
                <td>0.793</td>
                <td>0.807</td>
                <td>0.067</td>
              </tr>
              <tr>
                <td>EU-Net</td>
                <td>0.750</td>
                <td>0.654</td>
                <td>0.685</td>
                <td>0.849</td>
                <td>0.881</td>
                <td>0.015</td>
              </tr>
              <tr>
                <td>VTANet</td>
                <td>0.763</td>
                <td>0.669</td>
                <td>0.693</td>
                <td>0.855</td>
                <td>0.884</td>
                <td>0.038</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 6.</bold>The ablation results of the etis dataset.</p>
        <table-wrap id="tbl6">
          <label>Table 6</label>
          <table>
            <tbody>
              <tr>
                <td>
                </td>
                <td>
                  <italic>mDice</italic>
                </td>
                <td>
                  <italic>
                    <bold>mIoU</bold>
                  </italic>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msubsup>
                          <mml:mi>F</mml:mi>
                          <mml:mi>β</mml:mi>
                          <mml:mi>w</mml:mi>
                        </mml:msubsup>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>S</mml:mi>
                          <mml:mi>α</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>m</mml:mi>
                        </mml:mstyle>
                        <mml:msub>
                          <mml:mi>E</mml:mi>
                          <mml:mi>ε</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <italic>MAE</italic>
                </td>
              </tr>
              <tr>
                <td>PVT</td>
                <td>0.712</td>
                <td>0.623</td>
                <td>0.609</td>
                <td>0.821</td>
                <td>0.807</td>
                <td>0.046</td>
              </tr>
              <tr>
                <td>PVT + AAFM</td>
                <td>0.734</td>
                <td>0.624</td>
                <td>0.687</td>
                <td>0.839</td>
                <td>0.834</td>
                <td>0.038</td>
              </tr>
              <tr>
                <td>PVT + FAM</td>
                <td>0.754</td>
                <td>0.604</td>
                <td>0.652</td>
                <td>0.824</td>
                <td>0.848</td>
                <td>0.049</td>
              </tr>
              <tr>
                <td>PVT + ASM</td>
                <td>0.715</td>
                <td>0.657</td>
                <td>0.625</td>
                <td>0.823</td>
                <td>0.839</td>
                <td>0.043</td>
              </tr>
              <tr>
                <td>VTANet</td>
                <td>0.763</td>
                <td>0.669</td>
                <td>0.693</td>
                <td>0.855</td>
                <td>0.884</td>
                <td>0.038</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><xref ref-type="fig" rid="fig5">Figure 5</xref> and <xref ref-type="fig" rid="fig6">Figure 6</xref> show the visualization results of different segmentation methods on the two datasets, ClinicDB and ColonDB. <xref ref-type="fig" rid="fig7">Figure 7</xref> shows the visualization results of different segmentation methods on the other datasets, Kvasir-seg and ENDOSCENE. From left to right, the segmentation results are obtained by UNet, UNet++, MSEG, ASCNet, PraNet, SANet, EU-Net, and the proposed model, respectively. The red curve is the boundary of the actual value of the lesion ground [<xref ref-type="bibr" rid="B32">32</xref>][<xref ref-type="bibr" rid="B33">33</xref>]. It can be seen from <xref ref-type="fig" rid="fig4">Figure 4</xref> and <xref ref-type="fig" rid="fig5">Figure 5</xref> that compared with other segmentation results, the proposed method pays more attention to the lesion area than UNet and UNet++, suppresses the unimportant feature area, and the segmentation result is more accurate than UNet. With little difference between the color pixels of the lesion area and the color pixels of the background area, the model can pay more attention to the trim edges than PraNet. In general, VTANet not only effectively alleviates the disturbance of tumor size, surrounding tissues, and cascades but also obtains segmentation results closer to the real ground mask. The comprehensive evaluation and visual effects show that the proposed method achieves better segmentation results with less missed and false detection in polyp lesion segmentation.</p>
        <fig id="fig5">
          <label>Figure 5</label>
          <graphic xlink:href="https://html.scirp.org/file/1733572-rId147.jpeg?20260623112850" />
        </fig>
        <p><bold>Figure 5.</bold> The visual comparison of the proposed model and the state-of-the-art methods on ClinicDB.</p>
        <fig id="fig6">
          <label>Figure 6</label>
          <graphic xlink:href="https://html.scirp.org/file/1733572-rId148.jpeg?20260623112850" />
        </fig>
        <p><bold>Figure 6.</bold>The visual comparison of the proposed model and the state-of-the-art methods on ColonDB.</p>
        <fig id="fig7">
          <label>Figure 7</label>
          <graphic xlink:href="https://html.scirp.org/file/1733572-rId149.jpeg?20260623112850" />
        </fig>
        <p><bold>Figure 7.</bold> The visual comparison of the proposed model and the state-of-the-art methods on Kvasir-seg, Endoscene, and ETIS. </p>
        <p>To verify the generalization ability of the proposed model, three polyp segmentation datasets, including ETIS, ColonDB, and EndoScene, are used for testing. There are 196 images in ETIS, 380 in ColonDB, and 60 in Endoscene, respectively. It can be seen from <bold>Table 1</bold>, <bold>Tables 4-5</bold> that the mDice score on the ColonDB dataset is 2.55% higher than that of the UNet model. The mIoU score on the ETIS dataset is 2.74% higher than that of the U-Net model. The score on the Endoscene dataset is 2.55% higher than that of the UNet model [<xref ref-type="bibr" rid="B34">34</xref>]-[<xref ref-type="bibr" rid="B37">37</xref>]. The results show that the proposed model has strong generalization ability. </p>
        <p>Finally, the effectiveness of each component in the overall model is described in detail, and the settings for training, testing, and hyperparameters are consistent with the previous ones. We use PVTv2 as a baseline and verify the performance of the proposed model by removing modules from the proposed model. The experimental results of different modules in <bold>Table 6</bold> show that these modules have played a role in improving network performance. It can be seen from<bold>Table 6</bold> that after the introduction of the FAM module, the mDice score is 0.42% higher than that of the original basic PVTv2 network. The introduction of the AAFM module also improves the performance of the original PVT network [<xref ref-type="bibr" rid="B38">38</xref>][<xref ref-type="bibr" rid="B39">39</xref>]. The ablation results show that each module contributes to VTANet from different perspectives, but the improvement is not uniform across all metrics. Compared with the PVT baseline, AAFM improves mDice and weighted F-measure, indicating that BAM-based channel-spatial attention is helpful for enhancing low-level texture and boundary-related features. However, its limited improvement in mIoU suggests that low-level attention alone is insufficient to fully improve region-level consistency. FAM increases mDice by aggregating high-level semantic features, which helps locate polyp regions more accurately, but the decrease in mIoU and MAE indicates that feature aggregation alone may also introduce coarse responses or redundant semantic information. ASM brings a more obvious improvement in mIoU, suggesting that similarity-based interaction between low-level details and high-level semantics helps refine the global structure of the predicted region. The full VTANet achieves the best overall balance among mDice, mIoU, S-measure, and E-measure, demonstrating that these modules are complementary rather than independently optimal. </p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Conclusions</title>
      <p>Although VTANet achieves competitive results on five public polyp datasets, several limitations remain. First, the model may still fail when polyps have extremely low contrast, very small size, severe motion blur, specular reflection, or ambiguous boundaries close to the surrounding mucosa. Second, the training and testing datasets are all public benchmark datasets, and the generalization ability of VTANet on multi-center clinical data, different endoscopy devices, and real-time video sequences still needs further validation. Third, the combination of PVTv2, FAM, AAFM, and ASM improves segmentation accuracy but also increases model complexity compared with simpler CNN-based models. Therefore, there is still a practical trade-off between segmentation accuracy and computational efficiency. Future work will focus on lightweight deployment, external clinical validation, and real-time video polyp segmentation. </p>
      <p>Experimental results on five public datasets show that VTANet achieves competitive performance compared with several established segmentation models. The improvement is especially evident in mDice and mIoU, while some metrics on specific datasets remain slightly lower than those of the best competing methods. These results suggest that the proposed feature aggregation and attention fusion strategy is effective, but further optimization is still needed for all-metric superiority. </p>
    </sec>
    <sec id="sec5">
      <title>Acknowledgements</title>
      <p>This study was supported by project ZR2021MF017 supported by the Shandong Provincial Natural Science Foundation; project ZR2020MF147 supported by the Shandong Provincial Natural Science Foundation; and the National Natural Science Foundation of China (62273155).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Shi, J.-H., Zhang, Q., Tang, Y.-H. and Zhang, Z.-Q. (2022) Polyp-Mixer: An Efficient Context-Aware MLP-Based Paradigm for Polyp Segmentation. <italic>IEEE</italic><italic>Transactions</italic><italic>on</italic><italic>Circuits</italic><italic>and</italic><italic>Systems</italic><italic>for</italic><italic>Video</italic><italic>Technology</italic>, 33, 30-42. https://doi.org/10.1109/tcsvt.2022.3197643 <pub-id pub-id-type="doi">10.1109/tcsvt.2022.3197643</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tcsvt.2022.3197643">https://doi.org/10.1109/tcsvt.2022.3197643</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Shi, J.</string-name>
              <string-name>Zhang, Q.</string-name>
              <string-name>Tang, Y.</string-name>
              <string-name>Zhang, Z.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Polyp-Mixer: An Efficient Context-Aware MLP-Based Paradigm for Polyp Segmentation</article-title>
            <source>IEEE Transactions on Circuits and Systems for Video Technology</source>
            <volume>33</volume>
            <pub-id pub-id-type="doi">10.1109/tcsvt.2022.3197643</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Yu, T. and Wu, Q. (2023) HarDNet-CPS: Colorectal Polyp Segmentation Based on Harmonic Densely United Network. <italic>Biomedical</italic><italic>Signal</italic><italic>Processing</italic><italic>and</italic><italic>Control</italic>, 85, Article 104953. https://doi.org/10.1016/j.bspc.2023.104953 <pub-id pub-id-type="doi">10.1016/j.bspc.2023.104953</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.bspc.2023.104953">https://doi.org/10.1016/j.bspc.2023.104953</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Yu, T.</string-name>
              <string-name>Wu, Q.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>HarDNet-CPS: Colorectal Polyp Segmentation Based on Harmonic Densely United Network</article-title>
            <source>Biomedical Signal Processing and Control</source>
            <volume>85</volume>
            <elocation-id>104953</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.bspc.2023.104953</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Mamonov, A.V., Figueiredo, I.N., Figueiredo, P.N. and Richard Tsai, Y. (2014) Automated Polyp Detection in Colon Capsule Endoscopy. <italic>IEEE</italic><italic>Transactions</italic><italic>on</italic><italic>Medical</italic><italic>Imaging</italic>, 33, 1488-1502. https://doi.org/10.1109/tmi.2014.2314959 <pub-id pub-id-type="doi">10.1109/tmi.2014.2314959</pub-id><pub-id pub-id-type="pmid">24710829</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tmi.2014.2314959">https://doi.org/10.1109/tmi.2014.2314959</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Mamonov, A.V.</string-name>
              <string-name>Figueiredo, I.N.</string-name>
              <string-name>Figueiredo, P.N.</string-name>
              <string-name>Tsai, Y.</string-name>
            </person-group>
            <year>2014</year>
            <article-title>Automated Polyp Detection in Colon Capsule Endoscopy</article-title>
            <source>IEEE Transactions on Medical Imaging</source>
            <volume>33</volume>
            <pub-id pub-id-type="doi">10.1109/tmi.2014.2314959</pub-id>
            <pub-id pub-id-type="pmid">24710829</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Bernal, J., Sánchez, F.J., Fernández-Esparrach, G., Gil, D., Rodríguez, C. and Vilariño, F. (2015) WM-DOVA Maps for Accurate Polyp Highlighting in Colonoscopy: Validation Vs. Saliency Maps from Physicians. <italic>Computerized</italic><italic>Medical</italic><italic>Imaging</italic><italic>and</italic><italic>Graphics</italic>, 43, 99-111. https://doi.org/10.1016/j.compmedimag.2015.02.007 <pub-id pub-id-type="doi">10.1016/j.compmedimag.2015.02.007</pub-id><pub-id pub-id-type="pmid">25863519</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.compmedimag.2015.02.007">https://doi.org/10.1016/j.compmedimag.2015.02.007</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Bernal, J.</string-name>
              <string-name>Esparrach, G.</string-name>
              <string-name>Gil, D.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>WM-DOVA Maps for Accurate Polyp Highlighting in Colonoscopy: Validation Vs</article-title>
            <source>Saliency Maps from Physicians. Computerized Medical Imaging and Graphics</source>
            <volume>43</volume>
            <pub-id pub-id-type="doi">10.1016/j.compmedimag.2015.02.007</pub-id>
            <pub-id pub-id-type="pmid">25863519</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Sasmal, P., Iwahori, Y., Bhuyan, M.K. and Kasugai, K. (2018) Active Contour Segmentation of Polyps in Capsule Endoscopic Images. 2018 <italic>International Conference on Signals and Systems</italic> ( <italic>ICSigSys</italic>), Bali, 1-3 May 2018, 201-204. https://doi.org/10.1109/icsigsys.2018.8372666 <pub-id pub-id-type="doi">10.1109/icsigsys.2018.8372666</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/icsigsys.2018.8372666">https://doi.org/10.1109/icsigsys.2018.8372666</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Sasmal, P.</string-name>
              <string-name>Iwahori, Y.</string-name>
              <string-name>Bhuyan, M.K.</string-name>
              <string-name>Kasugai, K.</string-name>
            </person-group>
            <year>2018</year>
            <article-title>Active Contour Segmentation of Polyps in Capsule Endoscopic Images</article-title>
            <source>2018 International Conference on Signals and Systems (ICSigSys)</source>
            <volume>1</volume>
            <pub-id pub-id-type="doi">10.1109/icsigsys.2018.8372666</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Long, J., Shelhamer, E. and Darrell, T. (2015) Fully Convolutional Networks for Semantic Segmentation. 2015 <italic>IEEE Conference on Computer Vision and Pattern Recognition</italic> ( <italic>CVPR</italic>), Boston, 7-12 June 2015, 3431-3440. https://doi.org/10.1109/cvpr.2015.7298965 <pub-id pub-id-type="doi">10.1109/cvpr.2015.7298965</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/cvpr.2015.7298965">https://doi.org/10.1109/cvpr.2015.7298965</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Long, J.</string-name>
              <string-name>Shelhamer, E.</string-name>
              <string-name>Darrell, T.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Fully Convolutional Networks for Semantic Segmentation</article-title>
            <source>2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</source>
            <volume>7</volume>
            <pub-id pub-id-type="doi">10.1109/cvpr.2015.7298965</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Ronneberger, O., Fischer, P. and Brox, T. (2015) U-net: Convolutional Networks for Biomedical Image Segmentation. In: Navab, N., Hornegger, J., Wells, W. and Frangi, A., Eds., <italic>Lecture</italic><italic>Notes</italic><italic>in</italic><italic>Computer</italic><italic>Science</italic>, Springer International Publishing, 234-241. https://doi.org/10.1007/978-3-319-24574-4_28 <pub-id pub-id-type="doi">10.1007/978-3-319-24574-4_28</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-319-24574-4_28">https://doi.org/10.1007/978-3-319-24574-4_28</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Ronneberger, O.</string-name>
              <string-name>Fischer, P.</string-name>
              <string-name>Brox, T.</string-name>
              <string-name>Navab, N.</string-name>
              <string-name>Hornegger, J.</string-name>
              <string-name>Wells, W.</string-name>
              <string-name>Frangi, A.</string-name>
              <string-name>Science, S</string-name>
            </person-group>
            <year>2015</year>
            <article-title>U-net: Convolutional Networks for Biomedical Image Segmentation</article-title>
            <source>In: Navab</source>
            <volume>234</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-319-24574-4_28</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zhang, Z., Liu, Q. and Wang, Y. (2018) Road Extraction by Deep Residual U-Net. <italic>IEEE</italic><italic>Geoscience</italic><italic>and</italic><italic>Remote</italic><italic>Sensing</italic><italic>Letters</italic>, 15, 749-753. https://doi.org/10.1109/lgrs.2018.2802944 <pub-id pub-id-type="doi">10.1109/lgrs.2018.2802944</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/lgrs.2018.2802944">https://doi.org/10.1109/lgrs.2018.2802944</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zhang, Z.</string-name>
              <string-name>Liu, Q.</string-name>
              <string-name>Wang, Y.</string-name>
            </person-group>
            <year>2018</year>
            <article-title>Road Extraction by Deep Residual U-Net</article-title>
            <source>IEEE Geoscience and Remote Sensing Letters</source>
            <volume>15</volume>
            <pub-id pub-id-type="doi">10.1109/lgrs.2018.2802944</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zhou, Z., Siddiquee, M.M.R., Tajbakhsh, N. and Liang, J. (2020) UNet++: Redesigning Skip Connections to Exploit Multiscale Features in Image Segmentation. <italic>IEEE</italic><italic>Transactions</italic><italic>on</italic><italic>Medical</italic><italic>Imaging</italic>, 39, 1856-1867. https://doi.org/10.1109/tmi.2019.2959609 <pub-id pub-id-type="doi">10.1109/tmi.2019.2959609</pub-id><pub-id pub-id-type="pmid">31841402</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tmi.2019.2959609">https://doi.org/10.1109/tmi.2019.2959609</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zhou, Z.</string-name>
              <string-name>Siddiquee, M.M.R.</string-name>
              <string-name>Tajbakhsh, N.</string-name>
              <string-name>Liang, J.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>UNet++: Redesigning Skip Connections to Exploit Multiscale Features in Image Segmentation</article-title>
            <source>IEEE Transactions on Medical Imaging</source>
            <volume>39</volume>
            <pub-id pub-id-type="doi">10.1109/tmi.2019.2959609</pub-id>
            <pub-id pub-id-type="pmid">31841402</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Fan, D., Ji, G., Zhou, T., Chen, G., Fu, H., Shen, J., <italic>et al</italic>. (2020) PraNet: Parallel Reverse Attention Network for Polyp Segmentation. In: Martel, A.L., <italic>et al</italic>., Eds., <italic>Lecture</italic><italic>Notes</italic><italic>in</italic><italic>Computer</italic><italic>Science</italic>, Springer International Publishing, 263-273. https://doi.org/10.1007/978-3-030-59725-2_26 <pub-id pub-id-type="doi">10.1007/978-3-030-59725-2_26</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-030-59725-2_26">https://doi.org/10.1007/978-3-030-59725-2_26</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Fan, D.</string-name>
              <string-name>Ji, G.</string-name>
              <string-name>Zhou, T.</string-name>
              <string-name>Chen, G.</string-name>
              <string-name>Fu, H.</string-name>
              <string-name>Shen, J.</string-name>
              <string-name>Martel, A.L.</string-name>
              <string-name>Science, S</string-name>
            </person-group>
            <year>2020</year>
            <article-title>PraNet: Parallel Reverse Attention Network for Polyp Segmentation</article-title>
            <source>In: Martel</source>
            <volume>263</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-030-59725-2_26</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Jha, D., Riegler, M.A., Johansen, D., Halvorsen, P. and Johansen, H.D. (2020) DoubleU-Net: A Deep Convolutional Neural Network for Medical Image Segmentation. 2020 <italic>IEEE</italic>33 <italic>rd International Symposium on Computer-Based Medical Systems</italic>(CBMS), Rochester, 28-30 July 2020, 558-564. https://doi.org/10.1109/cbms49503.2020.00111 <pub-id pub-id-type="doi">10.1109/cbms49503.2020.00111</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/cbms49503.2020.00111">https://doi.org/10.1109/cbms49503.2020.00111</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Jha, D.</string-name>
              <string-name>Riegler, M.A.</string-name>
              <string-name>Johansen, D.</string-name>
              <string-name>Halvorsen, P.</string-name>
              <string-name>Johansen, H.D.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>DoubleU-Net: A Deep Convolutional Neural Network for Medical Image Segmentation</article-title>
            <source>2020 IEEE 33rd International Symposium on Computer-Based Medical Systems (CBMS)</source>
            <volume>28</volume>
            <pub-id pub-id-type="doi">10.1109/cbms49503.2020.00111</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Wang, W., Xie, E., Li, X., Fan, D., Song, K., Liang, D., <italic>et al</italic>. (2021) Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutions. 2021 <italic>IEEE</italic>/ <italic>CVF International Conference on Computer Vision</italic>( <italic>ICCV</italic>), Montreal, 10-17 October 2021, 568-578. https://doi.org/10.1109/iccv48922.2021.00061 <pub-id pub-id-type="doi">10.1109/iccv48922.2021.00061</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/iccv48922.2021.00061">https://doi.org/10.1109/iccv48922.2021.00061</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Wang, W.</string-name>
              <string-name>Xie, E.</string-name>
              <string-name>Li, X.</string-name>
              <string-name>Fan, D.</string-name>
              <string-name>Song, K.</string-name>
              <string-name>Liang, D.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutions</article-title>
            <source>2021 IEEE/CVF International Conference on Computer Vision (ICCV)</source>
            <volume>10</volume>
            <pub-id pub-id-type="doi">10.1109/iccv48922.2021.00061</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Gan, C., Li, Y., Li, H., Sun, C. and Gong, B. (2017) VQS: Linking Segmentations to Questions and Answers for Supervised Attention in VQA and Question-Focused Semantic Segmentation. 2017 <italic>IEEE International Conference on Computer Vision</italic> ( <italic>ICCV</italic>), Venice, 22-29 October 2017, 1811-1820. https://doi.org/10.1109/iccv.2017.201 <pub-id pub-id-type="doi">10.1109/iccv.2017.201</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/iccv.2017.201">https://doi.org/10.1109/iccv.2017.201</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Gan, C.</string-name>
              <string-name>Li, Y.</string-name>
              <string-name>Li, H.</string-name>
              <string-name>Sun, C.</string-name>
              <string-name>Gong, B.</string-name>
            </person-group>
            <year>2017</year>
            <article-title>VQS: Linking Segmentations to Questions and Answers for Supervised Attention in VQA and Question-Focused Semantic Segmentation</article-title>
            <source>2017 IEEE International Conference on Computer Vision (ICCV)</source>
            <volume>22</volume>
            <pub-id pub-id-type="doi">10.1109/iccv.2017.201</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Ioffe, S. and Szegedy, C. (2015) Batch normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift. <italic>Proceedings of the</italic>32 <italic>nd International Confe</italic><italic>rence on Machine Learning</italic>, Lille, 6-11 July 2015, 448-456.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Ioffe, S.</string-name>
              <string-name>Szegedy, C.</string-name>
              <string-name>Learning, L</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Batch normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift</article-title>
            <source>Proceedings of the 32nd International Conference on Machine Learning</source>
            <volume>6</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Glorot, X., Bordes, A. and Bengio, Y. (2011) Deep Sparse Rectifier Neural Networks. <italic>Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics</italic>, 15, 315-323.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Glorot, X.</string-name>
              <string-name>Bordes, A.</string-name>
              <string-name>Bengio, Y.</string-name>
            </person-group>
            <year>2011</year>
            <article-title>Deep Sparse Rectifier Neural Networks</article-title>
            <source>Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics</source>
            <volume>15</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Park, J., Woo, S., Lee, J.-Y. and Kweon, I.S. (2018) Bam: Bottleneck Attention Module. arXiv:1807.06514.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Park, J.</string-name>
              <string-name>Woo, S.</string-name>
              <string-name>Lee, J.</string-name>
              <string-name>Kweon, I.S.</string-name>
            </person-group>
            <year>2018</year>
            <article-title>Bam: Bottleneck Attention Module</article-title>
            <fpage>1807</fpage>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Su, Y., Cheng, J., Zhong, C., Zhang, Y., Ye, J., He, J., <italic>et al</italic>. (2023) FeDNet: Feature Decoupled Network for Polyp Segmentation from Endoscopy Images. <italic>Biomedical</italic><italic>Signal</italic><italic>Processing</italic><italic>and</italic><italic>Control</italic>, 83, Article 104699. https://doi.org/10.1016/j.bspc.2023.104699 <pub-id pub-id-type="doi">10.1016/j.bspc.2023.104699</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.bspc.2023.104699">https://doi.org/10.1016/j.bspc.2023.104699</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Su, Y.</string-name>
              <string-name>Cheng, J.</string-name>
              <string-name>Zhong, C.</string-name>
              <string-name>Zhang, Y.</string-name>
              <string-name>Ye, J.</string-name>
              <string-name>He, J.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>FeDNet: Feature Decoupled Network for Polyp Segmentation from Endoscopy Images</article-title>
            <source>Biomedical Signal Processing and Control</source>
            <volume>83</volume>
            <elocation-id>104699</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.bspc.2023.104699</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Jha, D., Smedsrud, P.H., Riegler, M.A., Halvorsen, P., de Lange, T., Johansen, D., <italic>et al</italic>. (2019) Kvasir-SEG: A Segmented Polyp Dataset. In: Ro, Y., <italic>et al</italic>., Eds., <italic>Lecture</italic><italic>Notes</italic><italic>in</italic><italic>Computer</italic><italic>Science</italic>, Springer International Publishing, 451-462. https://doi.org/10.1007/978-3-030-37734-2_37 <pub-id pub-id-type="doi">10.1007/978-3-030-37734-2_37</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-030-37734-2_37">https://doi.org/10.1007/978-3-030-37734-2_37</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Jha, D.</string-name>
              <string-name>Smedsrud, P.H.</string-name>
              <string-name>Riegler, M.A.</string-name>
              <string-name>Halvorsen, P.</string-name>
              <string-name>Lange, T.</string-name>
              <string-name>Johansen, D.</string-name>
              <string-name>Ro, Y.</string-name>
              <string-name>Science, S</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Kvasir-SEG: A Segmented Polyp Dataset</article-title>
            <source>In: Ro</source>
            <volume>451</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-030-37734-2_37</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Sharma, P., Gautam, A., Maji, P., Pachori, R.B. and Balabantaray, B.K. (2023) Li-segpnet: Encoder-Decoder Mode Lightweight Segmentation Network for Colorectal Polyps Analysis. <italic>IEEE</italic><italic>Transactions</italic><italic>on</italic><italic>Biomedical</italic><italic>Engineering</italic>, 70, 1330-1339. https://doi.org/10.1109/tbme.2022.3216269 <pub-id pub-id-type="doi">10.1109/tbme.2022.3216269</pub-id><pub-id pub-id-type="pmid">36269902</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tbme.2022.3216269">https://doi.org/10.1109/tbme.2022.3216269</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Sharma, P.</string-name>
              <string-name>Gautam, A.</string-name>
              <string-name>Maji, P.</string-name>
              <string-name>Pachori, R.B.</string-name>
              <string-name>Balabantaray, B.K.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Li-segpnet: Encoder-Decoder Mode Lightweight Segmentation Network for Colorectal Polyps Analysis</article-title>
            <source>IEEE Transactions on Biomedical Engineering</source>
            <volume>70</volume>
            <pub-id pub-id-type="doi">10.1109/tbme.2022.3216269</pub-id>
            <pub-id pub-id-type="pmid">36269902</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B20">
        <label>20.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Tajbakhsh, N., Gurudu, S.R. and Liang, J. (2016) Automated Polyp Detection in Colonoscopy Videos Using Shape and Context Information. <italic>IEEE</italic><italic>Transactions</italic><italic>on</italic><italic>Medical</italic><italic>Imaging</italic>, 35, 630-644. https://doi.org/10.1109/tmi.2015.2487997 <pub-id pub-id-type="doi">10.1109/tmi.2015.2487997</pub-id><pub-id pub-id-type="pmid">26462083</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tmi.2015.2487997">https://doi.org/10.1109/tmi.2015.2487997</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Tajbakhsh, N.</string-name>
              <string-name>Gurudu, S.R.</string-name>
              <string-name>Liang, J.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>Automated Polyp Detection in Colonoscopy Videos Using Shape and Context Information</article-title>
            <source>IEEE Transactions on Medical Imaging</source>
            <volume>35</volume>
            <pub-id pub-id-type="doi">10.1109/tmi.2015.2487997</pub-id>
            <pub-id pub-id-type="pmid">26462083</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B21">
        <label>21.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Vázquez, D., Bernal, J., Sánchez, F.J., Fernández-Esparrach, G., López, A.M., Romero, A., <italic>et al</italic>. (2017) A Benchmark for Endoluminal Scene Segmentation of Colonoscopy Images. <italic>Journal</italic><italic>of</italic><italic>Healthcare</italic><italic>Engineering</italic>, 2017, 1-9. https://doi.org/10.1155/2017/4037190 <pub-id pub-id-type="doi">10.1155/2017/4037190</pub-id><pub-id pub-id-type="pmid">29065595</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1155/2017/4037190">https://doi.org/10.1155/2017/4037190</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Bernal, J.</string-name>
              <string-name>Esparrach, G.</string-name>
              <string-name>Romero, A.</string-name>
            </person-group>
            <year>2017</year>
            <article-title>A Benchmark for Endoluminal Scene Segmentation of Colonoscopy Images</article-title>
            <source>Journal of Healthcare Engineering</source>
            <volume>2017</volume>
            <pub-id pub-id-type="doi">10.1155/2017/4037190</pub-id>
            <pub-id pub-id-type="pmid">29065595</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B22">
        <label>22.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Silva, J., Histace, A., Romain, O., Dray, X. and Granado, B. (2013) Toward Embedded Detection of Polyps in WCE Images for Early Diagnosis of Colorectal Cancer. <italic>International</italic><italic>Journal</italic><italic>of</italic><italic>Computer</italic><italic>Assisted</italic><italic>Radiology</italic><italic>and</italic><italic>Surgery</italic>, 9, 283-293. https://doi.org/10.1007/s11548-013-0926-3 <pub-id pub-id-type="doi">10.1007/s11548-013-0926-3</pub-id><pub-id pub-id-type="pmid">24037504</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s11548-013-0926-3">https://doi.org/10.1007/s11548-013-0926-3</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Silva, J.</string-name>
              <string-name>Histace, A.</string-name>
              <string-name>Romain, O.</string-name>
              <string-name>Dray, X.</string-name>
              <string-name>Granado, B.</string-name>
            </person-group>
            <year>2013</year>
            <article-title>Toward Embedded Detection of Polyps in WCE Images for Early Diagnosis of Colorectal Cancer</article-title>
            <source>International Journal of Computer Assisted Radiology and Surgery</source>
            <volume>9</volume>
            <pub-id pub-id-type="doi">10.1007/s11548-013-0926-3</pub-id>
            <pub-id pub-id-type="pmid">24037504</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B23">
        <label>23.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wang, W., Xie, E., Li, X., Fan, D., Song, K., Liang, D., <italic>et al</italic>. (2022) PVT V2: Improved Baselines with Pyramid Vision Transformer. <italic>Computational</italic><italic>Visual</italic><italic>Media</italic>, 8, 415-424. https://doi.org/10.1007/s41095-022-0274-8 <pub-id pub-id-type="doi">10.1007/s41095-022-0274-8</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s41095-022-0274-8">https://doi.org/10.1007/s41095-022-0274-8</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wang, W.</string-name>
              <string-name>Xie, E.</string-name>
              <string-name>Li, X.</string-name>
              <string-name>Fan, D.</string-name>
              <string-name>Song, K.</string-name>
              <string-name>Liang, D.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>PVT V2: Improved Baselines with Pyramid Vision Transformer</article-title>
            <source>Computational Visual Media</source>
            <volume>8</volume>
            <pub-id pub-id-type="doi">10.1007/s41095-022-0274-8</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B24">
        <label>24.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Liu, Z., Lin, Y., Cao, Y., Hu, H., Wei, Y., Zhang, Z., <italic>et al</italic>. (2021) Swin Transformer: Hierarchical Vision Transformer Using Shifted Windows. 2021 <italic>IEEE</italic>/ <italic>CVF International Conference on Computer Vision</italic>( <italic>ICCV</italic>), Montreal, 10-17 October 2021, 10012-10022. https://doi.org/10.1109/iccv48922.2021.00986 <pub-id pub-id-type="doi">10.1109/iccv48922.2021.00986</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/iccv48922.2021.00986">https://doi.org/10.1109/iccv48922.2021.00986</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Liu, Z.</string-name>
              <string-name>Lin, Y.</string-name>
              <string-name>Cao, Y.</string-name>
              <string-name>Hu, H.</string-name>
              <string-name>Wei, Y.</string-name>
              <string-name>Zhang, Z.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Swin Transformer: Hierarchical Vision Transformer Using Shifted Windows</article-title>
            <source>2021 IEEE/CVF International Conference on Computer Vision (ICCV)</source>
            <volume>10</volume>
            <pub-id pub-id-type="doi">10.1109/iccv48922.2021.00986</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B25">
        <label>25.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Milletari, F., Navab, N. and Ahmadi, S. (2016) V-Net: Fully Convolutional Neural Networks for Volumetric Medical Image Segmentation. 2016 <italic>Fourth International Conference on</italic>3 <italic>D Vision</italic>(3 <italic>DV</italic>), Stanford, 25-28 October 2016, 565-571. https://doi.org/10.1109/3dv.2016.79 <pub-id pub-id-type="doi">10.1109/3dv.2016.79</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/3dv.2016.79">https://doi.org/10.1109/3dv.2016.79</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Milletari, F.</string-name>
              <string-name>Navab, N.</string-name>
              <string-name>Ahmadi, S.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>V-Net: Fully Convolutional Neural Networks for Volumetric Medical Image Segmentation</article-title>
            <source>2016 Fourth International Conference on 3D Vision (3DV)</source>
            <volume>25</volume>
            <pub-id pub-id-type="doi">10.1109/3dv.2016.79</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B26">
        <label>26.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Fan, D., Cheng, M., Liu, Y., Li, T. and Borji, A. (2017) Structure-Measure: A New Way to Evaluate Foreground Maps. 2017 <italic>IEEE International Conference on Computer Vision</italic> ( <italic>ICCV</italic>), Venice, 22-29 October 2017, 4548-4557. https://doi.org/10.1109/iccv.2017.487 <pub-id pub-id-type="doi">10.1109/iccv.2017.487</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/iccv.2017.487">https://doi.org/10.1109/iccv.2017.487</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Fan, D.</string-name>
              <string-name>Cheng, M.</string-name>
              <string-name>Liu, Y.</string-name>
              <string-name>Li, T.</string-name>
              <string-name>Borji, A.</string-name>
            </person-group>
            <year>2017</year>
            <article-title>Structure-Measure: A New Way to Evaluate Foreground Maps</article-title>
            <source>2017 IEEE International Conference on Computer Vision (ICCV)</source>
            <volume>22</volume>
            <pub-id pub-id-type="doi">10.1109/iccv.2017.487</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B27">
        <label>27.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wang, K., Liu, L., Fu, X., Liu, L. and Peng, W. (2023) RA-DENet: Reverse Attention and Distractions Elimination Network for Polyp Segmentation. <italic>Computers</italic><italic>in</italic><italic>Biology</italic><italic>and</italic><italic>Medicine</italic>, 155, Article 106704. https://doi.org/10.1016/j.compbiomed.2023.106704 <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.106704</pub-id><pub-id pub-id-type="pmid">36848801</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.compbiomed.2023.106704">https://doi.org/10.1016/j.compbiomed.2023.106704</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wang, K.</string-name>
              <string-name>Liu, L.</string-name>
              <string-name>Fu, X.</string-name>
              <string-name>Liu, L.</string-name>
              <string-name>Peng, W.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>RA-DENet: Reverse Attention and Distractions Elimination Network for Polyp Segmentation</article-title>
            <source>Computers in Biology and Medicine</source>
            <volume>155</volume>
            <elocation-id>106704</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.106704</pub-id>
            <pub-id pub-id-type="pmid">36848801</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B28">
        <label>28.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Huang, C.-H., Wu, H.-Y. and Lin, Y.-L. (2021) HarDNet-MSEG: A Simple Encoder-Decoder Polyp Segmentation Neural Network that Achieves over 0.9 Mean Dice and 86 FPS. arXiv:2101.07172.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Huang, C.</string-name>
              <string-name>Wu, H.</string-name>
              <string-name>Lin, Y.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>HarDNet-MSEG: A Simple Encoder-Decoder Polyp Segmentation Neural Network that Achieves over 0</article-title>
            <fpage>2101</fpage>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B29">
        <label>29.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wang, W., Lai, Q., Fu, H., Shen, J., Ling, H. and Yang, R. (2022) Salient Object Detection in the Deep Learning Era: An In-Depth Survey. <italic>IEEE</italic><italic>Transactions</italic><italic>on</italic><italic>Pattern</italic><italic>Analysis</italic><italic>and</italic><italic>Machine</italic><italic>Intelligence</italic>, 44, 3239-3259. https://doi.org/10.1109/tpami.2021.3051099 <pub-id pub-id-type="doi">10.1109/tpami.2021.3051099</pub-id><pub-id pub-id-type="pmid">33434124</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tpami.2021.3051099">https://doi.org/10.1109/tpami.2021.3051099</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wang, W.</string-name>
              <string-name>Lai, Q.</string-name>
              <string-name>Fu, H.</string-name>
              <string-name>Shen, J.</string-name>
              <string-name>Ling, H.</string-name>
              <string-name>Yang, R.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Salient Object Detection in the Deep Learning Era: An In-Depth Survey</article-title>
            <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
            <volume>44</volume>
            <pub-id pub-id-type="doi">10.1109/tpami.2021.3051099</pub-id>
            <pub-id pub-id-type="pmid">33434124</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B30">
        <label>30.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Patel, K., Bur, A.M. and Wang, G. (2021) Enhanced U-Net: A Feature Enhancement Network for Polyp Segmentation. 2021 18 <italic>th Conference on Robots and Vision</italic>( <italic>CRV</italic>), Burnaby, 26-28 May 2021, 181-188. https://doi.org/10.1109/crv52889.2021.00032 <pub-id pub-id-type="doi">10.1109/crv52889.2021.00032</pub-id><pub-id pub-id-type="pmid">34368816</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/crv52889.2021.00032">https://doi.org/10.1109/crv52889.2021.00032</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Patel, K.</string-name>
              <string-name>Bur, A.M.</string-name>
              <string-name>Wang, G.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Enhanced U-Net: A Feature Enhancement Network for Polyp Segmentation</article-title>
            <source>2021 18th Conference on Robots and Vision (CRV)</source>
            <volume>26</volume>
            <pub-id pub-id-type="doi">10.1109/crv52889.2021.00032</pub-id>
            <pub-id pub-id-type="pmid">34368816</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B31">
        <label>31.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wei, J., Hu, Y., Zhang, R., Li, Z., Zhou, S.K. and Cui, S. (2021) Shallow Attention Network for Polyp Segmentation. In: de Bruijne, M., <italic>et al</italic>., Eds., <italic>Lecture</italic><italic>Notes</italic><italic>in</italic><italic>Computer</italic><italic>Science</italic>, Springer International Publishing, 699-708. https://doi.org/10.1007/978-3-030-87193-2_66 <pub-id pub-id-type="doi">10.1007/978-3-030-87193-2_66</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-030-87193-2_66">https://doi.org/10.1007/978-3-030-87193-2_66</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wei, J.</string-name>
              <string-name>Hu, Y.</string-name>
              <string-name>Zhang, R.</string-name>
              <string-name>Li, Z.</string-name>
              <string-name>Zhou, S.K.</string-name>
              <string-name>Cui, S.</string-name>
              <string-name>Bruijne, M.</string-name>
              <string-name>Science, S</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Shallow Attention Network for Polyp Segmentation</article-title>
            <source>In: de Bruijne</source>
            <volume>699</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-030-87193-2_66</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B32">
        <label>32.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Li, S., Feng, Y., Xu, H., Miao, Y., Lin, Z., Liu, H., <italic>et al</italic>. (2023) Caenet: Contrast Adaptively Enhanced Network for Medical Image Segmentation Based on a Differentiable Pooling Function. <italic>Computers</italic><italic>in</italic><italic>Biology</italic><italic>and</italic><italic>Medicine</italic>, 167, Article 107578. https://doi.org/10.1016/j.compbiomed.2023.107578 <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107578</pub-id><pub-id pub-id-type="pmid">37918260</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.compbiomed.2023.107578">https://doi.org/10.1016/j.compbiomed.2023.107578</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Li, S.</string-name>
              <string-name>Feng, Y.</string-name>
              <string-name>Xu, H.</string-name>
              <string-name>Miao, Y.</string-name>
              <string-name>Lin, Z.</string-name>
              <string-name>Liu, H.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Caenet: Contrast Adaptively Enhanced Network for Medical Image Segmentation Based on a Differentiable Pooling Function</article-title>
            <source>Computers in Biology and Medicine</source>
            <volume>167</volume>
            <elocation-id>107578</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107578</pub-id>
            <pub-id pub-id-type="pmid">37918260</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B33">
        <label>33.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Liu, L., Li, Y., Wu, Y., Ren, L. and Wang, G. (2023) LGI Net: Enhancing Local-Global Information Interaction for Medical Image Segmentation. <italic>Computers</italic><italic>in</italic><italic>Biology</italic><italic>and</italic><italic>Medicine</italic>, 167, Article 107627. https://doi.org/10.1016/j.compbiomed.2023.107627 <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107627</pub-id><pub-id pub-id-type="pmid">39491377</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.compbiomed.2023.107627">https://doi.org/10.1016/j.compbiomed.2023.107627</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Liu, L.</string-name>
              <string-name>Li, Y.</string-name>
              <string-name>Wu, Y.</string-name>
              <string-name>Ren, L.</string-name>
              <string-name>Wang, G.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>LGI Net: Enhancing Local-Global Information Interaction for Medical Image Segmentation</article-title>
            <source>Computers in Biology and Medicine</source>
            <volume>167</volume>
            <elocation-id>107627</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107627</pub-id>
            <pub-id pub-id-type="pmid">39491377</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B34">
        <label>34.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Xu, S., Xiao, D., Yuan, B., Liu, Y., Wang, X., Li, N., <italic>et al</italic>. (2023) FAFuse: A Four-Axis Fusion Framework of CNN and Transformer for Medical Image Segmentation. <italic>Computers</italic><italic>in</italic><italic>Biology</italic><italic>and</italic><italic>Medicine</italic>, 166, Article 107567. https://doi.org/10.1016/j.compbiomed.2023.107567 <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107567</pub-id><pub-id pub-id-type="pmid">37852109</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.compbiomed.2023.107567">https://doi.org/10.1016/j.compbiomed.2023.107567</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Xu, S.</string-name>
              <string-name>Xiao, D.</string-name>
              <string-name>Yuan, B.</string-name>
              <string-name>Liu, Y.</string-name>
              <string-name>Wang, X.</string-name>
              <string-name>Li, N.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>FAFuse: A Four-Axis Fusion Framework of CNN and Transformer for Medical Image Segmentation</article-title>
            <source>Computers in Biology and Medicine</source>
            <volume>166</volume>
            <elocation-id>107567</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107567</pub-id>
            <pub-id pub-id-type="pmid">37852109</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B35">
        <label>35.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Li, Z., Zhang, N., Gong, H., Qiu, R. and Zhang, W. (2023) MFA-Net: Multiple Feature Association Network for Medical Image Segmentation. <italic>Computers</italic><italic>in</italic><italic>Biology</italic><italic>and</italic><italic>Medicine</italic>, 158, Article 106834. https://doi.org/10.1016/j.compbiomed.2023.106834 <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.106834</pub-id><pub-id pub-id-type="pmid">37003067</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.compbiomed.2023.106834">https://doi.org/10.1016/j.compbiomed.2023.106834</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Li, Z.</string-name>
              <string-name>Zhang, N.</string-name>
              <string-name>Gong, H.</string-name>
              <string-name>Qiu, R.</string-name>
              <string-name>Zhang, W.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>MFA-Net: Multiple Feature Association Network for Medical Image Segmentation</article-title>
            <source>Computers in Biology and Medicine</source>
            <volume>158</volume>
            <elocation-id>106834</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.106834</pub-id>
            <pub-id pub-id-type="pmid">37003067</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B36">
        <label>36.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Zou, Y., Ge, Y., Zhao, L. and Li, W. (2023) MR-Trans: Multiresolution Transformer for Medical Image Segmentation. <italic>Computers</italic><italic>in</italic><italic>Biology</italic><italic>and</italic><italic>Medicine</italic>, 165, Article 107456. https://doi.org/10.1016/j.compbiomed.2023.107456 <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107456</pub-id><pub-id pub-id-type="pmid">37696179</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.compbiomed.2023.107456">https://doi.org/10.1016/j.compbiomed.2023.107456</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Zou, Y.</string-name>
              <string-name>Ge, Y.</string-name>
              <string-name>Zhao, L.</string-name>
              <string-name>Li, W.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>MR-Trans: Multiresolution Transformer for Medical Image Segmentation</article-title>
            <source>Computers in Biology and Medicine</source>
            <volume>165</volume>
            <elocation-id>107456</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107456</pub-id>
            <pub-id pub-id-type="pmid">37696179</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B37">
        <label>37.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zhang, J., Qin, Q., Ye, Q. and Ruan, T. (2023) ST-UNet: Swin Transformer Boosted U-Net with Cross-Layer Feature Enhancement for Medical Image Segmentation. <italic>Computers</italic><italic>in</italic><italic>Biology</italic><italic>and</italic><italic>Medicine</italic>, 153, Article 106516. https://doi.org/10.1016/j.compbiomed.2022.106516 <pub-id pub-id-type="doi">10.1016/j.compbiomed.2022.106516</pub-id><pub-id pub-id-type="pmid">36628914</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.compbiomed.2022.106516">https://doi.org/10.1016/j.compbiomed.2022.106516</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zhang, J.</string-name>
              <string-name>Qin, Q.</string-name>
              <string-name>Ye, Q.</string-name>
              <string-name>Ruan, T.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>ST-UNet: Swin Transformer Boosted U-Net with Cross-Layer Feature Enhancement for Medical Image Segmentation</article-title>
            <source>Computers in Biology and Medicine</source>
            <volume>153</volume>
            <elocation-id>106516</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.compbiomed.2022.106516</pub-id>
            <pub-id pub-id-type="pmid">36628914</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B38">
        <label>38.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zhang, Z., Sun, G., Zheng, K., Yang, J., Zhu, X. and Li, Y. (2023) Tc-Net: A Joint Learning Framework Based on CNN and Vision Transformer for Multi-Lesion Medical Images Segmentation. <italic>Computers</italic><italic>in</italic><italic>Biology</italic><italic>and</italic><italic>Medicine</italic>, 161, Article 106967. https://doi.org/10.1016/j.compbiomed.2023.106967 <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.106967</pub-id><pub-id pub-id-type="pmid">37220707</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.compbiomed.2023.106967">https://doi.org/10.1016/j.compbiomed.2023.106967</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zhang, Z.</string-name>
              <string-name>Sun, G.</string-name>
              <string-name>Zheng, K.</string-name>
              <string-name>Yang, J.</string-name>
              <string-name>Zhu, X.</string-name>
              <string-name>Li, Y.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Tc-Net: A Joint Learning Framework Based on CNN and Vision Transformer for Multi-Lesion Medical Images Segmentation</article-title>
            <source>Computers in Biology and Medicine</source>
            <volume>161</volume>
            <elocation-id>106967</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.106967</pub-id>
            <pub-id pub-id-type="pmid">37220707</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B39">
        <label>39.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Li, P., Zhou, R., He, J., Zhao, S. and Tian, Y. (2023) A Global-Frequency-Domain Network for Medical Image Segmentation. <italic>Computers</italic><italic>in</italic><italic>Biology</italic><italic>and</italic><italic>Medicine</italic>, 164, Article 107290. https://doi.org/10.1016/j.compbiomed.2023.107290 <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107290</pub-id><pub-id pub-id-type="pmid">37579584</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.compbiomed.2023.107290">https://doi.org/10.1016/j.compbiomed.2023.107290</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Li, P.</string-name>
              <string-name>Zhou, R.</string-name>
              <string-name>He, J.</string-name>
              <string-name>Zhao, S.</string-name>
              <string-name>Tian, Y.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>A Global-Frequency-Domain Network for Medical Image Segmentation</article-title>
            <source>Computers in Biology and Medicine</source>
            <volume>164</volume>
            <elocation-id>107290</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.compbiomed.2023.107290</pub-id>
            <pub-id pub-id-type="pmid">37579584</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>