<!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>
      <journal-title-group>
        <journal-title>CLEF</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>SZTAKI @ ImageCLEFmed 2020 Tuberculosis Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Bence Lestyan</string-name>
          <email>lestyan@ilab.sztaki.hu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andr´as A. Benczu´r</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ba´lint Daro´czy</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>Institute for Computer Science and Control (SZTAKI) H-1111</institution>
          ,
          <addr-line>Kende str. 13-17, Budapest</addr-line>
          ,
          <country country="HU">Hungary</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Sz ́echenyi University H-9026</institution>
          ,
          <addr-line>Egyetem t ́er 1, Gy ̋or</addr-line>
          ,
          <country country="HU">Hungary</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <volume>22</volume>
      <fpage>22</fpage>
      <lpage>25</lpage>
      <abstract>
        <p>In this paper we describe our submission to the ImageCLEFmed 2020 Tuberculosis task and discuss additional results on the training set with various neural networks. After some centralization and normalization we independently categorized the 2D slices with convolutional neural networks (traditional and residual feed-forward networks) and we aggregated the individual predictions based on the positions of the lung and the slices. Our additional experiments with various aggregation methods indicate that individual slices do not necessary contain enough information about such complex structures.</p>
      </abstract>
      <kwd-group>
        <kwd>Computed tomography</kwd>
        <kwd>Residual networks</kwd>
        <kwd>Convolutional networks</kwd>
        <kwd>Tuberculosis</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The goal of the ImageCLEFmed 2020 Tubercolosis task3 [
        <xref ref-type="bibr" rid="ref6 ref8">8, 6</xref>
        ] is to detect
whether the different parts of the lung are affected by Mycobacterium
tuberculosis. The categories are LeftLungAffected, RightLungAffected, CavernsLeft,
CavernsRight, PleurisyLeft, PleurisyRight. The data set contain 403 computed
tomography scans (CT scans). Out of the 403 CT scans 283 scans are used as
a training set with known labels for the participants and 120 CT scans as the
test for the competition. For our experiments we split the training set into two
subsets (163 as training and 120 as validation set) and evaluated our models on
the smaller set. Out of the two lung masks [
        <xref ref-type="bibr" rid="ref10 ref2">2, 10</xref>
        ] we used the first segmentation
method in the aggregation phase of the slice predictions.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Models</title>
      <p>
        First, we preprocessed individual CT slices. Based on the provided lung masks
we centralized and rescaled the slices to lower the resolution from 512x512 to
256x256. Additionally we standard normalized the intensity values, see Fig. 1. We
omitted to apply additional augmentation techniques [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] e.g. rotation, mirroring
or random crop as the position of the lung is crucial. We treated the scoring
procedure as a set of binary classification tasks therefore we trained separate
neural networks for each category.
      </p>
      <p>
        We chose feed-forward neural networks with a single output node to model
the categories per slice. Every inner layer included Rectangular Linear Units
(ReLU) as non-linear activation functions and we chose sigmoid for the output
unit. We built a traditional Convolutional Neural Network (CNN [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]) with two
convolutional layers with 64 5x5 sized filters and a Residual Network (ResNet
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]) with three residual blocks, for details see Table 1 and Table 2 respectively.
The residual blocks contained a set of 3x3 sized convolution with 8,32,64 filters
per block followed by a second convolution with the same size and a final
residual connection and a downsizing unit. Between the two convolutions we used
batch normalization and ReLU similarly to the original paper. Before the linear
discriminative layer we downsized the tensor with average pooling.
Additionally, for the CNN network we applied Dropout [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] in the second convolutional
layer. We evaluated the performance of the models with the log-likelihood of
the probability of the original label measured by the activation of the output
unit. As an optimization method we used Adam [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] thus we omitted additional
regularization in the loss function.
      </p>
      <p>
        We measured the performance of various models on the validation set, a
random subset of the training set. In the testing phase we used every training
scan with the best settings. We implemented the models in PyTorch framework
4 and did all the experiments in python. Additionally, we used the provided lung
masks based on the first automatic segmentation method described in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
2.1
      </p>
      <p>
        Aggregation
We combined the individual predictions of the slices to compute a single score
per CT scan. During our experiments we applied various methods to define a
single score:
– Mean score (sc1): mean of the individual prediction scores of the CT scan.
– Maximal score (sc2): maximal prediction score in a CT scan.
– Minimal score (sc3): minimal prediction score in a CT scan.
– Median score (sc4): median prediction score in a CT scan.
– Middle score (sc5): prediction score of the center slice.
– Majority vote (sc6): proportion of the positive predictions.
4 https://pytorch.org
– Mask score (sc7): weighted prediction scores based on the proportion of the
actual lung in the slices. The proportion of the lung was the proportion
of the lung segment given the mask files. The masks were extracted by a
fully automatic lung segmentation method described in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. We used the
corresponding masks per lung per task.
All of our submitted runs included mean score over the CNN results. Our main
submission (#68061) achieved mean AUC of 0.595. The remaining runs
contained single category scores with random scores for the rest of the categories
(we estimated the AUC as AU Cmean ∗ 6 − 0.5 ∗ 5)). The estimated per category
AUC of our submission can be seen in Table 3. We noticed that two of the
categories achieved an AUC under 0.5 thus if we negate the scores the AUC
values will flip to the upper half and the adjusted mean AUC will be 0.6548.
Important to mention, that these adjustments only provide us information about
Layer
Input layer
Residual layer 1
Residual layer 2
Residual layer 3
Average pooling 8x8
Output layer
the distinguishing capability of the models (how the model differentiate
negative and positive examples), in a realistic scenario the final decisions would be
still wrong as without any test data we would not know that we need to flip
the scores. During the challenge and afterwards we experimented over the small
training (163 CT scans) and validation (120 CT scans) sets with several models
and aggregation methods. Table 4 show the mean AUC results on the
validation set and the detailed AUC scores can be seen for the left and right lung in
Table 5 and in Table 6 respectively. The method (mean score of CNN) in our
main submission achieved a mean AUC 0.595 on the validation set however the
best method (median score of CNN) performed significantly better with AUC
of 0.642. If we select the best model (ResNet or CNN) with the median score
per category the mean AUC will be similar to the median CNN with 0.659. In
comparison, if we select properly both the model and the aggregation method
for each category the mean AUC increases to 0.686, a significant gain on the
validation set in comparison to the submitted run.
In this paper we described our submission and some additional experiments
over the data set of the ImageCLEFmed 2020 Tuberculosis task. We trained
traditional feed-forward convolutional and residual neural networks over the
individual slices of the CT scans and combined the predictions based on the
importance of the slices according to their position and how well they represent both
of the lungs. We found that median score performed best on average although
in some categories the middle slice score or the mask score outperformed other
aggregation methods. Both ResNet and traditional CNN performed similarly in
our experiments on the validation set while the residual network needed
significantly higher computational power. Our simplest run which was submitted to
the challenge had very low mean AUC score 0.595 meanwhile with additional
aggregations we improved the same method on the validation set to achieve a
mean AUC 0.684. We plan to replace 2D convolutions with 3D convolutions to
take advantage of the complex structure of CT scans. Additionally, we intend to
further expand our experiments with bi-directional Recurrent Neural Networks
(RNN [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]) to read through the CT scans from both ends and classify the
sequence as a whole, utilize Markov Random Fields [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] over the prior predictions
and generate additional samples with slice transition refinement with inter-slice
reconstruction and with category-wise Generative Adversarial Networks [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] to
boost the training procedure. Based on the submissions of other participants
(SenticLab.UAIC mean AUC 0.924 or SDVA-UCSD mean AUC 0.875) we
believe individual slice predictions may not be representative enough to describe
CT scans as a whole to detect Mycobacterium tuberculosis.
5
      </p>
    </sec>
    <sec id="sec-3">
      <title>Acknowledgement</title>
      <p>The publication was supported by the Hungarian Government project
GINOP2.2.1-18-2018-00004: AI based lung cancer diagnosis by chest CT,
2018-1.2.1NKP-00008: Exploring the Mathematical Foundations of Artificial Intelligence,
by the Higher Education Institutional Excellence Program, and by the
Momentum Grant of the Hungarian Academy of Sciences. B.D. was supported by an
MTA Premium Postdoctoral Grant 2018.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. Dar´oczy,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Vaderna</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          , Benczu´r, A.:
          <article-title>Machine learning based session drop prediction in lte networks and its son aspects</article-title>
          .
          <source>In: 2015 IEEE 81st Vehicular Technology Conference (VTC Spring)</source>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          . IEEE (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Dicente</given-names>
            <surname>Cid</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          ,
          <source>Jim´enez del Toro</source>
          ,
          <string-name>
            <given-names>O.A.</given-names>
            ,
            <surname>Depeursinge</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          , Mu¨ller, H.:
          <article-title>Efficient and fully automatic segmentation of the lungs in ct volumes</article-title>
          . In: Goksel,
          <string-name>
            <surname>O.</surname>
          </string-name>
          ,
          <source>Jim´enez del Toro</source>
          ,
          <string-name>
            <surname>O.A.</surname>
          </string-name>
          ,
          <article-title>Foncubierta-Rodr´ıguez,</article-title>
          <string-name>
            <surname>A.</surname>
          </string-name>
          , Mu¨ller, H. (eds.)
          <article-title>Proceedings of the VISCERAL Anatomy Grand Challenge at the 2015 IEEE ISBI</article-title>
          . pp.
          <fpage>31</fpage>
          -
          <lpage>35</lpage>
          . CEUR Workshop Proceedings, CEUR-WS (May
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Goodfellow</surname>
            ,
            <given-names>I.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shlens</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Szegedy</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Explaining and harnessing adversarial examples</article-title>
          .
          <source>arXiv preprint arXiv:1412.6572</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Greff</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Srivastava</surname>
            ,
            <given-names>R.K.</given-names>
          </string-name>
          , Koutn´ık, J.,
          <string-name>
            <surname>Steunebrink</surname>
            ,
            <given-names>B.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidhuber</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Lstm: A search space odyssey</article-title>
          .
          <source>IEEE transactions on neural networks and learning systems 28(10)</source>
          ,
          <fpage>2222</fpage>
          -
          <lpage>2232</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>He</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ren</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
          </string-name>
          , J.:
          <article-title>Deep residual learning for image recognition</article-title>
          .
          <source>In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source>
          . pp.
          <fpage>770</fpage>
          -
          <lpage>778</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Ionescu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          , Mu¨ller, H., P´eteri, R.,
          <string-name>
            <surname>Abacha</surname>
            ,
            <given-names>A.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Datla</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hasan</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>DemnerFushman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kozlovski</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liauchuk</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cid</surname>
            ,
            <given-names>Y.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kovalev</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pelka</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Friedrich</surname>
            ,
            <given-names>C.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>de Herrera</surname>
            ,
            <given-names>A.G.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ninh</surname>
            ,
            <given-names>V.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>T.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Piras</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riegler</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , l Halvorsen,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Tran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.T.</given-names>
            ,
            <surname>Lux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Gurrin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Dang-Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.T.</given-names>
            ,
            <surname>Chamberlain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Campello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Fichou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Berari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Brie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Dogariu</surname>
          </string-name>
          , M.,
          <string-name>
            <given-names>S</given-names>
            ¸tefan, L.D.,
            <surname>Constantin</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.G.</surname>
          </string-name>
          :
          <article-title>Overview of the ImageCLEF 2020: Multimedia Retrieval in Medical, Lifelogging, Nature, and Internet Applications</article-title>
          . In:
          <article-title>Experimental IR Meets Multilinguality, Multimodality, and Interaction</article-title>
          .
          <source>Proceedings of the 11th International Conference of the CLEF Association (CLEF</source>
          <year>2020</year>
          ), vol.
          <volume>12260</volume>
          .
          <source>LNCS Lecture Notes in Computer Science</source>
          , Springer, Thessaloniki,
          <source>Greece (September</source>
          <volume>22</volume>
          -25
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kingma</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ba</surname>
          </string-name>
          , J.:
          <article-title>Adam: A method for stochastic optimization</article-title>
          .
          <source>arXiv preprint arXiv:1412.6980</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Kozlovski</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liauchuk</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Dicente</given-names>
            <surname>Cid</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Tarasau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Kovalev</surname>
          </string-name>
          ,
          <string-name>
            <surname>V.</surname>
          </string-name>
          , Mu¨ller, H.:
          <article-title>Overview of ImageCLEFtuberculosis 2020 - automatic CT-based report generation</article-title>
          .
          <source>In: CLEF2020 Working Notes. CEUR Workshop Proceedings</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>LeCun</surname>
          </string-name>
          , Y.,
          <string-name>
            <surname>Bottou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haffner</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Gradient-based learning applied to document recognition</article-title>
          .
          <source>Proceedings of the IEEE</source>
          <volume>86</volume>
          (
          <issue>11</issue>
          ),
          <fpage>2278</fpage>
          -
          <lpage>2324</lpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Liauchuk</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kovalev</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Imageclef 2017: Supervoxels and co-occurrence for tuberculosis ct image classification</article-title>
          .
          <source>In: CLEF2017 Working Notes. CEUR Workshop Proceedings</source>
          , CEUR-WS, Dublin,
          <source>Ireland (September</source>
          <volume>11</volume>
          -14
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Srivastava</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hinton</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krizhevsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Salakhutdinov</surname>
          </string-name>
          , R.:
          <article-title>Dropout: a simple way to prevent neural networks from overfitting</article-title>
          .
          <source>The journal of machine learning research 15(1)</source>
          ,
          <fpage>1929</fpage>
          -
          <lpage>1958</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>