<!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>Early and Late Fusion of Classifiers for the MediaEval Medico Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mario Taschwer</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Manfred Jürgen Primus</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Klaus Schoefmann</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oge Marques</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Florida Atlantic University (FAU)</institution>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Klagenfurt University (AAU)</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>29</fpage>
      <lpage>31</lpage>
      <abstract>
        <p>In this paper we present our results for the MediaEval 2018 Medico task, achieved with traditional machine learning methods, such as logistic regression, support vector machines, and random forests. Before classification, we combine traditional global image features and CNN-based features (early fusion), and apply soft voting for combining the output of multiple classifiers (late fusion). Linear support vector machines turn out to provide both good classification performance and low run-time complexity for this task.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        The Medico task at MediaEval 2018 [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] addresses the problem of
predicting a predefined set of diseases and findings in endoscopic
images of the gastrointestinal (GI) tract of the human body.
Participating teams are provided with a development set of 5293 images
labeled with 16 diferent classes by medical experts specialized in GI
inspection. The development set has been sampled from Kvasir [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]
and Nerthus [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] video datasets. Teams are supposed to develop
classifiers that are able to predict these classes on unseen images with
low run time complexity. Task organizers evaluate and compare
submitted approaches based on two main measures: (1)
correlation between predictions on the test set and ground truth, using
Matthews correlation coeficient (MCC) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], and (2) required
processing time of predictions. The imbalance and sparsity of the
training set (see Fig. 1) poses a particular challenge of this task.
      </p>
    </sec>
    <sec id="sec-2">
      <title>APPROACH</title>
      <p>
        To address the research objectives described in Section 1, we chose
to train traditional machine learning algorithms only [
        <xref ref-type="bibr" rid="ref12 ref3">3, 12</xref>
        ], but
combine them with each other and with CNN-based feature
extraction using a two-level fusion strategy: (1) early fusion of feature
vectors by concatenating them; and (2) late fusion of classifiers by
averaging their predicted class probabilities.
      </p>
      <p>
        Early fusion of feature vectors created by diferent feature
extraction methods increases the dimensionality of the feature space
and improves the likelihood that binary classification problems are
linearly separable. On the other hand, increasing feature
dimensionality will reduce the run-time eficiency of machine learning
algorithms. To cope with this trade-of, we selected a sensible
combination taken from the following feature sets of the given endoscopic
image dataset: LIRE – traditional global image features extracted
using the LIRE library [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], as provided by Medico task organizers
(1185-dimensional after concatenation); GoogLeNet – output of the
last hidden layer of GoogLeNet CNN [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], trained on ImageNet
(1024-dimensional); SurgicalAction – output of the last hidden layer
of GoogLeNet CNN, trained on a dataset of laparoscopic surgery
videos for detecting surgical actions in gynecologic laparoscopy [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]
(1024-dimensional).
      </p>
      <p>
        Preliminary cross-validation experiments on the training dataset
indicated that LIRE and GoogLeNet features performed significantly
better than SurgicalAction features, consistently across diferent
classifiers. Moreover, early fusion (concatenation) of LIRE and
GoogLeNet features (2209-dimensional) further improved
crossvalidation scores, but no additional improvement was observed
when combining all three feature sets. Therefore, we decided to use
only the 2209-dimensional feature set for all further experiments
producing detection runs for the Medico task. Each feature
dimension was centered (by subtracting the mean) and scaled to the range
[
        <xref ref-type="bibr" rid="ref1">−1, 1</xref>
        ] before fed into classifiers.
      </p>
      <p>Due to the low number of training samples (see Fig. 1) compared
to the dimensionality of the feature space, traditional linear
classifiers have the potential to provide a sensible trade-of between
efectiveness (classification performance) and eficiency (run-time
complexity). We therefore included two linear classifiers, logistic
regression (LR) and linear support vector machine (LSVM), into
our experiments, but also chose two non-linear classifiers for
comparison, namely random forests (RF) and kernel support-vector
machine (KSVM) with a radial basis function (RBF) kernel.
Multinomial logistic regression and random forests implicitly support
multi-class classification, whereas support-vector machines (SVMs)
were used in a one-versus-rest (OVR) ensemble to support multiple
classes.</p>
      <p>Table 1 lists the classifiers used for our submitted runs, including
information on decision boundaries, tuned hyper-parameters,
multiclass strategy, support for class probabilities, and obtained
crossvalidation (CV) scores on the development set. Hyper-parameters
include the regularization parameter C (lower values mean stronger
regularization), the width γ of the RBF kernel, and number n and
maximal depth k of decision trees for random forests.</p>
      <p>
        Hyper-parameters of chosen classifiers were optimized
independently using grid search in the parameter space and 4-fold
crossvalidation on the development set provided by task organizers. As
objective function for optimization the mean MCC [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] was used.
After hyper-parameter selection, final classification models were
trained on the entire development dataset, without using additional
training data.
      </p>
      <p>
        To combine the output of several classifiers (late fusion),
various well-known ensemble methods exist in the literature [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. If
classification performances of component classifiers are similar
(as for the classifiers listed in Table 1), a simple approach to late
fusion, called soft voting, is often efective. For a given test instance,
soft voting computes average probabilities for each class over all
component classifiers and finally predicts the class with maximal
average probability.
      </p>
      <p>
        Note that only two of the chosen classifiers naturally provide
class probabilities for prediction (LR and RF), whereas SVMs do
not. However, with additional run-time cost, confidence scores
produced by SVMs can be transformed into class probabilities using
Platt scaling [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Since we used the Scikit-learn Python framework
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] to perform classification experiments and Platt scaling was
implemented only for KSVM but not for LSVM, we considered
only three of the chosen classifiers (LR, RF, KSVM) for late fusion
experiments.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>RESULTS</title>
      <p>We submitted five runs with predictions for the test set (8740 images)
to Medico task organizers for evaluation: one for each classifier
listed in Table 1, and a late fusion run combining the output of
RF, KSVM, and LR classifiers. Table 2 lists some of the evaluation
metrics obtained by oficial evaluation of our runs as well as mean
prediction times per image (in milliseconds) on the test set measured
on commodity PC hardware (Intel Core2 E8400 CPU @ 3 GHz,
8 GB RAM, no GPU usage). Note that prediction times do not
include feature extraction and model loading times, but refer to
the time span needed to perform feature scaling and prediction
of classes and class probabilities (if applicable), including the total
time needed to apply an ensemble of classifiers (RF, SVM in OVR
mode, RF-KSVM-LR fusion). Prediction times have been measured
three times and the average value is reported in the table. Since
feature extraction and prediction were performed with diferent
software and in batch mode, investigation of real-time processing
capabilities of the proposed approach for online video processing
would need further experiments.</p>
    </sec>
    <sec id="sec-4">
      <title>DISCUSSION AND CONCLUSIONS</title>
      <p>All submitted runs display comparable classification performances
on the test set, except for RF, which shows a slightly degraded
performance. We explain this by a possible over-regularization due
to limiting the maximal tree depth to 30 during training.</p>
      <p>Remarkably, LSVM displays a slight advantage with respect to
classification performance in comparison to all other runs,
including the late fusion approach (RF-KSVM-LR). Moreover, the slight
advantage of LSVM turns into a substantial gain when taking also
run-time eficiency into account. The high computational costs
of KSVM and of RF-KSVM-LR are mostly due to expensive Platt
scaling.</p>
      <p>When comparing test results to cross-validation scores on the
development set (see Table 1), it may come as a surprise that
classification performance has improved on the test set. We explain
this efect by the imbalance and sparsity of training data (Fig. 1),
as the stratified sampling strategy for selecting the folds during
cross-validation often leads to incomplete training folds (missing
rare classes).</p>
      <p>
        In addition to approaches used for run submission, we also
experimented with a hierarchical classifier following the nested
dichotomies approach [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], which trains binary classifiers arranged
in a binary tree by recursively dividing the set of classes (and
corresponding training samples) into two subsets. However,
crossvalidation classification performance on the development set was
so poor that we excluded this classifier from further experiments.
We attribute this failure to the sparsity of training samples, leading
to underfitting of several binary classifiers in the tree.
      </p>
      <p>In conclusion, this paper has provided a compelling example of
the usefulness of traditional machine learning techniques when
combined with CNN-based feature extraction methods for
predicting a predefined set of diseases and findings in endoscopic images
of the GI tract of the human body. Experiments revealed that both
linear support-vector machines and multinomial logistic regression
are able to deliver good classification performance at a low run-time
complexity in a high-dimensional feature space, learning eficiently
from an imbalanced and sparse training set. A more detailed
analysis of our approach and a comparison to other submissions will be
possible when ground truth labels of the test set and results of all
participants have been published.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Sabri</given-names>
            <surname>Boughorbel</surname>
          </string-name>
          , Fethi Jarray, and
          <string-name>
            <surname>Mohammed</surname>
          </string-name>
          El-Anbari.
          <year>2017</year>
          .
          <article-title>Optimal classifier for imbalanced data using Matthews Correlation Coeficient metric</article-title>
          .
          <source>PloS one 12</source>
          ,
          <issue>6</issue>
          (
          <year>2017</year>
          ),
          <year>e0177678</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Eibe</given-names>
            <surname>Frank</surname>
          </string-name>
          and
          <string-name>
            <given-names>Stefan</given-names>
            <surname>Kramer</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>Ensembles of Nested Dichotomies for Multi-class Problems</article-title>
          .
          <source>In Proceedings of the Twenty-first International Conference on Machine Learning (ICML '04)</source>
          . ACM,
          <volume>39</volume>
          -
          <fpage>46</fpage>
          . https://doi.org/10.1145/1015330.1015363
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Aurélien</given-names>
            <surname>Géron</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Hands-on machine learning with Scikit-Learn and TensorFlow: concepts, tools, and techniques to build intelligent systems.</article-title>
          <string-name>
            <surname>O'Reilly Media</surname>
          </string-name>
          , Inc.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Mathias</given-names>
            <surname>Lux and Savvas A Chatzichristofis</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Lire: Lucene image retrieval: an extensible Java CBIR library</article-title>
          .
          <source>In Proceedings of the 16th ACM international conference on Multimedia. ACM</source>
          ,
          <volume>1085</volume>
          -
          <fpage>1088</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Stefan</given-names>
            <surname>Petscharnig</surname>
          </string-name>
          and
          <string-name>
            <given-names>Klaus</given-names>
            <surname>Schöfmann</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Learning laparoscopic video shot classification for gynecological surgery</article-title>
          .
          <source>Multimedia Tools and Applications</source>
          <volume>77</volume>
          ,
          <issue>7</issue>
          (
          <year>2018</year>
          ),
          <fpage>8061</fpage>
          -
          <lpage>8079</lpage>
          . https://doi.org/10.1007/ s11042-017-4699-5
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>John</given-names>
            <surname>Platt</surname>
          </string-name>
          .
          <year>1999</year>
          .
          <article-title>Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods</article-title>
          .
          <source>Advances in large margin classifiers 10</source>
          ,
          <issue>3</issue>
          (
          <year>1999</year>
          ),
          <fpage>61</fpage>
          -
          <lpage>74</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Konstantin</given-names>
            <surname>Pogorelov</surname>
          </string-name>
          , Kristin Ranheim Randel, Thomas de Lange, Sigrun Losada Eskeland, Carsten Griwodz, Dag Johansen, Concetto Spampinato, Mario Taschwer, Mathias Lux, Peter Thelin Schmidt,
          <string-name>
            <given-names>Michael</given-names>
            <surname>Riegler</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Pål</given-names>
            <surname>Halvorsen</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Nerthus: A Bowel Preparation Quality Video Dataset</article-title>
          .
          <source>In Proceedings of the 8th ACM on Multimedia Systems Conference. ACM</source>
          ,
          <volume>170</volume>
          -
          <fpage>174</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Konstantin</given-names>
            <surname>Pogorelov</surname>
          </string-name>
          , Kristin Ranheim Randel, Carsten Griwodz, Sigrun Losada Eskeland, Thomas de Lange, Dag Johansen, Concetto Spampinato,
          <string-name>
            <surname>Duc-Tien</surname>
            Dang-Nguyen, Mathias Lux, Peter Thelin Schmidt,
            <given-names>Michael</given-names>
          </string-name>
          <string-name>
            <surname>Riegler</surname>
            , and
            <given-names>Pål</given-names>
          </string-name>
          <string-name>
            <surname>Halvorsen</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Kvasir: A MultiClass Image Dataset for Computer Aided Gastrointestinal Disease Detection</article-title>
          .
          <source>In Proceedings of the 8th ACM on Multimedia Systems Conference. ACM</source>
          ,
          <volume>164</volume>
          -
          <fpage>169</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Konstantin</given-names>
            <surname>Pogorelov</surname>
          </string-name>
          , Michael Riegler, Pål Halvorsen, Thomas de Lange, Kristin Ranheim Randel,
          <string-name>
            <surname>Duc-Tien</surname>
            Dang-Nguyen,
            <given-names>Mathias</given-names>
          </string-name>
          <string-name>
            <surname>Lux</surname>
            , and
            <given-names>Olga</given-names>
          </string-name>
          <string-name>
            <surname>Ostroukhova</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Medico Multimedia Task at MediaEval 2018</article-title>
          . In MediaEval 2018 Working Notes.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Omer</given-names>
            <surname>Sagi</surname>
          </string-name>
          and
          <string-name>
            <given-names>Lior</given-names>
            <surname>Rokach</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Ensemble learning: A survey</article-title>
          .
          <source>Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery</source>
          <volume>8</volume>
          ,
          <issue>4</issue>
          (
          <year>2018</year>
          ),
          <year>e1249</year>
          . https://doi.org/10.1002/widm.1249
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Christian</surname>
            <given-names>Szegedy</given-names>
          </string-name>
          , Wei Liu, Yangqing Jia,
          <string-name>
            <given-names>Pierre</given-names>
            <surname>Sermanet</surname>
          </string-name>
          , Scott Reed, Dragomir Anguelov, Dumitru Erhan, Vincent Vanhoucke, and
          <string-name>
            <given-names>Andrew</given-names>
            <surname>Rabinovich</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Going deeper with convolutions</article-title>
          .
          <source>In Proc. of the IEEE conference on computer vision and pattern recognition. 1-9.</source>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Ian</surname>
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Witten</surname>
            , Eibe Frank, and
            <given-names>Mark A.</given-names>
          </string-name>
          <string-name>
            <surname>Hall</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Data Mining: Practical Machine Learning Tools and Techniques (3rd ed</article-title>
          .). Morgan Kaufmann.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>