<!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>Complex Data Challenges in Earth
Observation, November</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>A Variational U-Net for Weather Forecasting</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Pak Hay Kwok</string-name>
          <email>1pak_hay_kwok@hotmail.com</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Qi Qi</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2021</year>
      </pub-date>
      <volume>1</volume>
      <issue>2021</issue>
      <abstract>
        <p>Not only can discovering patterns and insights from atmospheric data enable more accurate weather predictions, but it may also provide valuable information to help tackle climate change. Weather4cast is an open competition that aims to evaluate machine learning algorithms' capability to predict future atmospheric states. Here, we describe our third-place solution to Weather4cast. We present a novel Variational U-Net that combines a Variational Autoencoder's ability to consider the probabilistic nature of data with a U-Net's ability to recover fine-grained details. This solution is an evolution from our fourth-place solution to Trafic4cast 2020 with many commonalities, suggesting its applicability to vastly diferent domains, such as weather and trafic. The code for this solution is available at https://github.com/qiq208/weather4cast2021_Stage1 R1-3 correspond to the core challenge in which training, validation and test data are provided, while regions R4-6 Meteorological satellites around the globe are constantly correspond to the transfer learning challenge in which gathering a trove of data about the atmosphere. How- only the test data are provided. In addition, static inforever, the high-dimensionality nature of atmospheric data mation, such as altitude, latitude and longitude, are also makes it challenging to analyse, hindering the discovery given for all regions. of valuable insights. With the advent of machine learning Weather4cast demands an algorithm that can return methods, it is believed these methods can help better un- the atmospheric states over the defined regions for the derstand atmospheric data. To evaluate the applicability next 8 hours (32-of 15-minute intervals) given an hour of such techniques to atmospheric data, Weather4cast (4-of 15-minute intervals) worth of data. While only 4 [1] by the Institute of Advanced Research in Artificial target variables are required, namely  (a Intelligence is an open competition that challenges its channel of CTTH), _ (a channel of CRR), participants to develop algorithms to predict the future ___ (a channel of ASII-TF) and  (a states of the atmosphere over specific regions. channel of CMA), any channels of the weather products The Weather4cast dataset [2] is obtained from Me- or static information of the regions can be used as input teosat geostationary meteorological satellites operated variables. by EUMETSAT for the period from February 2019 to This work describes a novel Variational U-Net soluFebruary 2021. The Meteosat images are processed by tion which achieved third place in both the core and NWC SAF software into weather products. The weather transfer learning challenges of Weather4cast. This Variaproducts of interest are: Cloud Top Temperature and tional U-Net can be viewed as a U-Net with a Variational Height (CTTH), Convective Rainfall Rate (CRR), Auto- Autoencoder (VAE) style bottleneck, or as a VAE with matic Satellite Image Interpretation - Tropopause Folding U-Net style skip connections. The intuition behind this detection (ASII-TF), Cloud Mask (CMA), and Cloud Type architecture is to combined VAE's ability to consider the (CT). Each of these weather products is recorded in 15- probabilistic nature of data with U-Net's ability to recover minute intervals and consists of multiple channels. Each ifne-grained details. channel is in the format of an image of shape 256x256 pixels, with each pixel covering an area of about 4x4 km. The regions of interest are illustrated in Figure 1; regions 2. Related work</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;IARAI</kwd>
        <kwd>Trafic4cast</kwd>
        <kwd>Weather4cast</kwd>
        <kwd>U-Net</kwd>
        <kwd>Variational Autoencoder</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <sec id="sec-1-1">
        <title>Weather4cast can be viewed as a video frame prediction</title>
        <p>
          problem, in which the inputs are the first 4 frames of a
video, and the outputs are the subsequent 32 frames. This
format of the problem is identical to that of Trafic4cast
[
          <xref ref-type="bibr" rid="ref10 ref11">3, 4</xref>
          ]. Overlooking the diference in domains between
Weather4cast and Trafic4cast, the two competitions can
be considered the same, hence solutions for Trafic4cast
should be somewhat transferable to Weather4cast. A
range of algorithms, including U-Net, LSTM and Graph
Neural Network were proposed for Trafic4cast [
          <xref ref-type="bibr" rid="ref12 ref13">5, 6</xref>
          ],
yet various flavours of U-Net dominated the competition
in both 2019 and 2020, with all winning teams adopting
U-Nets in their final solutions [
          <xref ref-type="bibr" rid="ref1 ref12">5, 7</xref>
          ]. Thus, it is sensible
to consider U-Net-based solutions for Weather4cast.
        </p>
        <p>
          While the formats of Weather4cast and Trafic4cast
are equivalent, the diferences in the underlying domains
cannot be ignored. Specifically, weather is considered
more random than trafic. Multiple scenarios are possible
given a set of observations, and this inherent randomness
needs particular attention, as it is not compatible with
the deterministic nature of a typical U-Net. Segmentation
of medical images also sufers from intrinsic ambiguities.
To handle these ambiguities, Kohl et al. [
          <xref ref-type="bibr" rid="ref2">8</xref>
          ] proposed
a Probabilistic U-Net, a combination of a U-Net with
a conditional VAE, capable of producing an unlimited
number of hypotheses from a set of inputs. Myronenko
[
          <xref ref-type="bibr" rid="ref3">9</xref>
          ] also proposed a diferent way to combine a U-Net with
a VAE, which a VAE was applied to regularise a shared
encoder. His solution was proven successful and won
ifrst place in the Multimodal Brain Tumour Segmentation
Challenge (BraTS) in 2018.
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>3. Methods</title>
      <sec id="sec-2-1">
        <title>3.1. Model architecture</title>
        <sec id="sec-2-1-1">
          <title>Given the similarities between Weather4cast and Traf</title>
          <p>
            ifc4cast, the main structure of the proposed Variational
U-Net largely resembles the authors’ fourth-place
solution to last year’s Trafic4cast [
            <xref ref-type="bibr" rid="ref12">5</xref>
            ]. The encoder is made
up of Dense Blocks connected by 2D Max Pooling. Each
Dense Block consists of 4 repeats of 2D Convolution, ELU
[
            <xref ref-type="bibr" rid="ref4">10</xref>
            ], Group Normalisation [
            <xref ref-type="bibr" rid="ref5">11</xref>
            ] and 2D Dropout [
            <xref ref-type="bibr" rid="ref6">12</xref>
            ],
followed by another 2D Convolution and ELU. Diferent to
the encoder, the decoder consists of repeats of 2D
Transposed Convolution, ELU, 2D Convolution, ELU, Group
Normalisation and 2D Dropout. The encoder and the
decoder are joined by skip connections.
          </p>
          <p>
            Inspired by the works of Kohl et al. [
            <xref ref-type="bibr" rid="ref2">8</xref>
            ] and Myronenko
[
            <xref ref-type="bibr" rid="ref3">9</xref>
            ], the bottleneck of the Variational U-Net, the part
which connects the end of the encoder to the start of the
decoder, is replaced with one that is typically found in
VAE. At the end of the encoder, the input is reduced to 2
vectors of size 512, representing the means and standard
deviations of the latent variables. With the assumption
that the latent variables are Gaussian, a sample is drawn,
and the drawn vector is reconstructed into an image
which is then passed through the decoder.
          </p>
          <p>The architecture of the Variational U-Net is shown in
Figure 2.</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>3.2. Inputs and target variables</title>
        <p>
          Similar to the authors’ Trafic4cast solution [
          <xref ref-type="bibr" rid="ref12">5</xref>
          ], the
temporal dimension of the input tensor is combined with
the channel dimension, resulting in the number of input
channels of 4*8. Furthermore, since it seems intuitive that
weather patterns are dependent on geographical location,
the static features of altitude, latitude and longitude are
appended, resulting in an additional 3 input channels. As
such, the final number of input channels to the
Variational U-Net is 4*8+3=35. Finally, the model is designed
to predict all 32 output frames in one go, resulting in the
number of output channels being 32*4=128. Furthermore,
any missing data has been zero-filled.
        </p>
        <p>A series of experiments were performed to find the
most efective set of input features, and the validation set
was used to evaluate the performance of each feature set.
The resulting input feature set is listed in Table 1, and
those rejected are summarised in Table 2.</p>
      </sec>
      <sec id="sec-2-3">
        <title>3.3. Loss function</title>
        <sec id="sec-2-3-1">
          <title>The loss function consists of 2 terms:</title>
          <p>= 2 + 80 *</p>
          <p>(1)
2 is a modified mean squared error, it takes into
account missing values and the diference in scale of the
2 = 1 ∑3︁2 ∑︁  ∑︁,(,, − ˆ,,)2 (2) tFrroolmlinignoitviaelrfitetxinpgeroifmthenetms,oidtebletcoamthee
atrpapinairnegntdtahtaatwcaosn32 × 4 =1 ∈ , =1 a key to success in both the core and transfer learning
challenges. Hence, several regularisation strategies were
where  = {, _, , employed. Within the model itself, the move to the
Varia___}, , is the total number of non- tional U-Net from a traditional U-Net, combined with the
missing pixels for a given target variable  at a given introduction of dropout layers throughout the encoder
time  and  is the target variable weighting: and decoder, both aimed to improve the generalisation of
the model. To expose the model to as much variation in
⎪⎧31.610,  =  input as possible, a single model was used for all regions
⎪⎪⎨4139.4,  = _ in the competition and trained on all available training
 = ⎪5.2191,  =  data. Furthermore, for the final leaderboard submission,
⎪ the model was further trained for another cycle on all
⎪⎩142.17,  = ___ the validation data available.</p>
          <p>is the KL divergence between the estimated
Gaussian distribution  (,  2) and a prior distribution
 (0, 1):</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>4. Results</title>
      <sec id="sec-3-1">
        <title>The majority of experimentation on the design of features</title>
        <p>
          = 21 ∑5=1︁21  2 +  2 − log   − 1 (3) ttahonedafinlmlaoolwdmefolodarercqlhuwiitacekscetturrarfeieneweddabsoacncokdnaadtnuadcftreleodamornnailnsligrne.gglHeioornewsg,eisovoners,
The  factor of 80 in Equation 1 was determined there is a risk that some of the decisions made might
empirically to balance the relative importance of the two not be optimum for a model trained on data from all
terms in the loss function. regions. Results from the main experiments can be found
in Appendix A.
3.4. Optimisation Final experiments on all three regions were conducted,
and models were evaluated based on either the test
The Variational U-Net is trained using the Adam op- learderboard or the final leaderboard. It is worth noting
timiser with Cyclic Cosine Annealing described by that the test leaderboard allowed multiple submissions
Loshchilov et al. [
          <xref ref-type="bibr" rid="ref7">13</xref>
          ]. The training process is split into and was open up to the final week of the competition.
cycles, with each cycle consisting of 2 epochs. At each In the final week, the final leaderboard was opened and
cycle, the learning rate is first set to a maximum of 2e-4, competitors were only allowed three submissions. The
then is reduced following a cosine annealing schedule. results of the submissions can be found in Table 3.
Resetting the learning rate at the beginning of each cy- The competition is based on the final leaderboard
cle perturbs the models and encourages them to explore scores and the final model resulted in a third-place finish
diferent basins of attraction. The training is continued for both the core and transfer learning challenges. The
until an additional cycle failed to return a better valida- training history of the final model is shown in Figure 3,
tion score. highlighting the loss progression during both the normal
        </p>
        <p>Using a batch size of 12, the final model was first training phase, as well as the additional cycle training on
trained for 6 cycles (12 epochs) on the training data, then the validation data.
it was further trained for an additional cycle (2 epochs)
on both the training and validation data.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>5. Discussion</title>
      <p>
        whereas others (e.g. cloud top altitude) did not. It was
found that linearly interpolating temperature provided
Although various U-Net architectures were explored, it an improvement to the validation score, however, this
was interesting to observe that the final architecture was did not read across to the final leaderboard score. The
very similar to the architecture used for Trafic4cast [
        <xref ref-type="bibr" rid="ref12">5</xref>
        ]. authors still believe that strategies to compute missing
The only changes were moving to max pooling from data is an interesting area for further work.
average pooling, the addition of dropout layers and the Perhaps most surprisingly was the benefit gained from
adoption of the VAE style bottleneck. The authors would training a single model on data from all regions instead
be interested in exploring whether these improvements of individual models for each region. The model trained
would also read back across to the trafic prediction task. on all regions displayed a significant improvement in the
      </p>
      <p>In terms of feature engineering, the experiments test leaderboard score (~2.3%) over individually trained
showed that the inclusion of some extra features (e.g. models. This finding suggests that that the model may
cloud top pressure) improved predictive capability, continue to improve its general predictive ability for any
region with the addition of more training data. This
hypothesis was further supported as training on the
validation data further improved the final leaderboard score
for both core and transfer learning challenges.</p>
    </sec>
    <sec id="sec-5">
      <title>6. Conclusion</title>
      <p>Weather4cast provided the opportunity to explore the
use of machine learning techniques to the age-old
problem of weather forecasting. Furthermore, the similarity
of format to Trafic4cast also provided the chance to
investigate how transferable machine learning models can
be across vastly diferent domains. After
experimenting with various U-Net architectures, the final model
was very similar to the authors’ Trafic4cast model. The
main diferences being changes to suppress overfitting,
i.e. moving to the Variational U-Net model and inclusion
of dropout layers throughout. The authors also found
that training on data from all regions in one model
outperformed training individual models on each region for
both the core and transfer learning challenges. This
suggests that the model prediction for all regions can be
improved by training on more data.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <article-title>Utilizing unet for the future trafic map prediction task trafic4cast challenge 2020</article-title>
          , arXiv preprint arXiv:
          <year>2012</year>
          .
          <volume>00125</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Kohl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Romera-Paredes</surname>
          </string-name>
          , C. Meyer, J. De Fauw,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Ledsam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. H.</given-names>
            <surname>Maier-Hein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Eslami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. J.</given-names>
            <surname>Rezende</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Ronneberger</surname>
          </string-name>
          ,
          <article-title>A probabilistic u-net for segmentation of ambiguous images</article-title>
          , arXiv preprint arXiv:
          <year>1806</year>
          .
          <volume>05034</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Myronenko</surname>
          </string-name>
          ,
          <article-title>3d mri brain tumor segmentation using autoencoder regularization</article-title>
          , in: International MICCAI Brainlesion Workshop, Springer,
          <year>2018</year>
          , pp.
          <fpage>311</fpage>
          -
          <lpage>320</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [10]
          <string-name>
            <surname>D.-A. Clevert</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Unterthiner</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Hochreiter</surname>
          </string-name>
          ,
          <article-title>Fast and accurate deep network learning by exponential linear units (elus</article-title>
          ),
          <source>arXiv preprint arXiv:1511.07289</source>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          , Group normalization,
          <source>in: Proceedings of the European conference on computer vision (ECCV)</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>19</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Tompson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Goroshin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jain</surname>
          </string-name>
          , Y. LeCun, C. Bregler,
          <article-title>Eficient object localization using convolutional networks</article-title>
          ,
          <source>in: Proceedings of the IEEE conference on computer vision and pattern recognition</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>648</fpage>
          -
          <lpage>656</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>I.</given-names>
            <surname>Loshchilov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Hutter</surname>
          </string-name>
          , Sgdr:
          <article-title>Stochastic gradient descent with warm restarts</article-title>
          ,
          <source>arXiv preprint arXiv:1608.03983</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>IARAI</given-names>
            <surname>,</surname>
          </string-name>
          <article-title>Weather4cast: Multi-sensor weather forecast competition</article-title>
          ,
          <year>2021</year>
          . URL: https://www.iarai.ac. at/weather4cast. A. Experiments on R1
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>IARAI</given-names>
            <surname>,</surname>
          </string-name>
          <article-title>Weather4cast: Multi-sensor weather forecasting competition &amp; benchmark dataset, 2021. Table A1 details some of the experiments done on R1 to URL: https://github</article-title>
          .com/iarai/weather4cast.
          <article-title>explore which input features should be included in the</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kreil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kopp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jonietz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Neun</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Gruca, final model.
          <article-title>All these experiments were done using the P</article-title>
          . Herruzo,
          <string-name>
            <given-names>H.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Soleymani</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>Hochre- training and validation data provided. The underlying iter, The surprising eficiency of framing geo-spatial assumption was that the results from these experiments time series forecasting as a video prediction task- would read across to the final leaderboard. insights from the iarai trafic4cast competition at neurips 2019, in: NeurIPS 2019 Competition and Table A1 Demonstration Track</article-title>
          ,
          <string-name>
            <surname>PMLR</surname>
          </string-name>
          ,
          <year>2020</year>
          , pp.
          <fpage>232</fpage>
          -
          <lpage>241</lpage>
          .
          <article-title>Summary of experimental results on R1</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kopp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kreil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Neun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jonietz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Herruzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gruca</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Soleymani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <source>Experiment Base 1</source>
          <volume>2</volume>
          3 4
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          , et al.,
          <source>Trafic4cast</source>
          at neurips 2020 - yet ℎ__
          <article-title>-- Ye-s YYeess YYeess YYeess more on theunreasonable efectiveness of gridded</article-title>
          ℎ_
          <fpage>mask</fpage>
          --
          <string-name>
            <surname>--</surname>
          </string-name>
          Ye-s
          <article-title>YYeess YYeess geo-spatial processes</article-title>
          , in: NeurIPS 2020 Compe- Interℎpo_latedℎ_ --
          <string-name>
            <surname>--</surname>
          </string-name>
          Ye-s --
          <source>Ye-s t3i2ti5o-n34a3n.d Demonstration Track</source>
          ,
          <string-name>
            <surname>PMLR</surname>
          </string-name>
          ,
          <year>2021</year>
          , pp.
          <source>ETVrpaaloiidcnhaintigonscsocroere 00..1229203437 00..1229173555 00..2130829914 00..1228047897 00..1228208299</source>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. H.</given-names>
            <surname>Kwok</surname>
          </string-name>
          ,
          <article-title>Trafic4cast 2020-graph ensemble net and the importance of feature and loss function design for trafic prediction</article-title>
          , arXiv preprint arXiv:
          <year>2012</year>
          .
          <volume>02115</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>H.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Rupprecht</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Buffat</surname>
          </string-name>
          ,
          <article-title>Trafic4cast-trafic map movie forecastingteam mie-lab</article-title>
          , arXiv preprint arXiv:
          <year>1910</year>
          .
          <volume>13824</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>