<!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>KD-ResUNet++: Automatic Polyp Segmentation via Self-Knowledge Distillation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jaeyong Kang</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jeonghwan Gwak</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of IT</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Software, Korea National University of Transportation</institution>
          ,
          <addr-line>Chungju 27469</addr-line>
          ,
          <country country="KR">South Korea</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <fpage>14</fpage>
      <lpage>15</lpage>
      <abstract>
        <p>In this paper, we present our method for Medico automatic polyp segmentation challenge at MediaEval 2020. In our method, we utilized the knowledge distillation technique to improve ResUNet++ which performs well on automatic polyp segmentation. In our experiment, our proposed model called KD-ResUNet++ outperforms ResUNet++ in terms of Jaccard index, Dice similarity coeficient, and recall. Our best models achieved Jaccard index, Dice similarity coeficient, and FPS of 0.6196, 0.7089, and 107.8797 respectively on the oficial test dataset in the challenge.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        Automatic polyp segmentation is a challenging task due to
variations in the shape and size of polyps. In this paper, we propose
KD-ResUNet++, which is based on the ResUNet++ architecture [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
and knowledge distillation for Medico automatic polyp
segmentation challenge at MediaEval 2020 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Knowledge distillation is a
method to transfer knowledge from one architecture (e.g., teacher)
to another (e.g., student). In particular, we use self-knowledge
distillation where teacher and student architectures are the same.
      </p>
    </sec>
    <sec id="sec-2">
      <title>RELATE WORKS</title>
    </sec>
    <sec id="sec-3">
      <title>ResUNet++</title>
      <p>
        U-Net is a very popular deep learning architecture for biomedical
image segmentation. U-Net won the 2015 ISBI cell tracking
challenge. ResUNet [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] is an improved U-Net architecture which takes
advantage of strengths from both the U-Net architecture and deep
residual learning. ResUNet++ [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] is an improved ResUNet
architecture that further takes advantage of attention blocks, Atrous Spatial
Pyramidal Pooling (ASPP), and squeeze and excitation blocks. As
being reported in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], ResUNet++ shows the state-of-the-art
performance on automatic polyp segmentation.
      </p>
    </sec>
    <sec id="sec-4">
      <title>Knowledge distillation</title>
      <p>
        Knowledge distillation aims at transferring dark knowledge from a
teacher model such as wide [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] or deep [
        <xref ref-type="bibr" rid="ref10 ref12 ref2">2, 10, 12</xref>
        ], or an ensemble
of models [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] to a student model which is typically thin and small.
Trained in this way, the student model can mimic the behavior of
the teacher model such as class probability distribution to achieve
better performance than the model trained with hard labels
independently. Self-knowledge distillation refers to the special case
where the teacher and student architectures are the same. It has
been consistently reported [
        <xref ref-type="bibr" rid="ref1 ref13 ref4 ref6">1, 4, 6, 13</xref>
        ] that student models trained
with self-knowledge distillation show better performance than their
teacher models by significant margins in several language modeling
and computer vision tasks.
3
      </p>
    </sec>
    <sec id="sec-5">
      <title>METHODS</title>
      <p>In this section, the architecture of our proposed method for
automatic polyp segmentation is first presented. After that, we describe
the details of the key components in the following subsections. The
overall architecture of our proposed model is shown in Figure 1.
First, input images are augmented by the data augmentation
module. Second, augmented images are used as the input of both the
student model and the teacher model. Third, distillation loss
between the output of the student model and the output of the teacher
model and the student loss between the output of the student model
and ground-truth label is calculated to train the student model.
3.1</p>
    </sec>
    <sec id="sec-6">
      <title>Data augmentation</title>
      <p>Deep learning models require a large amount of training data to
work efectively. However, the size of the provided colonoscopy
dataset is not very large. To solve this problem, data augmentation
can be used to make the relatively smaller dataset a large one. It is
reported that the performance of the deep learning model can be
improved by augmenting the existing data rather than collecting
new data. In our data augmentation step, we used 2 augmentation
strategies (rotation and horizontal flipping) to generate new
training sets. The rotation operation used for data augmentation is done
by randomly rotating the input by 90 degrees zero or more times.
The rotation operation fills the area of rotated images where there
was no image pixel with black. In addition, we applied horizontal
lfipping to each of the rotated images.
In our proposed approach, we use self-knowledge distillation where
teacher network and student network are the same. We use
ResUNet++ for both teacher and student networks. In knowledge
distillation, the teacher network is first trained to transfer
knowledge to the student network. Also, the loss function consists of
1) the distillation loss and 2) the student loss. The distillation loss
 can be calculated using dice loss between the output of the
student model  and the output of pre-trained teacher model  ,
and the student loss  can be calculated using dice loss between
the output of the student model  and the ground-truth label 
as follows:
 = 1 −  ( ,  )
 = 1 −  ( ,  )
 = 0.1 ∗  + 
The total loss  is then calculated as the joint of the distillation
and student losses as follows:
(1)
(2)
(3)
4
4.1</p>
    </sec>
    <sec id="sec-7">
      <title>EXPERIMENTS AND RESULTS</title>
    </sec>
    <sec id="sec-8">
      <title>Dataset</title>
      <p>
        We trained our proposed model using the Kvasir-SEG dataset [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ],
the benchmark dataset for the 2020 Medico automatic polyp
segmentation challenge. It consists of 1,000 polyp images and their
corresponding ground truth masks annotated by expert endoscopists
from Oslo University Hospital, Norway.
4.2
      </p>
    </sec>
    <sec id="sec-9">
      <title>Experimental Setting</title>
      <p>The dataset is split into 88 % for learning the weights and 12 % for
validating the model during the training step. Before the training
step, we augment input images using our data augmentation module
described in Section 3.1 and converted the images to the size of
256×256 pixels. The validation set is only normalized. The learning
rate is set to 0.001. We use Adam as our optimizer.
Our results on the validation set are presented in Table 1. Also,
the oficial results on polyp segmentation and algorithm eficiency
tasks on the same test dataset are shown in Table 2 and Table 3,
respectively. Table 1 shows that ResUNet++ achieved slightly better
precision than KD-ResUNet++. However, KD-ResUNet++
outperforms ResUNet++ in terms of Jaccard index and Dice similarity
coeficient which is an important metric for semantic
segmentation task. Table 1 shows that our proposed model outperforms
ResUNet++ in terms of Jaccard index, Dice similarity coeficient,
and recall. Table 2 and 3 show that our proposed model achieved
Jaccard index, Dice similarity coeficient, and FPS of 0.6196, 0.7089,
and 107.8797 respectively on the oficial test dataset. Besides,
examples of three diferent segmentations produced by ResUNet++ and
KD-ResUNet++ are depicted in Figure 2. Figure 2 shows that the
result of KD-ResUNet++ are more similar with ground truth than
the result of ResUNet++.
5</p>
    </sec>
    <sec id="sec-10">
      <title>CONCLUSION</title>
      <p>
        In this paper, we presented KD-ResUNet++ for automatic polyp
segmentation. In our proposed framework, the data augmentation
technique is applied to input images. Also, we use self-knowledge
distillation where teacher and student networks are the same. We
use the ResUNet++ model for our student and teacher networks.
Our proposed model is evaluated on the validation set as well as the
oficial test set. Our experimental results show that our proposed
model outperforms ResUNet++ in terms of Jaccard index, Dice
similarity coeficient, and recall. These results indicate that our
proposed method can capture polyp segmentation boundary well
and could be potentially used in clinical settings. In the future, we
plan to use diferent knowledge types in our knowledge distillation.
Also, we plan to modify the ResUNet++ architecture to incorporate
the model pre-trained on a large image dataset (e.g., ImageNet [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ])
to reduces the long training time which is normally required to
train deep learning model from scratch, and also to remove the
requirement of having a large training dataset.
      </p>
    </sec>
    <sec id="sec-11">
      <title>ACKNOWLEDGMENTS</title>
      <p>This research was supported by the Basic Science Research Program
through the National Research Foundation of Korea (NRF) funded
by the Ministry of Education (Grant No. NRF-2020R1I1A3074141).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Sungsoo</given-names>
            <surname>Ahn</surname>
          </string-name>
          , Shell Xu Hu, Andreas Damianou,
          <string-name>
            <surname>Neil D Lawrence</surname>
            , and
            <given-names>Zhenwen</given-names>
          </string-name>
          <string-name>
            <surname>Dai</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Variational information distillation for knowledge transfer</article-title>
          .
          <source>In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source>
          .
          <fpage>9163</fpage>
          -
          <lpage>9171</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Guobin</given-names>
            <surname>Chen</surname>
          </string-name>
          , Wongun Choi, Xiang Yu, Tony Han, and
          <string-name>
            <given-names>Manmohan</given-names>
            <surname>Chandraker</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Learning eficient object detection models with knowledge distillation</article-title>
          .
          <source>In Advances in Neural Information Processing Systems</source>
          .
          <volume>742</volume>
          -
          <fpage>751</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Jia</given-names>
            <surname>Deng</surname>
          </string-name>
          , Wei Dong, Richard Socher,
          <string-name>
            <surname>Li-Jia</surname>
            <given-names>Li</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Kai</given-names>
            <surname>Li</surname>
          </string-name>
          , and
          <string-name>
            <surname>Li</surname>
          </string-name>
          Fei-Fei.
          <year>2009</year>
          .
          <article-title>Imagenet: A large-scale hierarchical image database</article-title>
          .
          <source>In 2009 IEEE conference on computer vision and pattern recognition. Ieee</source>
          ,
          <volume>248</volume>
          -
          <fpage>255</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Tommaso</given-names>
            <surname>Furlanello</surname>
          </string-name>
          , Zachary C Lipton, Michael Tschannen, Laurent Itti, and
          <string-name>
            <given-names>Anima</given-names>
            <surname>Anandkumar</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Born again neural networks</article-title>
          .
          <source>arXiv preprint arXiv:1805</source>
          .
          <volume>04770</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Geofrey</given-names>
            <surname>Hinton</surname>
          </string-name>
          ,
          <source>Oriol Vinyals, and Jef Dean</source>
          .
          <year>2015</year>
          .
          <article-title>Distilling the knowledge in a neural network</article-title>
          .
          <source>arXiv preprint arXiv:1503.02531</source>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Thi</given-names>
            <surname>Kieu Khanh Ho</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jeonghwan</given-names>
            <surname>Gwak</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Utilizing Knowledge Distillation in Deep Learning for Classification of Chest X-Ray Abnormalities</article-title>
          .
          <source>IEEE Access</source>
          <volume>8</volume>
          (
          <year>2020</year>
          ),
          <fpage>160749</fpage>
          -
          <lpage>160761</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Debesh</given-names>
            <surname>Jha</surname>
          </string-name>
          , Steven A.
          <string-name>
            <surname>Hicks</surname>
            , Krister Emanuelsen,
            <given-names>Håvard D.</given-names>
          </string-name>
          <string-name>
            <surname>Johansen</surname>
          </string-name>
          , Dag Johansen, Thomas de Lange,
          <article-title>Michael A</article-title>
          .
          <string-name>
            <surname>Riegler</surname>
            , and
            <given-names>Pål</given-names>
          </string-name>
          <string-name>
            <surname>Halvorsen</surname>
          </string-name>
          .
          <year>2020</year>
          . Medico Multimedia Task at MediaEval 2020:
          <article-title>Automatic Polyp Segmentation</article-title>
          .
          <source>In Proc. of MediaEval 2020 CEUR Workshop.</source>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Debesh</given-names>
            <surname>Jha</surname>
          </string-name>
          ,
          <string-name>
            <surname>Pia H Smedsrud</surname>
          </string-name>
          ,
          <article-title>Michael A Riegler, Pål Halvorsen</article-title>
          , Thomas de Lange, Dag Johansen, and
          <string-name>
            <given-names>Håvard D</given-names>
            <surname>Johansen</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Kvasir-SEG: A Segmented Polyp Dataset</article-title>
          .
          <source>In Proc. of International Conference on Multimedia Modeling (MMM)</source>
          .
          <volume>451</volume>
          -
          <fpage>462</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Debesh</given-names>
            <surname>Jha</surname>
          </string-name>
          ,
          <string-name>
            <surname>Pia H Smedsrud</surname>
          </string-name>
          ,
          <article-title>Michael A Riegler, Dag Johansen</article-title>
          , Thomas De Lange, Pål Halvorsen, and
          <string-name>
            <given-names>Håvard D</given-names>
            <surname>Johansen</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>ResUNet++: An Advanced Architecture for Medical Image Segmentation</article-title>
          .
          <source>In Proc. of International Symposium on Multimedia</source>
          .
          <volume>225</volume>
          -
          <fpage>230</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Jaeyong</given-names>
            <surname>Kang</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jeonghwan</given-names>
            <surname>Gwak</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Ensemble Learning of Lightweight Deep Learning Models Using Knowledge Distillation for Image Classification</article-title>
          .
          <source>Mathematics</source>
          <volume>8</volume>
          ,
          <issue>10</issue>
          (
          <year>2020</year>
          ),
          <fpage>1652</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Adriana</surname>
            <given-names>Romero</given-names>
          </string-name>
          , Nicolas Ballas, Samira Ebrahimi Kahou, Antoine Chassang, Carlo Gatta, and
          <string-name>
            <given-names>Yoshua</given-names>
            <surname>Bengio</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Fitnets: Hints for thin deep nets</article-title>
          .
          <source>arXiv preprint arXiv:1412.6550</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Gregor</surname>
            <given-names>Urban</given-names>
          </string-name>
          , Krzysztof J Geras, Samira Ebrahimi Kahou, Ozlem Aslan, Shengjie Wang, Rich Caruana, Abdelrahman Mohamed, Matthai Philipose, and
          <string-name>
            <given-names>Matt</given-names>
            <surname>Richardson</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Do deep convolutional nets really need to be deep and convolutional?</article-title>
          <source>arXiv preprint arXiv:1603.05691</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Chenglin</surname>
            <given-names>Yang</given-names>
          </string-name>
          , Lingxi Xie, Siyuan Qiao, and Alan L Yuille.
          <year>2019</year>
          .
          <article-title>Training deep neural networks in generations: A more tolerant teacher educates better students</article-title>
          .
          <source>In Proceedings of the AAAI Conference on Artificial Intelligence</source>
          , Vol.
          <volume>33</volume>
          .
          <fpage>5628</fpage>
          -
          <lpage>5635</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Zhengxin</surname>
            <given-names>Zhang</given-names>
          </string-name>
          , Qingjie Liu, and
          <string-name>
            <given-names>Yunhong</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <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>
          ,
          <issue>5</issue>
          (May
          <year>2018</year>
          ),
          <fpage>749</fpage>
          -
          <lpage>753</lpage>
          . https://doi.org/10.1109/lgrs.
          <year>2018</year>
          .2802944
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>