<!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>Analysing TB Severity Levels With An Enhanced Deep Residual Learning - Depth-Resnet</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Xiaohong Gao</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>Carl James-Reynolds</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>Ed Currie</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>Deep Residual Learning - Depth-Resnet</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Computer Science, Middlesex University</institution>
          ,
          <addr-line>London</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This work responds to the Competition of Tuberculosis Task organised by imageCLEF 2018. While Task #3 appears to be challenging, the experience was very enjoyable. If time had been permitted, it was certain that more accurate results could have been achieved. The authors submitted 2 runs. Based on the given training datasets with severity levels of 1 to 5, an enhanced deep residual learning architecture, depthResNet, is developed and applied to train the datasets to classify 5 categories. The datasets are pre-processed with each volume being segmented into twenty- 128×128×depth blocks with ~64 pixel overlaps. While each block has been predicted with a severity level, assembling all constituent block scores together to give an overall label for the concerned volume tends to be more challenging. Since the probability of high severity is not provided from the training datasets, which bears little resemblance to the classification probability, the submission of probability for the first run was manually assigned as 0.9, 0.7, 0.5, 0.3, and 0.1 to severity levels of 1 to 5 respectively. After the deadline was extended, the model was re-trained with frame numbers increased from 1 to 8, which takes much longer to train. In addition, a new measure was introduced to calculate the overall probability of high severity based on the block scores. As a result, with regard to classification accuracy, the 2nd submitted run achieved place 14 over a total of 36 submissions, a significant improvement from position of 35 from the first run.</p>
      </abstract>
      <kwd-group>
        <kwd>Deep residual learning</kwd>
        <kwd>classification</kwd>
        <kwd>severity of Tuberculosis</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In Figure 1 built on the inception concept, the depth ( ) convolution block operates on the dimensionality
reduced input,   , with a bank of 3D filters,   , . Biases  ∈ ℝ are also applied with initial values of 0 as
formulated in Eq. (1).</p>
      <p>, =   ,   ,1 + 
Hence the residual unit ℱ is expressed in Eq. (2).</p>
      <p>ℱ =  (  ,3 (   (  , ) +  (  ,2 (  ,1  ,1)))
(1)
(2)
where   is affine scaling along depth direction with a bias between 0 and 0.01. This scaling is adaptive to
facilitate generalisation performance and will be learnt during the training of the network. The convolution at
each convolution layer along depth ( ) direction (  , ) takes place between 3 neighbouring slices or feature maps,
i.e. front, current, and back, with a randomly chosen stride (between 1 and 7 in this study). This feature then is
added to the block with a scaling factor as a component of the residual unit. The pooling involves two stages.
The avg-pool occurs for 2D spatial global average pooling whereas max-pool is conducted along z direction
performing global max pooling upon those feature maps.</p>
      <p>On the other hand, to integrate block scores into a volumetric label for each dataset, a support vector machine
(SVM) is applied. The system is implemented in Matlab with MatConvNet [4] toolbox by following standard
ConvNet training procedures [5, 6]. Upon training, 8 slices is chosen from each block with randomly selected
stride between 1 and 7 from 5 categories with a batch of 128 (=16 blocks). At testing time, each dataset
undertakes the same pre-processing procedure to generate 128128depth blocks. Then the trained
depthResnet model (Figure 1) takes each block as a whole, selects 8 slices at equal depth space and propagates these
slices through the trained model to produce a single prediction for this block with severity scores labeled
between 1 and 5.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Datasets</title>
      <p>Data are collected from the competition organised by ImageCLEF2018 on Tuberculosis severity scoring task
(task#3) [7, 8, 9], with 170 for training and 109 for testing. The training data include chest CT scans of TB from
170 patients with the corresponding severity scores (1 to 5) and the severity levels designated as "high" and
"low", which contains 90 low severity (with scores 4 and 5) and 80 high severity (with scores 1, 2 and 3).</p>
    </sec>
    <sec id="sec-3">
      <title>3. Image Pre-processing</title>
      <p>
        The collected data are pre-processed to remove background and to segment into smaller blocks, which is
because that most abnormalities occur in small regions and spread over only a few slices. Figure 2 demonstrates
the process to remove background by the application of masks that are dilated in advance. As illustrated in
Figure 2 (b), some masks [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] over-remove lung information. Hence all the masks are dilated (Figure 2(d)) by a
diameter of 30 pixels found empirically to ensure the balance between over- and under- removing of
background (Figure 2(e)). Figure 2(f) depicts the final image of removing background, which has a size of
460 × 340 ×  (z is the depth and varies between 50 to 400).
      </p>
      <p>Then upon the segmented volume of 460 × 340 ×  , 24 blocks of size of 128 × 128 ×  are created with
overlapping of ~64 pixels as illustrated in Figure 3.
frames, in particular at front and back of a volume along  direction, are removed when its background region
occupies more than one third of the total space. Hence the depth ( ) of each block varies between 11 and 250 for
all datasets after segmentation. As a result, many 3D volume datasets have less than 24 blocks after
preprocessing. Each block has been resized to 256256 from 128128 to save training time.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <p>Since each volume of 3D dataset contains around 24 blocks with individual severity scores, the final score for
this dataset has to be integrated. In principle, the five levels of severity can be treated as 2 classes labeled as
‘high’ (with scores 1, 2 and 3) and ‘low’ (with scores 4 and 5). Hence, three measures can then be formulated to
convey the inter-relationships between blocks scored 1 to 3, 4 to 5 and 1 to 5 are then calculated using Eqs. (3),
(4) and (5) respectively where scores of 1 to 5 are assigned initial probabilities of high severity linearly by 0.9,
0.7, 0.5, 0.3, and 0.1 respectively.
Hence the probability of a whole volume dataset can then be decided by these measures, which is in turn utilized
to score the overall severity of a volume. For example, in this study, if a dataset has 
 ℎ ℎ &gt; 0.7 and
&lt; 0.20 and</p>
      <p>1 &gt; 0 , then this dataset is classified as severity 1. In Table 1, two
approaches are applied. One is based on the overall probability (Level-1) as formulated in Eq. (5), which is
simple and straightforward. Level 1 approach has been applied to the imageCLEF Tuberculosis 2018
competition [8, 9], which ranks number 14 (out of 36 submissions) in terms of accuracy (AUC=0.6534) by the
authors of this paper when using different set of test data (n=109) with unknown severity levels. These results
are based on three runs using training datasets where 100 data are randomly selected from 170 training sets and
remaining 70 as test.</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>Prediction of probability of high severity level appears to be a challenging task since this information has to be
determined from the severity scores of 1 to 5. Due to the limited computer power (with only 1 GPU), each run
takes 4 days to train (100 datasets) and 2 days to test, the results from Level-2 approach were only obtained after
the deadline. However, the experience gained from this competition was very enjoyable with many lessons
learnt in relation to designing deep residual learning network.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <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>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Identity</surname>
            <given-names>Mappings</given-names>
          </string-name>
          <source>in Deep Residual Networks, European Conference on Computer Vision</source>
          (ECCV) (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <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>
            <given-names>J</given-names>
          </string-name>
          ,
          <article-title>Deep Residual Learning for Image Recognition</article-title>
          ,
          <source>IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Feichtenhofer</surname>
            <given-names>C</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pinz</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wildes</surname>
            <given-names>R</given-names>
          </string-name>
          ,
          <article-title>Temporal Residual Networks for Dynamic Scene Recognition</article-title>
          ,
          <source>IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</source>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          MatConvNet: http://www.vlfeat.org/matconvnet/. Retrieved in May (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>LeCun</surname>
            <given-names>Y</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            <given-names>Y</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hinton</surname>
            <given-names>G</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deep</surname>
            <given-names>Learning</given-names>
          </string-name>
          ,
          <source>Nature</source>
          .
          <volume>521</volume>
          :
          <fpage>436</fpage>
          -
          <lpage>444</lpage>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <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>Hinton</surname>
            <given-names>G</given-names>
          </string-name>
          .
          <article-title>Imagenet classification with deep convolutional neural networks</article-title>
          ,
          <source>Advances in neural information processing systems 2012. NIPS</source>
          <year>2012</year>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>Cappellato L.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Nie</surname>
          </string-name>
          <string-name>
            <given-names>J</given-names>
            ,
            <surname>Soulier</surname>
          </string-name>
          <string-name>
            <surname>L</surname>
          </string-name>
          , Eds., CLEF 2018 Working Notes, Working Notes of CLEF 2018 -
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          , CEUR-WS, Eds. (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Dicente Cid</surname>
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liauchuk</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kovalev</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Müller</surname>
            <given-names>H.</given-names>
          </string-name>
          ,
          <article-title>Overview of ImageCLEFtuberculosis 2018 - Detecting multi-drug resistance, classifying tuberculosis type, and assessing severity score</article-title>
          ,
          <source>CLEF working notes, CEUR</source>
          ,
          <year>2018</year>
          ., CEUR-WS.org,
          <source>September</source>
          <volume>10</volume>
          -14, Avignon, France (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Ionescu</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Müller</surname>
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villegas</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>de Herrera</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eickhoff</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Andrearczyk</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cid</surname>
            <given-names>Y.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liauchuk</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kovalev</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hasan</surname>
            <given-names>S.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ling</surname>
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Farri</surname>
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lungren</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dang-Nguyen</surname>
            <given-names>DT</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>
          ,
          <string-name>
            <surname>Zhou</surname>
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lux</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gurrin</surname>
            <given-names>C.</given-names>
          </string-name>
          , Overview of ImageCLEF 2018:
          <article-title>Challenges, Datasets and Evaluation, Experimental IR Meets Multilinguality</article-title>
          , Multimodality, and
          <string-name>
            <surname>Interaction</surname>
          </string-name>
          ,
          <source>Proceedings of the Ninth International Conference of the CLEF Association (CLEF</source>
          <year>2018</year>
          ),
          <source>September 10-14</source>
          , Avignon, France (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Cid</surname>
            <given-names>YD</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jiménez-del-Toro</surname>
            <given-names>OA</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Depeursinge</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Müller</surname>
            <given-names>H</given-names>
          </string-name>
          ,
          <article-title>Efficient and fully automatic segmentation of the lungs in CT volumes</article-title>
          . In: Goksel,
          <string-name>
            <surname>O.</surname>
          </string-name>
          , et al. (eds.)
          <source>Proceedings of the VISCERAL Challenge at ISBI. No. 1390 in CEUR Workshop Proceedings</source>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>