<!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>S. Bengio, H. M. Wallach, R. Fergus, S. V. N. Vish- ple way to prevent neural networks from over-
wanathan, R. Garnett (Eds.), Advances in Neural iftting, J. Mach. Learn. Res.</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>AI in Video Surveillance: The IM MAGINA Project</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Emanuele Ledda</string-name>
          <email>emanuele.ledda@uniroma1.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lorenzo Putzu</string-name>
          <email>lorenzo.putzu@unica.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Rita Delussu</string-name>
          <email>rita.delussu@unica.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giorgio Fumera</string-name>
          <email>fumera@unica.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabio Roli</string-name>
          <email>fabio.roli@unige.it</email>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Trustworthy AI, Uncertainty Quantification, Monte Carlo Dropout, Dropout Injection, Crowd Counting</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer, Control and Management Engineering, Sapienza University of Rome</institution>
          ,
          <addr-line>Via Ariosto 25, Rome, 00185</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Electric and Electronic Engineering, University of Cagliari</institution>
          ,
          <addr-line>Via Marengo 3, Cagliari, 09100</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Department of Informatics</institution>
          ,
          <addr-line>Bioengineering, Robotics, and Systems Engineering</addr-line>
          ,
          <institution>University of Genova</institution>
          ,
          <addr-line>Via Dodecaneso 35, Genova, 16146</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>and Applications Laboratory (PRALab) of the University</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <volume>15</volume>
      <issue>2014</issue>
      <fpage>29</fpage>
      <lpage>31</lpage>
      <abstract>
        <p>The increasing adoption of machine learning and deep learning models in critical applications raises the issue of ensuring their trustworthiness, which can be addressed by quantifying the uncertainty of their predictions. However, the black-box nature of many such models allows only to quantify uncertainty through ad hoc superstructures, which require to develop and train a model in an uncertainty-aware fashion. However, for applications where previously trained models are already in operation, it would be interesting to develop uncertainty quantification approaches acting as lightweight “plug-ins” that can be applied on top of such models without modifying and re-training them. In this contribution we present a research activity of the Pattern Recognition and Applications Lab of the University of Cagliari related to a recently proposed post hoc uncertainty quantification method, we named dropout injection, which is a variant of the well-known Monte Carlo dropout, and does not require any re-training nor any further gradient descent-based optimization; this makes it a promising, lightweight solution for integrating uncertainty quantification on any theoretically grounded solution to make dropout injection as efective as Monte Carlo dropout through a suitable rescaling of its uncertainty measure; we are also evaluating its efectiveness in the computer vision tasks of crowd counting and density estimation for intelligent video surveillance, thanks to our participation in a project funded by the European Space Agency.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        1. Introduction
have acquired a prominent role in the Artificial
Intelligence (AI) field. One of the main problems arising
from their widespread adoption is the black-box nature of
many ML and DL models. A related issue we are
exploring in our ongoing work is the trustworthiness of their
predictions. One possible approach to tackle this problem
is the introduction of methods for quantifying the
uncertainty of the model’s predictions, which is fundamental
in many critical applications (e.g., healthcare and public
security) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], to provide users with a well-rounded
interpretation of the system’s outputs and raise awareness
of possible errors a DL-based system can make. Many
methods based on principled Bayesian approaches have
been proposed for this purpose, such as Monte-Carlo
dropout [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and ensemble [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] methods. A drawback of
most such methods is that they require an ad hoc training
      </p>
    </sec>
    <sec id="sec-2">
      <title>DL-based system.</title>
      <p>We are currently investigating practical applications of
the post hoc injected dropout method to computer vision.
In particular, we are focusing on the crowd counting
and density estimation tasks related to intelligent video
surveillance, which we addressed in our participation in
the project IMMAGINA (IMaging MAnagement
Guidelines and Informatics Network for law enforcement
Agencies, 2020-2022), funded by the European Space Agency.</p>
      <p>In this application context, uncertainty quantification
can enable end users (e.g., law enforcement operators)
to better interpret the outputs of DL-based tools,
making them aware of unreliable estimates due to, e.g.,
dif</p>
    </sec>
    <sec id="sec-3">
      <title>1https://pralab.diee.unica.it</title>
      <p>ferent operating conditions than the ones represented
category, which means they cannot capture this
depenin training data. We are also studying how to exploit
dence because of their deterministic set of parameters.
uncertainty estimates provided by injected dropout to
One possible solution to make them able to estimate the
automatically improve the accuracy of an already trained
uncertainty of their prediction is using their Bayesian
crowd counting and density estimation model online (i.e.,
extension, namely Bayesian Neural Networks [9, 10]
during operation).
tools devoted to capturing such uncertainty is essential interesting theoretical properties, obtaining the
proba</p>
      <sec id="sec-3-1">
        <title>2. Uncertainty in Neural Networks</title>
        <p>
          Traditional neural networks are usually deterministic
models that associate a point estimate with an input
sample. However, such estimators are far from perfect, and
their mistakes are often noteworthy: hence, developing
in many applications [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ].
types [6]:
        </p>
        <p>Uncertainty sources, in neural networks, can be of two
• Epistemic Uncertainty, caused by lack of
knowledge about the correct model’s parameters;
• Aleatoric Uncertainty, caused by the intrinsic
randomness of the prediction.</p>
        <p>Epistemic uncertainty can be, theoretically, reduced to
zero by collecting enough data, while aleatoric
uncertainty cannot [6]. For example, if one trains a neural
network to predict the outcome of a dice roll no matter
the number of training instances, the inherent
randomness of the stochastic event makes correct outcomes with
zero uncertainty impossible for any prediction model.</p>
        <p>For aleatoric uncertainty quantification, a common
choice is to define metrics upon the probability
distribution ( |, )</p>
        <p>of the outcomes  given the input  and
the model parameters  , such as the entropy [7].
However, although obtaining such measures for classification
problems is straightforward, further superstructures are
necessary for regression [7].</p>
        <p>For epistemic uncertainty quantification, on the other
hand, the problem becomes more complicated: indeed,
for obtaining such a measure in neural networks, a
quantification of the model’s parameters uncertainty is
needed2.</p>
        <sec id="sec-3-1-1">
          <title>2.1. Bayesian Neural Networks</title>
          <p>A well-known approach for dealing with prediction
models’ uncertainty is using Bayesian methods [8]; indeed,
such models output a full probability distribution that
is not only conditioned on the input but also dependent
upon the model parameters distribution. Nevertheless,
traditional neural networks fall into the non-Bayesian
2Neural networks are usually assumed to be capable of learning any
function, so the lack of knowledge of the correct model parameters
is usually considered a proxy for epistemic uncertainty.
(BNN). The output of a BNN can be considered as a
predictive distribution conditioned on the input and the
training data  :
( |, ) =

∫ ( |, ) ⋅ (, )
d,
(1)
where  is the input,  is the output, and  are the
parameters of the model. Although this formulation has
bility distribution of the model’s parameters (, )
infeasible due to the many connections in modern neural
networks. This problem is approached in the literature
is
by substituting the distribution of the parameters (, )
using an approximated distribution ()
[11].</p>
          <p>
            Among the existing approximation strategies, Monte
Carlo Dropout [
            <xref ref-type="bibr" rid="ref2">2</xref>
            ] is one of the most prominent in the
context of BNNs. The dropout technique randomly
deactivates the network neurons with a predefined probability
 . It was initially designed as a stochastic regularization
technique [12], which means one should keep dropout
active only at training time. However, when used as
a Bayesian approximation, dropout is kept active also
at inference time, combined with a set of Monte Carlo
forward passes: this will lead to the construction of the
desired approximated parameters distribution (|)
. If
one extracts a possible set of parameters   from the
distribution of the parameters (|)
at each step  of the 
Monte Carlo forward passes, it is possible to approximate
the predictive distribution as follows:

1
 =1
          </p>
          <p>∑ ( |, 
( |, ) =
 ).</p>
          <p>(2)
After computing the predictive distribution, one should
choose a metric for modeling the predictive uncertainty.
For classification problems, a categorical distribution is
usually employed: for quantifying the model’s
uncertainty, typical choices are predictive entropy, predictive
variance, or mutual information [13, 7]. For regression
problems, instead, one possible option is to assume that
the predictive distribution ( |)
follows a Normal
distribution: in this context, the variance and standard
deviations of the model output are the typical choices for
modeling uncertainty [7].</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>2.2. Dropout Injection</title>
          <p>
            It is essential to note that in the original formulation
of dropout as a Bayesian approximation [
            <xref ref-type="bibr" rid="ref2">2</xref>
            ], dropout is
intended to be activated both for the training and the
testing phase. However, some recent work proposed
using Monte Carlo dropout on arbitrary, already-trained
          </p>
          <p>With this adaptation, we have obtained well-calibrated
uncertainty
measures while keeping relatively low
neural networks, regardless of their use of dropout at
dropout rates (which, when using injected dropout, is
plug-in), and its lightness (no ad hoc training is needed). In this section we show how our implementation of
crucial to avoid damaging the prediction quality).</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>3. Trustworthy Intelligent Video Surveillance</title>
        <p>dropout injection can be practically applied to quantify
the uncertainty of state-of-the-art DL architectures for
crowd counting and density estimation, and how
uncertainty measures can also be exploited to improve their
accuracy.</p>
        <sec id="sec-3-2-1">
          <title>3.1. Crowd Counting and Density</title>
        </sec>
        <sec id="sec-3-2-2">
          <title>Estimation</title>
          <p>training time [14].</p>
          <p>Our ongoing work started from the observation that
such modification can be advantageous compared to the
original version of Monte Carlo dropout because of its
lfexibility (searching from a suitable dropout rate does not
require multiple training), its non-invasivity (acting as a
However, we noticed that this variant of Monte Carlo
dropout has never been comprehensively analyzed or
compared with its original version, neither by the author
proposing this modification [ 14] nor by any following
work using this technique. Taking these considerations
as a starting point, we began our research by analyzing
this technique, which we call dropout injection, and
its main diference from the original version, which we
call embedded dropout.
ing dropout injection [15]. Indeed, it turned out that
such a problem, which is also present to a less extent
in embedded dropout, is amplified by injecting dropout
because a network trained without dropout is less robust
to random neural deactivation (since it has not been
optimized for handling such a circumstance). Without a
suitable rescaling, if the injected dropout rate is too high,
it may result in low-quality prediction; on the other hand,
if it is too low, it will result in almost no variations in
the network output, which would be inefective for
uncertainty estimation. We found that a possible solution
consists of suitably scaling the uncertainty measure. To
this aim, we exploited a technique originally proposed
as a post hoc calibration method for embedded dropout,
named “ -scaling” [16]. Such a scaling technique can
be applied to jointly seek a suitable scaling factor and
dropout rate in a unified optimization problem with no
additional processing cost with respect to the original
one. To this aim, instead of simply minimizing the
negative log-likelihood (NLL) – that, in variational inference,
is used as a proxy for the divergence between the actual
and the approximated distribution [11] – we consider
a proper scaling factor, which can be computed
analytically [16] by using a validation set. This results in finding
the desired dropout rate Φ among all possible values  ,</p>
          <p>1 (  −  ̂ ()) 2

 =1 2 () ⋅  ̂  2()</p>
          <p>2
+</p>
          <p>1 log(() ⋅  ̂  2()) ,
where  is the size of the validation set, ()
timal scale factor, and, finally,   ,  ̂ ()</p>
          <p>and  ̂ 2()
respectively the ground truth, the model’s prediction and
the uncertainty of the  ℎ sample of the validation set.</p>
          <p>is the
opThe first characteristic we observed was the necessity</p>
          <p>Crowd counting and density estimation are computer
viof suitably rescaling the uncertainty measure when us- sion (CV) tasks aimed at estimating the number of people
which minimizes:
Φ = arg min 1 
∑
(3)
are
present in images or video frames and their density map.</p>
          <p>By their nature, the technologies employed for solving
these tasks evolved together with image analysis and
processing, and nowadays, DL models represent the
predominant choice. DL-based crowd counting models can
be categorized into two main approaches [17]:
• detection-based models, which rely on object</p>
          <p>detectors for counting the number of people;
• regression-based models, which first perform
a multi-variate regression to estimate the crowd
density map, whose sum of pixel values
corresponds to the people count.</p>
          <p>In our research, we focus on regression-based
approaches. In this context, the problem can be viewed
as an image-to-image translation problem [20], where
input and output consist of a crowd image and a crowd
density map. The ground truth density map of a training
image is typically obtained by first manually annotating
the head position of each pedestrian. A binary map is
then constructed, containing zero values for each pixel
except for the ones corresponding to the head’s locations,
which are set to one. The density map is finally obtained
by applying to the binary map a convolution with a
kernel with unit area, e.g., a Gaussian (see the example in
equals the sum of all the pixels of the resulting density
map. During inference, a trained model estimates the
density map of input images, and the corresponding
estimate of the crowd count is obtained by summing up its
pixel values.
State-of-the-art DL architectures for regression-based
crowd counting and density estimation do not
incorporate any measure of uncertainty. To this aim, dropout
injection can be implemented during inference to obtain
a full probability distribution for each pixel of the
estimated density map, which is modeled with a Normal
distribution: its mean represents the point prediction,
and we employ its variance as a measure of uncertainty.</p>
          <p>As shown in the example of Fig. 1, this approach provides
an estimated crowd density map and a corresponding
uncertainty map. We obtain the total variance on the
predicted crowd count by summing up all the pixel
values of the uncertainty map. This allows us to compute a
confidence interval on the predicted crowd count. Our
ifrst experiments provided evidence that the accuracy of
the confidence intervals obtained through our
implementation of dropout injection relies on a suitable scaling of
the underlying uncertainty measure. It is worth
pointing out that a pixel-wise uncertainty measure makes it
possible to compute confidence intervals not only for the
whole image but also for sub-regions of it. This feature is
helpful when a video surveillance operator is interested
in monitoring a crowd in a specific region of a video.</p>
        </sec>
        <sec id="sec-3-2-3">
          <title>3.3. Improving Crowd Counting</title>
        </sec>
        <sec id="sec-3-2-4">
          <title>Accuracy through Uncertainty</title>
        </sec>
        <sec id="sec-3-2-5">
          <title>Quantification</title>
          <p>In our ongoing work, we found that dropout injection
could also be helpful for automatically detecting image
regions with no pedestrians but with non-zero estimated
density, which we call “false-positives;” in particular,
from our experiments, it seems that such regions are
characterized by relatively low density values and
relatively high uncertainty. An example is shown in Fig. 2.
Detecting false positive regions would allow us to
automatically reject their contribution to the predicted crowd
count and to the corresponding confidence interval, thus
improving the accuracy of the underlying model. We are
currently investigating a suitable policy for false positive
detection and correction.</p>
        </sec>
        <sec id="sec-3-2-6">
          <title>3.4. The IMMAGINA Project</title>
          <p>The crowd counting and density estimation tasks, that we
used to investigate the injected dropout technique, were
chosen as they were the subjects of previous research
activities by the PRA Lab, involving also the
participation in research projects. The most recent project is
IMMAGINA3 (IMaging MAnagement Guidelines and
Informatics Network for law enforcement Agencies), funded
by the European Space Agency under the ARTES
Integrated Applications Promotion Programme (Nov. 2020 –
Oct. 2022), aimed at exploring applications integrating
space assets and 5G networks, including law enforcement.
Our task was to develop a high-TRL prototype of a
realtime crowd counting and density estimation system, in
the form of a Web application service accessible through
a Web browser both from the control room of a law
enforcement agency (LEA) and from mobile devices (tablets)
of oficers in the field. Our participation in IMMAGINA
helped us to better understand the needs of a relevant
category of potential end users (LEA operators) of AI- and
machine learning-enabled computer vision tools, whose
trustworthiness is crucial for their acceptance in critical,
security-related operational scenarios.</p>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>4. Conclusions and Future Work</title>
        <p>In this contribution, we summarized our ongoing
research on uncertainty quantification related to injected
dropout, a post hoc version of the well-known Monte
Carlo dropout technique. Injected dropout allows
incorporating uncertainty quantification on already-trained
neural networks. We are currently investigating its
application to security-related computer vision tasks, focusing
on regression-based crowd counting and density
estimation methods using deep learning models, thanks to our
participation in the recent IMMAGINA project. In this</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3https://business.esa.int/projects/immagina</title>
      <p>kind of task, an easy-to-interpret representation of the and engineering Of Security of Artificial Intelligence”
uncertainty on the outputs of a machine learning model, (S.O.S. AI) included in the Spoke 3 – Attacks and Defences
besides its bare point prediction, could be beneficial for of the Research and Innovation Program PE00000014,
end users (e.g., LEA operators monitoring crowds in pub- “SEcurity and RIghts in the CyberSpace (SERICS)”,
Nalic spaces), both to better support their decisions and to tional Recovery and Resilience Plan, Mission 4
”Educaimprove their trust in machine learning-based systems. tion and Research” - Component 2 ”From Research to
In particular, we showed how injected dropout allows to Enterprise” - Investment 1.3, funded by the EU –
NextGencompute a pixel-level uncertainty map associated to the erationEU; ELSA – European Lighthouse on Secure and
predicted density map, and a confidence interval on the Safe AI, grant agreement No. 101070617 funded by the
corresponding predicted crowd count. EU. E. Ledda is afiliated with the Italian National PhD</p>
      <p>Looking ahead, based on preliminary empirical evi- in Artificial Intelligence, Sapienza University of Rome.
dence, we are investigating the possibility of automat- He acknowledges the cooperation with and the support
ically improving the accuracy of the predicted density from the PRA Lab of the University of Cagliari.
map and crowd count by exploiting pixel-based
uncertainty quantification, which seems capable of
highlighting “false positive” pedestrian detections in the density References
map. Other interesting directions for future research
include the extension of the scope of our investigation
to further post hoc uncertainty quantification methods,
their application to classification with a reject option, and
the detection of out-of-distribution as well as adversarial
examples.</p>
      <sec id="sec-4-1">
        <title>Acknowledgments</title>
        <p>This work was partially supported by the projects: “Law
Enforcement agencies human factor methods and Toolkit
for the Security and protection of CROWDs in mass
gatherings” (LETSCROWD), Horizon 2020 programme,
grant agreement No. 740466, funded by the EU;
“IMaging MAnagement Guidelines and Informatics Network
for law enforcement Agencies” (IMMAGINA), ARTES
Integrated Applications Promotion Programme, contract
No. 4000133110/20/NL/AF, funded by the ESA; “Science</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Abdar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Pourpanah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hussain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Rezazadegan</surname>
          </string-name>
          , L. Liu,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ghavamzadeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. W.</given-names>
            <surname>Fieguth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Khosravi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U. R.</given-names>
            <surname>Acharya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Makarenkov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Nahavandi</surname>
          </string-name>
          ,
          <article-title>A review of uncertainty quantification in deep learning: Techniques, applications</article-title>
          and challenges,
          <source>Inf. Fusion</source>
          <volume>76</volume>
          (
          <year>2021</year>
          )
          <fpage>243</fpage>
          -
          <lpage>297</lpage>
          .
          <source>doi:1 0 . 1 0 1 6 / j . i n f f u s . 2 0 2 1 . 0 5 . 0 0 8 .</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ghahramani</surname>
          </string-name>
          ,
          <article-title>Dropout as a bayesian approximation: Representing model uncertainty in deep learning</article-title>
          , in: M.
          <string-name>
            <surname>Balcan</surname>
            ,
            <given-names>K. Q.</given-names>
          </string-name>
          <string-name>
            <surname>Weinberger</surname>
          </string-name>
          (Eds.),
          <source>Proc. of the 33nd Int. Conf. on Machine Learning</source>
          ,
          <string-name>
            <surname>ICML</surname>
          </string-name>
          <year>2016</year>
          , New York City, NY, USA, June 19-24,
          <year>2016</year>
          , volume
          <volume>48</volume>
          <source>of JMLR Workshop and Conf. Proc., JMLR.org</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>1050</fpage>
          -
          <lpage>1059</lpage>
          . URL: http://proceedings.mlr.press/v48/gal16.html.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>B.</given-names>
            <surname>Lakshminarayanan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pritzel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Blundell</surname>
          </string-name>
          ,
          <article-title>Simple and scalable predictive uncertainty estimation using deep ensembles</article-title>
          , in: I. Guyon, U. von Luxburg,
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>