<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Heterogeneous model ensemble for automatic polyp segmentation in endoscopic video sequences</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Thuy Nuong Tran</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabian Isensee</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lars Krämer</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Amine Yamlahi</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tim Adler</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Patrick Godau</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Minu Tizabi</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lena Maier-Hein</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Applied Computer Vision Lab, Helmholtz Imaging</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Div. Intelligent Medical Systems, German Cancer Research Center (DKFZ)</institution>
          ,
          <addr-line>Heidelberg</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Div. Medical Image Computing</institution>
          ,
          <addr-line>DKFZ, Heidelberg</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The detection and segmentation of polyps during colonoscopy can substantially contribute to the prevention of colon cancer. Assisting clinicians using automated systems can mitigate the risk of human error. In this work, we present our polyp segmentation approach, submitted to the EndoCV2022 challenge. Common polyp segmentation methods are based on single-model, single-frame predictions. This work presents a symbiosis of three separate models, each with their own strength, as part of a segmentation pipeline and a post-processing step designed to leverage unique predictions for more temporally coherent results.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Polyp segmentation</kwd>
        <kwd>Temporal coherence</kwd>
        <kwd>High resolution</kwd>
        <kwd>Heterogeneous ensemble</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Datasets</title>
      <p>
        Colorectal cancer is one of the most commonly found can- The dataset provided by the EndoCV2022 polyp
segmencer types, ranking second in females and third in males tation sub-challenge[
        <xref ref-type="bibr" rid="ref2 ref3 ref4">2, 3, 4</xref>
        ] consists of 46 sequences
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. By detecting and subsequently resecting polyps dur- of varied length, totalling 3,290 image frames and their
ing colonoscopy screenings, the risk of developing the corresponding polyp segmentation masks.
Furtherdisease can be reduced significantly. With the advance of more, three public polyp segmentation datasets were
machine learning in the medical domain, deep learning- added as external data, namely CVC-ColonDB[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ],
CVCbased methods have the potential to assist in detecting ClinicDB[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and ETIS-Larib[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], to enrich the diversity of
and segmenting these polyps with high accuracy. The the dataset. These account for 1,108 additional training
EndoCV2022 challenge[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] addresses generalizability of images, resulting in 4,398 frames in total.
such deep learning models for segmentation in
endoscopic video sequences. The method presented in this
paper tackles this issue with three primary design de- 3. Methodology
cisions: (1) The provided challenge dataset underwent
a curation process that ensures annotation quality. (2)
An ensemble of three networks with complementary
strengths was trained for the segmentation prediction.
(3) Finally, a post-processing step was implemented to
address false-negative frames caused by majority vote. A
fallback mechanism was set to reweight the predictions
of a single model in order to enable unique predictions.
      </p>
      <p>
        Our challenge strategy rests on three main pillars: (1) A
data pre-processing step to ensure high data annotation
quality, (2) the network architecture selection and
training step, which yields the segmentation models, and (3) a
post-processing step, which leverages model
heterogeneity and uses structural similarity[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] of consecutive frames
in order to handle false-negative masks. An overview is
depicted in Fig.1.
      </p>
      <sec id="sec-2-1">
        <title>3.1. Data pre-processing</title>
        <p>than having a larger number of frames for training. The
external datasets described in section 2 underwent the
same selection process. Including external data, the
resulting training dataset amounted to 4,106 image-mask
pairs.
we expected more knowledge to be leveraged from the
provided high-resolution video sequences.
3.2.1. nnU-Net
The nnU-Net is able to automatically determine key
decisions to set up the segmentation pipeline for training,
irrespective of the dataset. While it has ranked first on
many 3D-segmentation challenges1, its self-configuring
strategy can also be applied to 2D images. The nnU-Net
was expected to provide a solid base prediction.
3.2.2. Hierarchical Multi-Scale Network</p>
        <sec id="sec-2-1-1">
          <title>By treating the polyp segmentation as a classic computer</title>
          <p>vision task, it is possible to use established segmentation
models that perform well on complex natural images.
The Hierarchical Multi-Scale Attention Network
(HMANet) was chosen as it is a state-of-the-art architecture
in semantic segmentation on Cityscapes2. The HM-ANet
operates on higher resolutions and combines predictions
from diferent scales. This was expected to result in a
precise polyp segmentation, irrespective of the size of
the polyp.</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>3.2. Neural network architectures</title>
        <p>
          In order to solve the polyp segmentation task, a model
ensemble was designed that consists of parts with com- Most of the current segmentation models operate on
plementary strengths. This was realized by using an a frame-by-frame basis. In order to capture temporal
nnU-Net[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], which is configured to automatically adapt information, one approach is to incorporate a recurrent
its pre-processing and training framework to diferent neural network layer to a standard segmentation model,
datasets, and thus serves as a strong segmentation base, such as a Gated Recurrent Unit (GRU)-layer. The chosen
a Hierarchical Multi-Scale Attention Network[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], which base segmentation model is the Eficient-UNet (Ef-UNet).
combines predictions of multiple scales for a better predic- It is an encoder-decoder architecture with an EficientNet
tion performance, and an ensemble of Eficient-UNets[
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], as its backbone, which is able to scale with model size
one of which is equipped with an internal GRU-layer to
process temporal information. By focusing on incorpo- 1medicaldecathlon.com,https://kits19.grand-challenge.org,https:
rating temporal as well as high-resolution information, //www.med.upenn.edu/cbica/brats2020
2www.cityscapes-dataset.com
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>3.3. Eficient-UNet Ensemble</title>
        <p>and outperform other ConvNet backbones. One GRU- 4.1. Implementation details
layer was added to the bottleneck of the Ef-UNet, to
form an Ef-GRUNet. Consecutive images are loaded in
batches of size two. They are encoded, pooled, flattened,
sequentially fed into the GRU-layer and then reshaped
and fed to the decoder. The Ef-UNet is trained separately
from the Ef-GRUNet. Variants of both combined form
the Ef-UNet ensemble.</p>
        <p>
          The nnU-Net was used as a framework and manual
changes were made to its automatically generated
conifguration. The short edge of the image was resized to
512px with the other being resized according to aspect
ratio. The patch-size was set to 448 x 448. The data was
then heavily augmented with operations such as rotation,
intensity and gamma augment, scaling, mirroring and
blurring.
3.3.1. Combining networks and weighting For the HM-ANet, the data was normalized and
ranSince the HM-ANet operates on high resolutions, it was dom scaling between [0.5,1], random crop to 512x1024,
expected that it performs well on very small polyps, as RGB-shift, and random vertical and horizontal flipping
well as being able to fully capture larger polyps in their was performed. The model was initiated with weights
entirety. During ensembling, the HM-ANet was designed pre-trained on PaddleClas3. The training was conducted
to be weighted higher for the small and large polyps. in three phases: 1) Training the model on original
chalSince there is no standardized definition of polyp sizes, lenge data, 2) fine-tuning the model on challenge and
the thresholds were set empirically by observing refer- external data, and 3) fine-tuning again on challenge data
ence labels of public polyp datasets[
          <xref ref-type="bibr" rid="ref5 ref6 ref7">5, 6, 7</xref>
          ]. An example only.
is shown in Fig.3. For the Ef-UNet ensemble, the data was resized to
480x480 (Ef-UNet_480) and 256x256 (Ef-UNet_256),
in3.4. Post-processing by reweighting corporating diferent resolutions. Resizing to 256x256
was chosen for the Ef-GRUNet, to fit memory
restricTo mitigate the error of false-negative predictions, a post- tions. Augmentations such as rotation, elastic and grid
processing step is added that considers empty segmen- deformation were used.
tation masks and their surrounding frames. If a neigh- In order to combine the predictions, the segmented
boring frame is polyp-positive and is similar to the cur- polyps were divided into small (≤ 0.4% of image size),
rent frame, then any non-empty prediction of the cur- large (≥ 9% of image size) and medium (rest) polyps. If
rent frame is reweighted, efectively allowing a polyp- polyps were predicted as small or large, the weight of
positive prediction despite non-majority. The similarity the HM-ANet was increased to 0.5, while the others were
score used for this approach is the structural similarity decreased to 0.25 each. If the polyp was of medium size,
score(SSIM), as it is able to take texture into account. the models were weighted equally at 0.33. The final
segmentation was formed by thresholding the weighted
predictions at 0.5. To address false-negatives resulting from
4. Experiments and Results an unmet majority criterion, unique single-model
predictions were encouraged if neighboring images were
The original training dataset was split into four parts structurally similar (SSIM &gt; 0.9) and predicted to be
using GroupK-fold for 4-fold cross-validation(CV) train- polyp-positive. The single model prediction weight was
ing, balancing the number of frames and sequence IDs. then increased to 0.5. This proved to solve some
falseEach fold has 11-12 sequences with around 750 frames. negative cases, as illustrated in Fig.4.
The following subsections describe the implementation
details and experiment results after hyperparameter
optimization. 4.2. Single model experiment results
        </p>
        <sec id="sec-2-3-1">
          <title>All final single model DSC scores are reported in Table 1.</title>
          <p>The nnU-Net was trained with external data added to the
training set, resulting in a mean CV DSC score of 0.67. Table 1
Training only on the challenge set or the external dataset Cross-Validation scores of all models, including the
comporesulted in a worse DSC score of 0.57 and 0.55. nents of the Ef-UNet ensemble. Underscored values indicate
The HM-ANet had a mean CV DSC score across all folds selection for Ef-UNet ensemble. Bold values indicate
compoof 0.70. During training and inference, predictions of nents of the final heterogeneous ensemble.
scales [0.5,1] were combined. Experiments with scales DSC score Fold 0 Fold 1 Fold 2 Fold 3
of [0.5,1,2] resulted in a worse performance of 0.69 with nnU-Net 0.65 0.84 0.70 0.50
more false-positives in empty images. Training in three HM-ANet 0.67 0.82 0.69 0.60
steps as described in sub-subsection 4.1. yielded the best Ef-UNet_480 0.67 0.80 0.69 0.62
result. Other training strategies such as training on a Ef-UNet_256 0.68 0.80 0.71 0.65
combined dataset or pre-training on the external dataset Ef-GRUNet 0.61 0.72 0.58 0.60
and fine-tuning on the oficial dataset resulted in a worse Ef-UNet Ens 0.67 0.80 0.71 0.60
performance. 4-fold cross-validation was used to
determine the stopping epochs for all three phases. A final
inference model was then trained on the entire dataset. 4.3. Reweighting and ensembling results
The three Ef-UNet models were each trained on the
combined dataset over four folds, resulting in 12 models. The
mean CV DSC scores of the Ef-UNet_480, Ef-UNet_256
and Ef-GRUNet were 0.69, 0.71 and 0.62, respectively. As
an alternative experiment, the Ef-UNet_480 was trained
with external data for pre-training and challenge data
for fine-tuning. This performed worse compared to
using the combined dataset, resulting in a mean CV DSC
score of 0.65. In order to decrease inference time, two
EfUNet_480, one Ef-UNet_256 and one Ef-GRUNet were
selected for the ensemble, based on validation score and
fold representation. The final prediction was determined
by majority vote. The mean CV DSC score of the final
ensemble was 0.70.</p>
        </sec>
        <sec id="sec-2-3-2">
          <title>In order to test the reweighting strategy of the HM-ANet,</title>
          <p>the proportion of small and big polyps was calculated
for the validation splits. For folds 0-3, the ratios were
45%, 28%, 37%, and 65%. For single models, fold 1 had
the most medium polyps and highest average CV score.
Fold 3 has the most non-medium polyps, and the lowest
average CV score. However, the diference in DSC scores
between models is small. Since the ratio was highest
for fold 3, an experiment is conducted where the three
single models were validated on only the small and big
polyp images of fold 3 (n = 483 out of 738 frames). The
resulting DSC scores are 0.63, 0.66 and 0.70. The simple
ensemble receives a score of 0.73 and the ensemble with
reweighting of HM-ANet a score of 0.74. Adding
postprocessing did not decrease or increase the score for this
validation set.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>5. Conclusion</title>
      <p>Our investigation showed that the HM-ANet was
favorable for small and large polyp cases, which our
dedicated weighing strategy takes into account during
ensembling. Notably, on a dataset with small and big
polyps, it achieves a DSC score of 0.74, improving the
best-performing single model HM-ANet by 0.04. The
post-processing leverages self-adaptive training as well
as temporal and high resolution information by enabling
unique predictions of all three heterogeneous
components, resulting in less false-negative predictions. The
inference time as the sum of the slowest component
(nnUNet) and the ensembling step is 0.71 fps.</p>
    </sec>
    <sec id="sec-4">
      <title>6. Compliance with ethical standards</title>
      <sec id="sec-4-1">
        <title>This work was conducted using public datasets of human subject data made available by [2, 3, 4, 5, 6, 7].</title>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>7. Acknowledgments</title>
      <sec id="sec-5-1">
        <title>This project was supported by a Twinning Grant of the</title>
        <p>German Cancer Research Center(DKFZ) and the Robert
Bosch Center for Tumor Diseases(RBCT). Part of this
work was funded by Helmholtz Imaging(HI), a platform
of the Helmholtz Incubator on Information and Data
Science.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>F. A.</given-names>
            <surname>Haggar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. P.</given-names>
            <surname>Boushey</surname>
          </string-name>
          ,
          <article-title>Colorectal cancer epidemiology: incidence, mortality, survival, and risk factors, Clinics in colon and rectal surgery 22 (</article-title>
          <year>2009</year>
          )
          <fpage>191</fpage>
          -
          <lpage>197</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ghatwary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Isik-Polat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Polat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Galdran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.-Á. G.</given-names>
            <surname>Ballester</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Thambawita</surname>
          </string-name>
          , et al.,
          <article-title>Assessing generalisability of deep learning-based polyp detection and segmentation methods through a computer vision challenge</article-title>
          ,
          <source>arXiv preprint arXiv:2202.12031</source>
          (
          <year>2022</year>
          ). doi:
          <volume>10</volume>
          .48550/arXiv.2202.12031.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dmitrieva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ghatwary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Polat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Temizel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Krenzer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hekalo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. B.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Matuszewski</surname>
          </string-name>
          , et al.,
          <article-title>Deep learning for detection and segmentation of artefact and disease instances in gastrointestinal endoscopy</article-title>
          ,
          <source>Medical image analysis 70</source>
          (
          <year>2021</year>
          )
          <article-title>102002</article-title>
          . doi:
          <volume>10</volume>
          .1016/j. media.
          <year>2021</year>
          .
          <volume>102002</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ghatwary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Realdon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cannizzaro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. E.</given-names>
            <surname>Salem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lamarque</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Daul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. V.</given-names>
            <surname>Anonsen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Riegler</surname>
          </string-name>
          , et al.,
          <article-title>Polypgen: A multi-center polyp detection and segmentation dataset for generalisability assessment</article-title>
          ,
          <source>arXiv preprint arXiv:2106.04463</source>
          (
          <year>2021</year>
          ). doi:
          <volume>10</volume>
          .48550/ arXiv.2106.04463.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bernal</surname>
          </string-name>
          et al.,
          <article-title>Towards automatic polyp detection with a polyp appearance model</article-title>
          ,
          <source>Pattern Recognition</source>
          <volume>45</volume>
          (
          <year>2012</year>
          )
          <fpage>3166</fpage>
          -
          <lpage>3182</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bernal</surname>
          </string-name>
          et al.,
          <article-title>Wm-dova maps for accurate polyp highlighting in colonoscopy: Validation vs. saliency maps from physicians</article-title>
          ,
          <source>Computerized Medical Imaging and Graphics</source>
          <volume>43</volume>
          (
          <year>2015</year>
          )
          <fpage>99</fpage>
          -
          <lpage>111</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Silva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Histace</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Romain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Dray</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Granado</surname>
          </string-name>
          ,
          <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 9</source>
          (
          <year>2014</year>
          )
          <fpage>283</fpage>
          -
          <lpage>293</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          et al.,
          <article-title>Image quality assessment: from error visibility to structural similarity</article-title>
          ,
          <source>IEEE transactions on image processing 13</source>
          (
          <year>2004</year>
          )
          <fpage>600</fpage>
          -
          <lpage>612</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>B.</given-names>
            <surname>Baheti</surname>
          </string-name>
          et al.,
          <article-title>Ef-unet: A novel architecture for semantic segmentation in unstructured environment</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>358</fpage>
          -
          <lpage>359</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>F.</given-names>
            <surname>Isensee</surname>
          </string-name>
          et al., nnU-Net:
          <article-title>a self-configuring method for deep learning-based biomedical image segmentation</article-title>
          ,
          <source>Nature methods 18</source>
          (
          <year>2021</year>
          )
          <fpage>203</fpage>
          -
          <lpage>211</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Tao</surname>
          </string-name>
          et al.,
          <article-title>Hierarchical multi-scale attention for semantic segmentation</article-title>
          , arXiv preprint arXiv:
          <year>2005</year>
          .
          <volume>10821</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>