<!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>Revealing Lung A ections from CTs. A Comparative Analysis of Various Deep Learning Approaches for Dealing with Volumetric Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Radu Miron</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>Cosmin Moisii</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>Mihaela Elena Breaban</string-name>
          <email>pmihaela@info.uaic.ro</email>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Computer Science, "Alexandru Ioan Cuza" University of Iasi</institution>
          ,
          <country country="RO">Romania</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>SenticLab</institution>
          ,
          <addr-line>Iasi</addr-line>
          ,
          <country country="RO">Romania</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The paper presents and comparatively analyses several deep learning approaches to automatically detect tuberculosis related lesions in lung CTs, in the context of the ImageClef 2020 Tuberculosis task. Three classes of methods, di erent with respect to the way the volumetric data is given as input to neural network-based classi ers are discussed and evaluated. All these come with a rich experimental analysis comprising a variety of neural network architectures, various segmentation algorithms and data augmentation schemes. The reported work belongs to the SenticLab.UAIC team, which obtained the best results in the competition.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>1;2
Medical imaging technologies like Computer Tomography (CT) and Magnetic
Resonance (MR) produce high volumes of data in the form of volumetric
images. The richness of information they provide is essential to correct diagnosis
but brings at the same time new challenges, both for manual/human and
automatic/machine processing: these are not only about the size of the produced
data but also about the complexity of the diagnosis process itself. With respect
to automated diagnosis, the volumetric images, which can be seen both as
matrices of pixels/voxels or series of 2D images (usually called slices), produced
high e ervescence in the deep learning research community, triggering a variety
of new architectures and approaches.</p>
      <p>
        The current paper makes use of deep learning to automatically detect
tuberculosis and related a ections in lung CTs, in the context of the ImageClef
Tuberculosis task [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. We investigate three types of approaches, di erent with
respect to the way the volumetric data is given as input to neural network-based
classi ers. One type, popular among the participants in the previous year
competition [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], is based on reducing the volumetric image to a small set of 2D
projections. Obviously, this approach consistently reduces the size of the data
to be processed by the classi er but inherently may lose important information.
The second type exploits the whole data matrix by using 3D convolutions or by
fusing the information from the slices. The third type, which was ranked as the
winner of the 2020 evaluation session, consists in moving the decision layer from
the whole volume of data to the slice level. All these three di erent approaches
come with a variety of neural network architectures, various segmentation
algorithms and data augmentation schemes. The work reported stays behind the
SenticLab.UAIC team, obtaining the best results in the competition3 [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        The paper is structured as follows. Section 2 describes the challenge and the
dataset. Section 3 describes the approaches developed based on reducing the
volumetric image to 2D projections, starting with the previous year winning
approach reported in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], which we further enhanced to address the 2020 tasks.
Section 4 presents the approaches we used to exploit the whole volumetric
information. Section 5 describes the architectures used to process the information
at slice level and the heuristics used to produce the diagnosis report at the CT
level. Because of the large number of approaches we evaluated, some of them
abandoned earlier (not submitted in the competition) due to poor results on
our local validation data, we report and discuss performance results
immediately after each method description. Section 6 summarises the results for the
best approaches that were evaluated on the blind test set in the competition
and discusses comparatively the performance of the three classes of methods.
Section 7 concludes the paper.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>ImageClef Tuberculosis: tasks, data, evaluation</title>
      <p>The challenge in the 2020 ImageClef Tuberculosis competition is the automatic
detection of tuberculosis and related lesion types in CTs. The CT report to be
generated must contain 3 binary labels for each lung, indicating the presence of
TB lesions in general, the presence of pleurisy and caverns in particular.</p>
      <p>The training dataset consists of 283 CTs. All CTs present at least one lung
affected, 19 have pleurisy and 126 caverns. Because we split each CT into left/right
lungs, this translates to 566 inputs, 444 a ected, 21 with pleurisy and 145 with
caverns.</p>
      <p>The task is therefore a multi-binary classi cation problem, with three target
labels per lung. For each target label the AUC is computed and the ranking is
done on a test set, rst by computing the average AUC and then by the minimum
AUC over the 3 target labels.</p>
      <p>
        We split the data into train/validation in the same fashion as [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] setting apart
every 4th input into the validation set and use this con guration throughout the
competition.
      </p>
      <sec id="sec-2-1">
        <title>3 https://www.imageclef.org/2020/medical/tuberculosis/</title>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Squeezing Volumetric Data: 2D Projections</title>
      <p>
        The 3D matrix representing the volumetric image can be reduced to simpler 2D
representations by traversing it in each of its three dimensions and computing
statistics on numeric vectors. In the case of lungs CTs, a segmentation algorithm
is rstly applied to detect the lungs and eliminate the other parts in the CT.
Further, we used the method proposed in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], where the mean, the maximum
and the standard deviation is computed on each direction, generating three 2D
matrices which can be interpreted as an RGB image (a single 2D image with 3
channels). All the processing steps described in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] are kept: mask erosion,
increasing the voxels intensity in the CT by 1024HU, dividing the mean values and
standard deviations values (red and blue channels) by their maximum, dividing
the maximum values (green channel) by 1500. At the end, for each lung we have
a set of three 2D RGB images, each image corresponding to one of the three
dimensions of the 3D matrix.
3.1
      </p>
      <sec id="sec-3-1">
        <title>The Impact of Segmentation</title>
        <p>
          The rst step behind all our approaches is image segmentation, with the aim
of identifying and isolating each lung in the volumetric image. Because the
performance of further processing is greatly in uenced by the quality of
segmentation (especially in the case of the 2D projection approach where the projections
take into account the entire volume), we tested several segmentation methods.
The organizers provided for all patients two versions of automatically extracted
masks of the lungs: one which relies only on anatomical assumptions [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], and
one based on non-rigid registration [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. Additionally, we used U-net(R231) and
U-net(LTRCLobes) which were pre-trained for lung segmentation on large and
diverse datasets [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] 4. Our experiments show that the rst technique based on
anatomical assumptions behaves much like region growing not being able to
catch holes or necrotic tissue in lungs, the second technique manages to
capture necrotic tissue while the ones based on U-net include airpockets, tumors
and e usions. The ow of the dataset creation together with some projections
corresponding to several segmentation techniques can be seen in g. 1.
        </p>
        <p>
          Feeding a VGG neural network [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] with 2D projections obtained on the
segmented volumetric image, the average AUC scores obtained on our
validation set indicate the registration based method to give the best performance
(AUC=0.693) followed at small distance by U-net(R231) (AUC=0.674) and
U-net(LTRCLobes) (AUC=0.668), but consistently surpassing the
anatomybased method (AUC=0.580).
        </p>
        <p>
          Consequently, all our further experiments use the segmentation provided by
non-rigid registration [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
        </p>
        <sec id="sec-3-1-1">
          <title>4 https://github.com/JoHof/lungmask</title>
          <p>Fig. 1. Projections dataset creation ow using 4 segmentation variants (in order:
growth-based, registration-based, unetLTRCLobes and unetR231). Although the 4
types of projections resulted look only slightly di erent, the di erence in classi
cation scores is signi cant.
3.2</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Data Augmentation</title>
        <p>The images go through a series of augmentations, each with a certain
probability of being applied, including: horizontal and vertical ipping, small degrees
of rotations, blurring, added gaussian noise, distortions, random cropping, and
changing di erent values of hue, saturation or brightness. We used the
Albumentations 5 library for most of these augmentations.
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>The 2D Approach with Preprocessing (PreProcProj )</title>
        <p>
          In an e ort to improve over the last year result, we used the pre-processing
provided in [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], with the aim to eliminate the small vessels from the projection,
thus making the a ected area more obvious. We adopted all the pre-processing
        </p>
        <sec id="sec-3-3-1">
          <title>5 https://github.com/albumentations-team/albumentations</title>
          <p>steps that the authors mention, except the regional maxima calculation. Figure
2 illustrates the di erence between projections with and without further
preprocessing.</p>
          <p>
            For training we chose AlexNet[
            <xref ref-type="bibr" rid="ref10">10</xref>
            ]. The input consists of the three projections
of a volume, on each axis. After extracting features from each projection with
AlexNet, we concatenate all the features, feed them into a linear layer and predict
probabilities for a lung to have a ections, caverns, pleurisy or be healthy. With
this approach we scored an AUC of 0.793 on the test set.
3.4
          </p>
        </sec>
      </sec>
      <sec id="sec-3-4">
        <title>The 2D Approach Scoring the Best (ResNet50Proj )</title>
        <p>
          We further tried di erent variants of Resnet[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] and SqueezeNet[
          <xref ref-type="bibr" rid="ref12">12</xref>
          ].
        </p>
        <p>
          We extracted the lungs using the registration-based segmentations, computed
all 3 projections, split by lung side and processed with the augmentation we
listed in section 3.2. We trained the networks and aggregated the results on
all 3 projections and computed the mean score to obtain the nal results back
at CT level. We tried di erent approaches in aggregating the results including
training a small neural network, but found the simpler mean aggregation to
give the highest score. We thus obtained our highest score in the 2D approach
using a resnet-50 network [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] pretrained on Imagenet[
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] with an AUC on our
hold-out validation set of 0.877; however this result was not submitted. Our
rst submission to the competition was a resnet34 model with no augmentations
which obtained on the hold-out validation set and on the test set the same AUC
score of 0.825. In Figure 3 we can see the AUC progress on di erent models we
tried.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Exploiting Volumetric Data as a Whole</title>
      <sec id="sec-4-1">
        <title>3D Convolutions</title>
        <p>In an attempt to make use of the whole volume at once, we used SqueezeNet in
a 3D version, based on the implementation found in the repository 6. In order
to work with volumes of di erent sizes, we used batch size equal to 1. To handle
volumes with a large number of slices, we used Apex7 library for reducing the
burden on our GPU. In a preliminary experiment we considered only the case
a ected vs. not a ected. We noticed the bad results during the training: after
some epochs the prediction scores stagnated, for all volumes, between 0:4 and
0:6. We concluded that 3D convolutions are not able to capture the important
information on our small training set of volumetric images.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Slices fusion</title>
        <p>In our attempt to associate the entire volumetric image to a label, we constructed
a hybrid approach. We fed the volume slice by slice into a convolutional neural
network, fused the resulted feature maps at channel level and continued with
another small convolutional network into a prediction. The initial convolutional
neural network is composed from the encoder part of a U-net[14] architecture
which was pretrained on a segmentation task at the end of which we applied a
squeeze connection to reduce the number of channels, fused the resulting feature
maps so that the slices processed in parallel by the CNN would now be treated
as channels of a single input, then applied a resnet-like small network to compile
the features into a label. We no longer use the masks to extract the lungs but
instead use a simple threshold based segmentation to compute the boundaries of
the body and crop out the space around the it. We again split by lung side and
used only horizontal ip as a preprocessing. The resulting volume is resized to</p>
        <sec id="sec-4-2-1">
          <title>6 https://github.com/okankop/E cient-3DCNNs</title>
        </sec>
        <sec id="sec-4-2-2">
          <title>7 https://github.com/NVIDIA/apex</title>
          <p>the xed size of (128, 256, 256) The network could then be fed images in batches
multiple of 128 representing the slices of a volume.</p>
          <p>To make maximum use of the GPU memory, we used the Apex library to
train using mixed precision, in a distributed manner on 2 GPUs. We could t 2
times 128 images into the memory corresponding to 2 volumes.</p>
          <p>The approach turned out to be cumbersome. The time to process an epoch
was relatively high and the convergence of the network seemed slow. After 2
days of training we decided to stop and the network reached an AUC of around
0.6 on the hold-out validation set.
5</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Sequencing Volumetric Data: a Slice by Slice</title>
    </sec>
    <sec id="sec-6">
      <title>Classi cation Approach</title>
      <p>Having a closer look at the training set, one can observe that usually the lesions
on the lungs are located only on a small number of slices from the whole volume.
A natural idea is to try a 2D model that could di erentiate between healthy
lung slices and lung slices with lesions (caverns, pleurisy and a ections) and
construct the CT report based on the ndings at slice level. For this purpose we
need training data labeled at slice level and not CT level.</p>
      <p>The rst approach was to try to automatically detect the slices presenting
lesions in the training set, using a lung nodule detector8 constructed by the
winners of a challenge in cancerous nodules detection. The results were bad,
the model not being able to recognize the slices showing caverns although these
correspond to big, obvious regions.</p>
      <p>Therefore, we started to manually select from each volume of the training set
the slices with lesions. We actually found that this was not as time-consuming as
we initially thought, by processing only the volumes labeled with lesions, and it
de nitely was worth the e ort, as the increase in performance shows. The caverns
are usually big and obvious and the a ections are either nodules or dusty lungs
images (which may indicate pneumonia), with very rare cases of pneumotorax
(the lung disappearing due to the outbreak of a cavern). There are many cases
when these lesions appear on a very small number of slices and thus, the two
approaches described in sections 3 and 4 might have not been able to reveal
them.
5.1</p>
      <sec id="sec-6-1">
        <title>InceptionNet</title>
        <p>In our rst tries using the slice by slice approach, we used InceptionNet version
3 [15]. We used the annotated data in di erent ways. Transforming each slice
of a volume into a picture, resizing each image to a size of 299 299, cutting
the picture in half to obtain the two lungs and using vertical ip for all the
pictures which are either a ected, with caverns or with pleurisy, are the data
pre-processing steps for our rst attempt using this approach. This approach</p>
        <sec id="sec-6-1-1">
          <title>8 https://github.com/BCV-Uniandes/LungCancerDiagnosis-pytorch</title>
          <p>does not use the provided segmentation masks at all. We only used 4 labels as
output: a ected, caverns, ok, pleurisy.</p>
          <p>As input for the neural network we used several versions, having all images
as 3-channel images:</p>
          <p>a) NaiveInception. We added a linear layer on top of the last adaptive
average pooling layer of the architecture, keeping the original InceptionNet weights
freezed. With this approach we scored 0.86 AUC score on the test set, surpassing
this way the best approach based on 2D projections.</p>
          <p>b)ThresholdInception. The other approaches consist in using some other
preprocessing steps. This time, when creating the photos from the 3D volume, we
used a Window Width and Window Level equal to 1500, -500 respectively. This
way we improved the results to 0.887 mean AUC and to 0.82 min AUC on the
test set.</p>
          <p>c) TwoPicInception. One other approach consists in mimicking the protocol a
doctor has to follow in order to decide a ections(including caverns) and pleurisy.
In order to see the a ections more clearly, a doctor uses Window Width and
Window Level equal to 1500, -500 respectively, whereas for better visualisation
of pleurisy, a doctor looks at pictures with Window Width and Window Level
equal to 350, 50 respectively. With this thresholding, the liquid surrounding the
pleura becomes more observable. Figure 4 top shows the di erences between the
two pictures.</p>
          <p>In order to use information from 2 pictures during training, we used two
InceptionNet modules, with trainable parameters and concatenated the two
outputs of the adaptive average pooling layer. The decision was made based on
the output of the last linear layer applied on the concatenation discussed above.
With this approach we scored 0.89 mean AUC on the test set.</p>
          <p>d) AttentionInception.We wanted to gain insight into how accurate the
methods can be. We tried to check the predictions produced by the methods proposed
and discovered that the models found in a big proportion correct slices of the
volumes which contained certain a ections. In order to work on the
explainability of our model, we modi ed the structure of ThresholdInception, using the idea
from [16], introducing an attention mechanism. Instead of feeding the output of
the last pooling layer into the linear layer, we used dot product attention [17].
We computed similarity scores between the output of the pooling layer and three
di erent convolutional layers in the architecture. After using the compatibility
scores as weights for the features extracted by the three layers, we concatenated
the new features. Using a linear layer on top, we predicted scores for the 4
categories. After plotting the attention we noticed that the attention on the rst
layer selected highlighted the whole lung area - supporting the idea that we don't
need the segmentation masks, whereas the second layer of attention highlighted
a ections on the lungs. With this approach we scored 0.85 mean AUC. We
believe this lower performance is due to the fact that the attention on the last
layer was not good. Checking the visualisation for that layer we noticed useless
areas highlighted (Fig. 4, bottom). Because of the limit imposed on the number
of submissions, we stopped investigating this direction.</p>
          <p>For all the methods above based on InceptionNet, training was performed for
30 epochs on one GPU Nvidia RTX 2070 with 8GB of memory, using Stochastic
gradient descent optimizer. We divided the learning rate at each 10 epochs by
10 and used binary cross-entropy as loss function.</p>
          <p>In order to establish the diagnosis for a volume we applied the following
heuristic: we applied the inference step on all the pictures/slices from the volume
and for each of the possible classes we took the maximum score encountered; if
only one slice was found with an a ection score higher than 0.8, then we divided
the score of a ected by 2.
5.2</p>
          <p>E</p>
          <p>
            cientNet
In an e ort to use a powerful, yet small footprint network, in our last approaches
we used e cientnet[18], speci cally the b4 variant which has only 19M
parameters but reaches top 1 accuracy of 82,6% on Imagenet. We used a Pytorch
implementation pre-trained on Imagenet[
            <xref ref-type="bibr" rid="ref13">13</xref>
            ].
          </p>
          <p>The preprocessing we used here is similar to the ones we used before and
took place at run-time on load. We applied the registration-based mask per slice
based on a threshold to crop the body and remove much of the surrounding
space, split the lungs into left/right (just by using splitting the image in half)
and applied the same series of augmentations as in the previous approaches. The
split and cropped image has dimension 256 256 and after randomly cropping it
reduces to 224 224. For ease of working we also kept the size of the volumetric
image depth to a xed 128 slices per volume.</p>
          <p>If otherwise speci ed for this approaches as for the others we used a window
level of -500 and range of 1500 corresponding to the most common values used in
areas of acute di ering attenuation values (example: lungs) where air and vessels
will sit side by side.</p>
          <p>As input we tried several options, all of them maintaining 3 channels per
image:</p>
          <p>a) Micro-volumes (MicroVolSlice): The importance of volumetric data is
evident. This seemed especially apparent when we try to manually identify caverns
which can present as rounded or irregularly shaped black centers surrounded
by a white contoure. The caverns can range in size from small with a thin
contoure line to large with thick and di use borders. The small caverns we found
especially hard to identify as it can be confused with a section of a larger blood
vessel. As untrained individuals, to eliminate the confusion we traced the
potential cavern a few slices up or down to verify if it continues into a vessel or forms
a pathology. To try and mitigate this type of confusion in a model we composed
the 3 channels of the image from 3 consecutive (or equidistant) slices. In case
the slice is at the beginning or end of the sequence we simply duplicated it to
ll the channels.</p>
          <p>b) False-color (FalseColorlSlice): To make use of the entire range of values
of an MRI image we established 3 intervals in the Houns eld units range to
correspond to the 3 channels of an image. The window size and level used 9
are (1500, -500) corresponding to the usual values used for lung imaging, (350,
40) called narrow window (used when examining areas of similar attenuation,
for example, soft tissue) and (500, -600) a narrower window of the usual values
for lung imaging in an attempt to retain more information around the values
corresponding to blood vessels and soft tissues. The result with this method
however was not submitted to the site as the result on the hold-out set was
poorer than the others.</p>
        </sec>
        <sec id="sec-6-1-2">
          <title>9 https://radiopaedia.org/articles/windowing-ct</title>
          <p>Fig. 6. The schematic of the slice approach (microvolumes). It follows a simple ow.
The volumetric image, split by left/right side is cropped using a simple threshold
based segmentation, then composed (in this case) to microvolumes, augmented and
passed through the model. The output from all the slices of a side of a volume is then
aggregated and the max per label selected to compose the nal result for a side.
c) Naive (NaivelSlice): The image is simply duplicated into the 3 channels.</p>
          <p>To compile the nal results for each volume we aggregate the individual
results per slice and choose the max of each each label across all the slides,
which are then used to compute the AUC.</p>
          <p>Loss: Cross entropy vs Binary cross entropy : A strange case comes from the
fact that using the CrossEntropyLoss (on a multi-label classi cation) without
softmax before the loss (thus assigning a predominant label for each slice) we
obtained higher results than using BinaryCrossEntropyLoss. The nature of the
results is also very di erent, the rst giving results on the extremes while the
latter hovering around 0.5, but both giving decent results around 90% AUC.</p>
          <p>Micro-volumes and just repeating the image gave similar results on the test
set (92.2% and 92.4% respectively), however the training on the "naive" case
was done on 130 epochs on 3 GPUs with batch 56 3 whereas the
"microvolumes" case was done on 60 epochs on 2 GPUs with batch 56 2. Therefore,
the approach with the highest score on our hold out set was c) the simple one
which also represented the highest of the submitted scores. Our second highest
submitted model is represented by the approach in a) micro-volumes.</p>
          <p>For training we used Nvidia RTX 2070 with 8GB of memory. We again, used
the Apex library from NVidia to train using mixed precision and
DistributedDataParallel with one process per GPU.
6</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Comparative results</title>
      <sec id="sec-7-1">
        <title>Results on the competition test set</title>
        <p>Table 1 summarizes the results obtained in the competition on the test set.
Submissions were made only for the methods based on 2D projections and the
ones based on predictions at slice level; as shown on the hold-out validation
data, the attempts to use the whole volume using 3D convolutions or fusing the
information at slice level did not obtain good results and therefore were not used
in the competition test phase.
By comparing the results both on our hold-out validation set and on the test
set, the following conclusions can be drawn.</p>
        <p>{ As indicated by the low training accuracy, the approaches using the entire
volumetric data as a whole corresponding to the segmented lungs (described
in section 4), involving 3D convolutions or slice fusion, seem to be
overwhelmed by the amount of parameters to t and are not able to identify the
lesions in cases where these are small or present only on a few slices of the
CT, or either converge slowly.
{ The 2D approaches based on projections computed over the segmented
volume (described in section 3) give (unreasonable) good results, which
indicates that simple (normalized) statistics like mean, maximum and standard
deviation, when used together, are able to catch important information about
the presence of lesions in lung CTs. The quality of segmentation of the lungs
is of critical importance in this case, as a bad segmentation may introduce
noise into the projections. After obtaining the set of 2D projections, data
augmentation increased the generalization capability of the classi er.
{ The best approach, surpassing signi cantly the ones based on 2D projections,
exploits all the information present in the segmented volumetric lungs in a
slice-wise manner. Instead of predicting the presence of the a ection per
CT, we predict it for each slice. To obtain the report back at lung level
the probabilities over slices are aggregated by extracting the maximum. An
important pre-processing step consisted in xing the window and range levels
to speci c values used by radiologists when inspecting lung CTs.
7</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>Conclusions</title>
      <p>Volumetric images like CTs and MRIs provide rich information about the
internal body structure, necessary in the diagnosis of many a ections. With the
advancements of neural networks, automatic diagnosis in volumetric images
became possible at high precision, useful for prioritizing patients and assisting
doctors in nal decisions. After a thorough experimental analysis of various
architectures, the current paper devised an approach able to produce highly
accurate CT reports about the presence of tuberculosis related a ections. The
method, based on computing predictions at slice level, has, beside high accuracy
in predicting lesion type, the advantage of o ering more information in terms
of localization of the lesions. With a current mean AUC score of 0.924 on test
data, its performance can be increased if more data, capturing various cases, is
provided in the training phase.
8</p>
    </sec>
    <sec id="sec-9">
      <title>Acknowledgements</title>
      <p>Our strong belief is that data science without domain knowledge can never reach
its full potential. We would like to thank Mirela Iordache, an outstanding
radiologist at the Regional Institute of Oncology in Iasi, for sharing her knowledge
and valuable insights on the medical niche approached in the competition.
14. Olaf Ronneberger, Philipp Fischer, and Thomas Brox. U-net: Convolutional
networks for biomedical image segmentation. In International Conference on
Medical image computing and computer-assisted intervention, pages 234{241. Springer,
2015.
15. Christian Szegedy, Vincent Vanhoucke, Sergey Io e, Jon Shlens, and Zbigniew
Wojna. Rethinking the inception architecture for computer vision. In Proceedings
of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR),
June 2016.
16. Saumya Jetley, Nicholas A Lord, Namhoon Lee, and Philip HS Torr. Learn to pay
attention. arXiv preprint arXiv:1804.02391, 2018.
17. Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. Neural machine
translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473,
2014.
18. Mingxing Tan and Quoc V Le. E cientnet: Rethinking model scaling for
convolutional neural networks. arXiv preprint arXiv:1905.11946, 2019.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Serge</given-names>
            <surname>Kozlovski</surname>
          </string-name>
          , Vitali Liauchuk, Yashin Dicente Cid, Aleh Tarasau, Vassili Kovalev, and
          <article-title>Henning Muller. Overview of ImageCLEFtuberculosis 2020 - automatic CT-based report generation</article-title>
          .
          <source>In CLEF2020 Working Notes, CEUR Workshop Proceedings</source>
          , Thessaloniki, Greece,
          <source>September</source>
          <volume>22</volume>
          -25
          <year>2020</year>
          .
          <article-title>CEUR-WS</article-title>
          .org &lt;http://ceur-ws.
          <source>org&gt;.</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Bogdan</given-names>
            <surname>Ionescu</surname>
          </string-name>
          , Henning Muller, Renaud Peteri, Asma Ben Abacha, Vivek Datla, Sadid A.
          <string-name>
            <surname>Hasan</surname>
          </string-name>
          , Dina Demner-Fushman, Serge Kozlovski, Vitali Liauchuk, Yashin Dicente Cid, Vassili Kovalev, Obioma Pelka,
          <string-name>
            <surname>Christoph M. Friedrich</surname>
          </string-name>
          , Alba Garc a Seco de Herrera,
          <string-name>
            <surname>Van-Tu</surname>
            <given-names>Ninh</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tu-Khiem</surname>
            <given-names>Le</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liting Zhou</surname>
          </string-name>
          , Luca Piras, Michael Riegler, Pal Halvorsen,
          <string-name>
            <surname>Minh-Triet</surname>
            <given-names>Tran</given-names>
          </string-name>
          , Mathias Lux, Cathal Gurrin,
          <string-name>
            <surname>Duc-Tien</surname>
          </string-name>
          Dang-Nguyen, Jon Chamberlain, Adrian Clark, Antonio Campello, Dimitri Fichou, Raul Berari, Paul Brie, Mihai Dogariu, Liviu Daniel Stefan, and Mihai Gabriel Constantin.
          <article-title>Overview of the imageclef 2020: Multimedia retrieval in medical, lifelogging, nature, and internet applications</article-title>
          .
          <source>In Experimental IR Meets Multilinguality, Multimodality, and Interaction</source>
          , volume
          <volume>12260</volume>
          <source>of Proceedings of the 11th International Conference of the CLEF Association (CLEF</source>
          <year>2020</year>
          ), Thessaloniki, Greece,
          <source>September 22-25 2020. LNCS Lecture Notes in Computer Science</source>
          , Springer.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Yashin</given-names>
            <surname>Dicente</surname>
          </string-name>
          <string-name>
            <surname>Cid</surname>
          </string-name>
          , Vitali Liauchuk, Dzmitri Klimuk, Aleh Tarasau, Vassili Kovalev, and
          <article-title>Henning Muller. Overview of imagecleftuberculosis 2019-automatic ctbased report generation and tuberculosis severity assessment</article-title>
          .
          <source>In CLEF (Working Notes)</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Vitali</given-names>
            <surname>Liauchuk</surname>
          </string-name>
          .
          <source>Imageclef</source>
          <year>2019</year>
          :
          <article-title>Projection-based ct image analysis for tb severity scoring and ct report generation</article-title>
          .
          <source>In CLEF (Working Notes)</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Yashin</given-names>
            <surname>Dicente</surname>
          </string-name>
          <string-name>
            <surname>Cid</surname>
          </string-name>
          ,
          <source>Oscar Alfonso Jimenez del Toro</source>
          ,
          <article-title>Adrien Depeursinge, and Henning Muller. E cient and fully automatic segmentation of the lungs in ct volumes</article-title>
          .
          <source>In Orcun Goksel, Oscar Alfonso Jimenez del Toro</source>
          , Antonio FoncubiertaRodr guez, and Henning Muller, editors,
          <source>Proceedings of the VISCERAL Anatomy Grand Challenge at the 2015 IEEE ISBI, CEUR Workshop Proceedings</source>
          , pages
          <volume>31</volume>
          {
          <fpage>35</fpage>
          .
          <string-name>
            <surname>CEUR-WS</surname>
          </string-name>
          , May
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Vitali</given-names>
            <surname>Liauchuk</surname>
          </string-name>
          and
          <string-name>
            <given-names>Vassili</given-names>
            <surname>Kovalev</surname>
          </string-name>
          .
          <source>Imageclef</source>
          <year>2017</year>
          :
          <article-title>Supervoxels and cooccurrence for tuberculosis ct image classi cation</article-title>
          .
          <source>In CLEF2017 Working Notes, CEUR Workshop Proceedings</source>
          , Dublin, Ireland,
          <source>September</source>
          <volume>11</volume>
          -14
          <year>2017</year>
          .
          <article-title>CEUR-WS.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Johannes</given-names>
            <surname>Hofmanninger</surname>
          </string-name>
          , Florian Prayer, Jeanny Pan,
          <string-name>
            <given-names>Sebastian</given-names>
            <surname>Rohrich</surname>
          </string-name>
          , Helmut Prosch, and
          <string-name>
            <given-names>Georg</given-names>
            <surname>Langs</surname>
          </string-name>
          .
          <article-title>Automatic lung segmentation in routine imaging is a data diversity problem, not a methodology problem</article-title>
          .
          <source>arXiv preprint arXiv:2001.11767</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Karen</given-names>
            <surname>Simonyan</surname>
          </string-name>
          and
          <string-name>
            <given-names>Andrew</given-names>
            <surname>Zisserman</surname>
          </string-name>
          .
          <article-title>Very deep convolutional networks for large-scale image recognition</article-title>
          .
          <source>arXiv preprint arXiv:1409.1556</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>Gustavo</given-names>
            <surname>Perez</surname>
          </string-name>
          and
          <string-name>
            <given-names>Pablo</given-names>
            <surname>Arbelaez</surname>
          </string-name>
          .
          <article-title>Automated detection of lung nodules with three-dimensional convolutional neural networks</article-title>
          .
          <source>In 13th international conference on medical information processing and analysis</source>
          , volume
          <volume>10572</volume>
          , page 1057218.
          <source>International Society for Optics and Photonics</source>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Alex</surname>
            <given-names>Krizhevsky</given-names>
          </string-name>
          , Ilya Sutskever, and
          <string-name>
            <surname>Geo</surname>
            rey
            <given-names>E</given-names>
          </string-name>
          <string-name>
            <surname>Hinton</surname>
          </string-name>
          .
          <article-title>Imagenet classi cation with deep convolutional neural networks</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          , pages
          <volume>1097</volume>
          {
          <fpage>1105</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Kaiming</surname>
            <given-names>He</given-names>
          </string-name>
          , Xiangyu Zhang, Shaoqing Ren, and
          <string-name>
            <given-names>Jian</given-names>
            <surname>Sun</surname>
          </string-name>
          .
          <article-title>Deep residual learning for image recognition</article-title>
          .
          <source>In Proceedings of the IEEE conference on computer vision and pattern recognition</source>
          , pages
          <volume>770</volume>
          {
          <fpage>778</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Forrest N Iandola</surname>
            , Song Han, Matthew W Moskewicz, Khalid Ashraf, William J Dally, and
            <given-names>Kurt</given-names>
          </string-name>
          <string-name>
            <surname>Keutzer</surname>
          </string-name>
          . Squeezenet:
          <article-title>Alexnet-level accuracy with 50x fewer parameters and&lt; 0.5 mb model size</article-title>
          .
          <source>arXiv preprint arXiv:1602.07360</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Jia</surname>
            <given-names>Deng</given-names>
          </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.
          <article-title>Imagenet: A large-scale hierarchical image database</article-title>
          .
          <source>In 2009 IEEE conference on computer vision and pattern recognition</source>
          , pages
          <volume>248</volume>
          {
          <fpage>255</fpage>
          .
          <string-name>
            <surname>Ieee</surname>
          </string-name>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>