<!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>TAM at VQA-Med 2021: A Hybrid Model with Feature Extraction and Fusion for Medical Visual Question Answering</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yong Li</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zhenguo Yang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tianyong Hao</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Computer Science, Guangdong University of Technology</institution>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>School of Computer Science, South China Normal University</institution>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper briefly describes our model for the ImageCLEF Medical Visual Question Answering Task 2021 (ImageCLEF VQA-Med task 2021). Our method is based on a universal VQA framework and consists of image feature extraction module, question feature extraction module and feature fusion module. We employ the modified ResNet-34 as the backbone to construct an image feature extractor, which efectively extracts pixel-level features and enhances the model performance in a deep network. For question feature extraction, we firstly use word embedding to map question tokens to high dimension vectors, and then input them to a long-short-term memory (LSTM) to extract high-level question features. In addition, we leverage Multi-modal Factorized Bilinear Pooling (MFB) with a co-Attention mechanism to fuse these features to predict final answers. Our model achieves the accuracy score of 0.222 and bleu score of 0.255, ranking at the eighth among all participating teams in the VQA-Med task.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;VQA</kwd>
        <kwd>ResNet</kwd>
        <kwd>LSTM</kwd>
        <kwd>Co-Attention</kwd>
        <kwd>MFB</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In recent years, the applications of deep learning in Computer Vision (CV) and Natural Language
Processing (NLP) have gained remarkable progress. The development of deep learning in single
modality facilitates researchers to explore multimodal studies, e.g., image-text retrieval [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ],
image captioning [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and Visual Question Answering (VQA) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. These techniques have been
applied to the domains of finance [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], trafic [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and medical [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], which are all prosperous.
When applying the VQA technique on medical domain, it can fulfill automatic interpretation
of radiology images and make clinical decisions, thereby alleviating the shortage of medical
resources.
      </p>
      <p>
        In the ImageCLEF VQA-Med task 2021 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], given a radiology image with a related question,
the class of diseases indicated in the image is needed to be predicted. Compared to other ordinary
benchmark datasets such as VQA [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], TDIUC [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and Visual7W [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], the ImageCLEF VQA-Med
task 2021 appears to be more challenging. The images of ordinary datasets contain abundant
prior knowledge, such as the object labels including coordinates and category information.
However, the images of ImageCLEF VQA-Med task 2021 dataset [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] do not contain object-level
labels. Besides, questions of ordinary VQA datasets usually have many entity names. On the
contrary, the questions of the ImageCLEF VQA-Med task 2021 have no entity names of diseases.
The intuitive comparison of data examples of common VQA tasks and the ImageCLEF VQA-Med
task 2021 can be showed in Figure 1. In addition, the amount of data in the two kinds of datasets
is dramatically diferent (Tens of thousands of the former and only 4500 of the latter).
      </p>
      <p>
        As for the universal VQA benchmark datasets, we can utilize the object-level and pixel-level
information of images as well as the entity information of questions for answer prediction.
This prior knowledge can greatly enhance the performances of the VQA models. Due to the
shortages of ImageCLEF VQA-Med task 2021 dataset, we utilize the modified ResNet-34 [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] as
the image feature extraction module. The basic structure of ResNet-34 is convolution neural
network (CNN), which can learn the data bias and pixel-level features through a small number of
images. Besides, the residual structure can stabilize the information flow during training, which
benefits to high-level feature extraction. We utilize long-short-term memory (LSTM) [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] to
extract the question features from embedded vectors followed by the word embedding module.
After that, Multi-modal Factorized Bilinear pooling (MFB) with co-Attention mechanism [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is
introduced to fuse the image features and question features. Finally, we predict the final answer
through doing softmax on the fused features.
      </p>
      <p>(a) Data example of ImageCLEF 2021 VQA-Med dataset.</p>
      <p>(b) Data example of common VQA tasks</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        CNN has been widely used in image feature extraction throughout computer vision. Since LeNet
[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] was introduced to extract image features, there have been more and more CNN variants
(AlexNet, VGG, GoogleNet) applying in computer vision tasks. With the solutions to gradient
disappearing (residual learning and dense learning [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]), deeper CNN can be constructed to
promote the model performances on diferent vision tasks. Recently, many researchers have
focused on utilizing transformer [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] as the image features encoder and gained remarkable
performances. In transformer, the input images are split into patches and treated as sequences,
and then input to the transformer for feature extraction. However, this requires a large number
of training data to learn the distribution of the datasets, which is not efective in this task.
      </p>
      <p>
        The researches of NLP tasks have been greatly promoted by the proposal of transformer.
Transformer introduces the full-connected layer (FC) to build the self-attention mechanism,
which replaces RNN to learn contextual information of a long-length sentence. Later, Devlin J
et al. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] proposed Bert by stacking encoders of Transformer. With a deeper structure, Bert
adds word embedding, segment embedding and position embedding together as input to reach
better performances in NLP tasks. In the next years, XLNet [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], GPT-2 [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], GPT-3 [20] were
proposed to further promote the performances in NLP tasks. However, both of these models
require large amount of training data to fit the distribution of the input text. For the LSTM [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ],
it can well preserve the contextual features of long-time sequences with a small number of texts.
Therefore, we use LSTM as our question feature extractor instead.
      </p>
      <p>The simple methods of feature fusion in deep neural networks include concatenating the
diferent kinds of feature in channel dimension, making element-wise sum or producting with
same feature map sizes. But these might not be expressive enough to fully capture the complex
associations between the two diferent modalities. The Multimodal Compact Bilinear pooling
(MCB) [21] projects the images and text representations to a higher dimensional space, and then
convolves both vectors by using element-wise product in Fast Fourier Transform (FFT) space.
The Multi-modal Factorized Bilinear Pooling (MFB) [22] introduces co-Attention mechanism to
jointly learn both image and question attention. The co-Attention mechanism can efectively
learn which regions are important for the images related to the questions.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Method</title>
      <p>The overview of the architecture of our proposed model is shown in Figure 2. Our model
consists of three components: A image feature extraction module, a question feature extraction
module and an attention feature fusion module.</p>
      <sec id="sec-3-1">
        <title>3.1. Image Feature Extraction Module</title>
        <p>The main component of the original ResNet-34 is convolution neural network (CNN). With the
characteristics of translation invariant, translation equivalence, scale invariance and rotation
invariance, CNN can learn strong data bias with a small number of data. Besides, the residual
structure has a large receptive field and it keeps gradient from vanishing in model training
process. Benefitting from these strengthens, this image feature extraction module efectively
learns pixel features and spatial features of the medical images. Although it could be easy to
overfit because of the small number of data, we alleviate this situation with a dropout operation.
The output of the original ResNet-34 is a 1000-dimension vectors used for 1000 classification,
which is not suitable in this task.</p>
        <p>Compared to the original ResNet-34, we remove the global average pooling layer (GAP) and
full-connected layer (FC), as showed in Figure 3. Before the images are fed to this module,
each image is resized to 128×128 with the INTER_AREA algorithm. In order to fit the input
size of the feature fusion module, we reshape the shape of output image feature maps from
B×512×16×16 to a new shape of B×64×2048, where B represents the batch size in training. We
take this reshaped feature maps as the extracted image features.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Text Feature Extraction Module</title>
        <p>In this task, we introduce the word embedding and LSTM to extract the question features.
Given the questions of the raw data, the preprocessing of them includes two steps: tokenizing
the words of questions and fixing the length of sentences to 12. After that, the tokenized
sequences are sent to the word embedding module and generate the embedded word vectors
in the dimension of B×12×600 (Note the tokens are encoded using GLOVE word embeddings).
These embedded vectors are fed into the LSTM module to acquire high-level question features.
The input layer dim and hidden layer dim are set to 600 and 1024 respectively. The number
of LSTM unit in feature extraction module is set to 1. In this task, we use the whole sequence
output features instead of the last token output features to guarantee the information integrity
of sentence structure.</p>
        <p>While inputting the word vectors to the LSTM, the forget gate of LSTM determines whether
the information flows from previous moment can pass through to the next moment with a
sigmoid function, which prompts LSTM to keep useful information and filter useless ones. The
input gate of LSTM determines which information needs to be updated at current moment, and
the output gate outputs updated information to next moment or as final output. With the gate
units, LSTM has a strong ability in storing state information, which benefits to catch contextual
correlation in long-time sequences.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Attentional Feature Fusion Module</title>
        <p>After extracting the image features and question features, we feed them to the Multi-modal
Factorized Bilinear Pooling (MFB) with the co-Attention mechanism together to obtain the
fused features.</p>
        <p>The MFB keeps the robust expressive capacity when compacts the features from diferent
modalities by using the matrix factorization tricks. The co-Attention mechanism consists of
a self-attention mechanism (SA) and a guided-attention (GA). Given two modalities features
 and  ,  first makes the self-attention operation to generate attention features, denoted
as . Furthermore, the  is used to guide the attention learning to obtain attention
features of  , denoted as . This operation enhances the connection of two modalities in
the learning process. By introducing the co-Attention mechanism to the MFB, the joint feature
representation learning can be more accurate and efective.</p>
        <p>In this task, we input the image features and question features (denoted as  and )
extracted from the modified ResNet-34 and LSTM to the MFB with the co-Attention mechanism,
as showed in Figure 4. We firstly made a self-attention operation on  to obtain question
attention features _, then we used the MFB to fuse the _ and  to guide
the image features attention learning to generate image attention features _. After that,
we used the MFB to fuse the _ and _ with vector multiplication and projected
the fused features to a linear dimension. At last, we employed a softmax function on the fused
features to predict the probability of each answer.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments</title>
      <sec id="sec-4-1">
        <title>4.1. Data Description</title>
        <p>This dataset of ImageCLEF VQA-Med task 2021 contains a training set of 4000 image-question
pairs, a validation set of 500 pairs and a test set of 500 pairs. The triplet data of images, questions
and answers are one-to-one associated. The training set of ImageCLEF VQA-Med task 2021 is
totally the same as the training set of ImageCLEF VQA-Med task 2020. The organizers replaced
the samples of image, question and answer in validation set and test set in ImageCLEF VQA-Med
task 2021. Therefore, we merged the validation set of ImageCLEF VQA-Med task 2020 with the
training set of ImageCLEF VQA-Med task 2021 in order to extend the training set to 4500 paired
image-question-answer data.</p>
        <p>By analyzing the dataset, we found that the data can be divided into two types: open-ended,
i.e., the answers are “yes/no” or the questions start with “Is/Does/. . . ”, or close-ended, i.e., the
questions do not have limited structures and could have multiple correct answers. Through
statistics, there are 88 close-ended paired data and the rest of them are open-ended in the
training set. However, there is no close-ended data in the validation set and test set. The total
classes of answers are 332 in the training set and 236 (subset of training set) in the validation
set. The statistical result is summarized in Table 1.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Optimization</title>
        <p>Our model was optimized with BCE loss function on RTX2080 GPU devices by training 800
epochs. We trained the network from the scratch without using any pretrained model weights.
We employed Adam with  1 = 0.9 and  2 = 0.999 as the optimizer, and used dynamic learning
rate to update the weights. In terms of convergence, we visualized the optimizations of the
objective of our proposed model in Figure 5, from which we could observe that the training
loss was decreasing, the accuracy score and bleu score were increasing. We utilized the model
weight that generated the highest validation accuracy score as the final model weight. We
submitted the result generated by this trained model on the test set and achieved the accuracy
score of 0.222 and bleu score of 0.255. The top 10 result of this competition is shown in Table 2.
(a) Train loss.</p>
        <p>(b) Validation accuracy score.</p>
        <p>(c) Validation bleu score.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Discussion</title>
        <p>An intuitive observation of Figure 5 (b) and (c) is that the performance of our method on
validation set is much better than on test set. The reason could be summarized as follows:
The sampling method of the test set was diferent from that of the training and validation set.
Besides, in order to fit the input size of the image feature extraction model, the input images
were resized to 128×128 roughly, which might lose some spatial information and introduce the
noises. In addition, the questions of the dataset provided little entity information of the related
classes.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>This paper describes the model designed in the ImageCLEF VQA-Med task 2021 competition.
We proposed a modified ResNet-34 + LSTM + MFB with a co-Attention mechanism to predict
ifnal answers of VQA-Med. In image features extraction process, CNN was employed to learn
the image bias and dropout function was introduced to suppress the over-fitting situation. For
question feature extraction module, LSTM was utilized to extract the question features that did
not rely on a large number of data. The two modalities features were fused by the MFB with
co-Attention mechanism to generate the fused features for answer prediction. The best result
of our model is 0.222 in accuracy score and 0.255 in bleu score.
1073. doi:10.1002/grl.50288.
[20] T. B. Brown, B. Mann, N. Ryder, M. Subbiah, J. Kaplan, P. Dhariwal, A. Neelakantan,
P. Shyam, G. Sastry, A. Askell, et al., Language models are few-shot learners, arXiv
preprint arXiv:2005.14165 (2020).
[21] A. Fukui, D. H. Park, D. Yang, A. Rohrbach, T. Darrell, M. Rohrbach, Multimodal compact
bilinear pooling for visual question answering and visual grounding, arXiv preprint
arXiv:1606.01847 (2016).
[22] Z. Yu, J. Yu, J. Fan, D. Tao, Multi-modal factorized bilinear pooling with co-attention
learning for visual question answering, in: Proceedings of the IEEE international conference
on computer vision, 2017, pp. 1821–1830.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Context-aware attention network for image-text retrieval</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>3536</fpage>
          -
          <lpage>3545</lpage>
          . doi:
          <volume>10</volume>
          .1109/CVPR42600.
          <year>2020</year>
          .
          <volume>00359</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Feng</surname>
          </string-name>
          , L. Ma, W. Liu,
          <string-name>
            <given-names>J.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <article-title>Unsupervised image captioning</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>4125</fpage>
          -
          <lpage>4134</lpage>
          . doi:
          <volume>10</volume>
          .1109/CVPR.
          <year>2019</year>
          .
          <volume>00425</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <article-title>Deep modular co-attention networks for visual question answering</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>6281</fpage>
          -
          <lpage>6290</lpage>
          . doi:
          <volume>10</volume>
          .1109/CVPR.
          <year>2019</year>
          .
          <volume>00644</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>G.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.</surname>
          </string-name>
          <article-title>Wang, Multi-scale two-way deep neural network for stock trend prediction (</article-title>
          <year>2020</year>
          )
          <fpage>4555</fpage>
          -
          <lpage>4561</lpage>
          . doi:
          <volume>10</volume>
          .24963/ ijcai.
          <year>2020</year>
          /621.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Prakash</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chitta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Geiger</surname>
          </string-name>
          <article-title>, Multi-modal fusion transformer for end-to-end autonomous driving</article-title>
          ,
          <source>arXiv preprint arXiv:2104.09224</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>B. D.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          , T.-T. Do,
          <string-name>
            <given-names>B. X.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Do</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Tjiputra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. D.</given-names>
            <surname>Tran</surname>
          </string-name>
          ,
          <article-title>Overcoming data limitation in medical visual question answering</article-title>
          , in: International Conference on Medical Image Computing and
          <string-name>
            <surname>Computer-Assisted</surname>
            <given-names>Intervention</given-names>
          </string-name>
          , Springer,
          <year>2019</year>
          , pp.
          <fpage>522</fpage>
          -
          <lpage>530</lpage>
          . doi:
          <volume>10</volume>
          . 1007/978-3-
          <fpage>030</fpage>
          -32251-9_
          <fpage>57</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>B.</given-names>
            <surname>Ionescu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Müller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Peteri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Ben</given-names>
            <surname>Abacha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sarrouti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Demner-Fushman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Hasan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kovalev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kozlovski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Liauchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Dicente</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Pelka</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. G. S. de Herrera</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Jacutprakart</surname>
            ,
            <given-names>C. M.</given-names>
          </string-name>
          <string-name>
            <surname>Friedrich</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Berari</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Tauteanu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Fichou</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Brie</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Dogariu</surname>
            ,
            <given-names>L. D.</given-names>
          </string-name>
          <string-name>
            <surname>Ştefan</surname>
            ,
            <given-names>M. G.</given-names>
          </string-name>
          <string-name>
            <surname>Constantin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Chamberlain</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Campello</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>T. A.</given-names>
          </string-name>
          <string-name>
            <surname>Oliver</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Moustahfid</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Popescu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Deshayes-Chossart</surname>
          </string-name>
          ,
          <article-title>Overview of the ImageCLEF 2021: Multimedia retrieval in medical, nature, internet and social media applications, in: Experimental IR Meets Multilinguality</article-title>
          , Multimodality, and
          <string-name>
            <surname>Interaction</surname>
          </string-name>
          ,
          <source>Proceedings of the 12th International Conference of the CLEF Association (CLEF</source>
          <year>2021</year>
          ),
          <source>LNCS Lecture Notes in Computer Science</source>
          , Springer, Bucharest, Romania,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Antol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mitchell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Batra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. L.</given-names>
            <surname>Zitnick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Parikh</surname>
          </string-name>
          , Vqa:
          <article-title>Visual question answering</article-title>
          ,
          <source>in: Proceedings of the IEEE international conference on computer vision</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>2425</fpage>
          -
          <lpage>2433</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICCV.
          <year>2015</year>
          .
          <volume>279</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>K.</given-names>
            <surname>Kafle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Kanan</surname>
          </string-name>
          ,
          <article-title>An analysis of visual question answering algorithms</article-title>
          ,
          <source>in: Proceedings of the IEEE International Conference on Computer Vision</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>1965</fpage>
          -
          <lpage>1973</lpage>
          . doi:
          <volume>10</volume>
          . 1109/ICCV.
          <year>2017</year>
          .
          <volume>217</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Groth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bernstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Fei-Fei</surname>
          </string-name>
          ,
          <article-title>Visual7w: Grounded question answering in images</article-title>
          ,
          <source>in: Proceedings of the IEEE conference on computer vision and pattern recognition</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>4995</fpage>
          -
          <lpage>5004</lpage>
          . doi:
          <volume>10</volume>
          .1109/CVPR.
          <year>2016</year>
          .
          <volume>540</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ben Abacha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sarrouti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Demner-Fushman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Hasan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Müller</surname>
          </string-name>
          ,
          <article-title>Overview of the vqa-med task at imageclef 2021: Visual question answering and generation in the medical domain</article-title>
          ,
          <source>in: CLEF 2021 Working Notes, CEUR Workshop Proceedings</source>
          , CEUR-WS.org, Bucharest, Romania,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , S. Ren,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <article-title>Identity mappings in deep residual networks</article-title>
          ,
          <source>in: European conference on computer vision</source>
          , Springer,
          <year>2016</year>
          , pp.
          <fpage>630</fpage>
          -
          <lpage>645</lpage>
          . doi:
          <volume>10</volume>
          .1007/ 978-3-
          <fpage>319</fpage>
          -46493-0_
          <fpage>38</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Hochreiter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schmidhuber</surname>
          </string-name>
          ,
          <article-title>Long short-term memory</article-title>
          ,
          <source>Neural computation 9</source>
          (
          <year>1997</year>
          )
          <fpage>1735</fpage>
          -
          <lpage>1780</lpage>
          . doi:
          <volume>10</volume>
          .1162/neco.
          <year>1997</year>
          .
          <volume>9</volume>
          .8.1735.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Y.</given-names>
            <surname>LeCun</surname>
          </string-name>
          , L. Bottou,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hafner</surname>
          </string-name>
          ,
          <article-title>Gradient-based learning applied to document recognition</article-title>
          ,
          <source>in: Proceedings of the IEEE</source>
          , volume
          <volume>86</volume>
          ,
          <string-name>
            <surname>Ieee</surname>
          </string-name>
          ,
          <year>1998</year>
          , pp.
          <fpage>2278</fpage>
          -
          <lpage>2324</lpage>
          . doi:
          <volume>10</volume>
          . 1109/5.726791.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>G.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. Van Der</given-names>
            <surname>Maaten</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. Q.</given-names>
            <surname>Weinberger</surname>
          </string-name>
          ,
          <article-title>Densely connected convolutional networks</article-title>
          ,
          <source>in: Proceedings of the IEEE conference on computer vision and pattern recognition</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>4700</fpage>
          -
          <lpage>4708</lpage>
          . doi:
          <volume>10</volume>
          .1109/CVPR.
          <year>2017</year>
          .
          <volume>243</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kaiser</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          ,
          <source>arXiv preprint arXiv:1706.03762</source>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          , J. Carbonell, R. Salakhutdinov,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <article-title>Xlnet: Generalized autoregressive pretraining for language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1906</year>
          .
          <volume>08237</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>K.</given-names>
            <surname>Lagler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Schindelegger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Böhm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Krásná</surname>
          </string-name>
          , T. Nilsson,
          <article-title>Gpt2: Empirical slant delay model for radio space geodetic techniques</article-title>
          ,
          <source>Geophysical research letters</source>
          <volume>40</volume>
          (
          <year>2013</year>
          )
          <fpage>1069</fpage>
          -
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>