<!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>DCU-ADAPT at MediaEval 2019: Eyes and Ears Together</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yasufumi Moriya</string-name>
          <email>yasufumi.moriya@adaptcentre</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gareth J. F. Jones</string-name>
          <email>gareth.jones@dcu.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ADAPT Centre, School of Computing, Dublin City University</institution>
          ,
          <addr-line>Dublin 9</addr-line>
          ,
          <country country="IE">Ireland</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <fpage>27</fpage>
      <lpage>29</lpage>
      <abstract>
        <p>We describe the DCU-ADAPT participation in the Eyes and Ears Together task at MediaEval 2019. Our submitted systems were developed to choose object bounding boxes from automatically generated proposals given query entities. The first system finds relevance between object proposals and queries using multiple instance learning. The second system employs an attention mechanism to find object proposals which are most likely correspond to the given queries. The last system is a baseline system which chooses region proposals at random. We observed that the first two systems produced higher accuracy than the random baseline. The best approach was to use multiple instance learning which resulted in accuracy of 9% when the threshold of intersection over union was 0.5.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        The nature of human communication is often a multimodal process,
where textual, visual and audio information are simultaneously
processed. The Eyes and Ears Together task at MediaEval 2019 aims
to ground speech transcripts into videos [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Visual grounding tasks
are conducted on images or videos and manually created captions
[
        <xref ref-type="bibr" rid="ref4 ref5 ref8">4, 5, 8</xref>
        ], but rarely on vision and speech. Speech grounding is
interesting, in that this replicates human communication, where
listening to speech and seeing objects happen simultaneously. A
practical advantage of grounding speech into vision is that, unlike
caption grounding, speech transcripts can be obtained easily from
user generated content (e.g., YouTube) or using automatic speech
recognition.
      </p>
      <p>
        As a task organiser, we generated pairs of video frames and
entities from the How2 dataset [
        <xref ref-type="bibr" rid="ref7 ref9">7, 9</xref>
        ]. The challenge of this task is
that systems need to discover relationships between objects and
entities without explicit annotation of objects, since pairs of video
frames and entities are automatically aligned.
      </p>
      <p>
        In this paper, we describe our investigation into whether two
existing approaches employed for caption grounding could be
applied to speech grounding. The common characteristics of these
approaches are that they both use pre-computed candidate region
proposals of objects. The first approach is to find relationships
between object proposals and queries using contrastive loss [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. This
employs an established approach referred to as multiple instance
learning (MIL) which is often applied to other computer vision tasks
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The second approach is to use the attention mechanism [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ],
with an object bounding box which has the highest attention weight
taken as a prediction given a query entity [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. To compare these
approaches to the most basic system, the final system randomly
chooses object bounding boxes from candidate region proposals.
      </p>
    </sec>
    <sec id="sec-2">
      <title>OUR APPROACH</title>
      <p>We use machine learning approaches to visual grounding using
automatically generated object proposals. For each video frame, there
are n object proposals. We extract n fixed-length feature vectors
by cropping a video according to object proposals and applying a
convolutional neural network (CNN) to each cropped image. Each
query entity associated with a video frame is also transformed into
a fixed-length vector using a word embedding model.
2.1</p>
    </sec>
    <sec id="sec-3">
      <title>Multiple Instance Learning</title>
      <p>
        Given region proposals transformed into fixed-length vectors, and
a query entity also represented as a vector, a neural network model
can find the region proposal which is the most strongly associated
with the query entity [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. This can be expressed in the following
equations.
      </p>
      <p>ϕ(ri jk )
ψ (ei )
¯
k
=
=
=</p>
      <p>Wr (fC N N (ri jk ))
We (fEM B (ei ))
arg max(siдmoid(ϕ(ri jk )T · ψ (ei )))
k
(1)
(2)
(3)
where i denotes the ith entity, j - jth the video frame of an entity
and k - kth a region proposal, ϕ(ri jk ) is a CNN feature of ri jk ,
ψ (wi ) is a word embedding of query entity ei , and k¯ is an index
of the region proposal which is the most strongly associated with
ei . While fC N N and fEM B are fixed during training, in the neural
network model Wr and We are updated at training time.</p>
      <p>At training time, given region proposals and a query entity, a
neural network model is trained to find relationships between video
frames and query entities, as shown in Figure 1. For each pair of
a video frame and a query entity, there are two additional pairs
which create a mis-match between a video frame and a query entity.
The loss function penalises a model when it gives a higher score to
mkax(ϕ(ri jk )T · ψ (ei ))
(max(0, Sil − Sii + δ ) + max(0, Sli − Sii + δ )) (5)
i
where Sii is a correctly matched image-entity pair, Sil is the current
image and a random query entity and Sli a random image and the
current query entity.
2.2</p>
    </sec>
    <sec id="sec-4">
      <title>Reconstruction</title>
      <p>
        A neural network can find a region proposal that is the most
strongly associated with a query entity using attention mechanism
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>¯
k
= arg max(fAT T N ([ϕ(ri jk ); ψ (ei )])) (6)</p>
      <p>k
This is applied in Equation 6, where fAT T N is an attention function
which computes attention weights over k region proposals given
concatenation of visual features ϕ(ri jk ) and an embedded query
entity ψ (ei ).</p>
      <p>
        At training time, a model can learn a relationship between a
visual object and a query entity by reconstructing an embedded
query entity from a region proposal which has the highest attention
weight [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Figure 2 shows how an object bounding box is found at
testing time, and how a model is trained to reconstruct a query
entity from a region proposal at training time. Formally, the following
equations express how to compute a reconstruction loss.
Lr ec
=
=
      </p>
      <p>N
Õ
k=1
Wr ec</p>
      <p>D
1 Õ
D
d=1</p>
      <p>
        ak ϕ(ri jk )
(ψ (ei )d − rat t n )
d
(4)
(7)
(8)
For each video frame, 20 region proposals were extracted from the
How2 dataset [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] using Mask-RCNN [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The Mask-RCNN uses
ResNeXt101 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] as its backbone. For each region proposal, the
ResNet 152 model was used to extract fixed-length vectors. The
dimension of each visual feature was 2,048. The word embedding
model was trained on the training set of the How2 speech
transcripts using the fastText library [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], and each query entity was
embedded into a 100 dimensional vector.
Table 1 shows results of visual grounding using the MIL-based
approach, the reconstruction based approach and the system which
chooses region proposals at random. The systems were evaluated
in terms of intersection of a selected region proposal and a gold
standard bounding box divided by union of a region proposal and a
gold standard (IoU). When an IoU value exceeded thresholds of 0.5,
0.3 or 0.1, a system prediction was regarded as correct. As can be
seen in the table, both MIL and reconstruction approaches generally
produced slightly better results than a simple random approach. A
possible explanation for poor results of the two models is that those
approaches have been applied to caption grounding and showed
reasonable results, but have not been applied to speech grounding.
For speech grounding, it is possible that entities are sometimes
weakly associated with visual objects. Therefore, existing models
may need modification for speech grounding to eficiently learn
relationships between entities and objects.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>CONCLUSIONS</title>
      <p>This paper describes the DCU-ADAPT participation in Eyes and
Ears Together at MediaEval 2019. We employed machine learning
approaches previously applied to caption grounding, and
investigated whether those models can work on speech grounding as well.
It was found that whlie they still perform better than the random
baseline, they require modification to better capture weak
relationships between entities in speech transcripts and visual objects.</p>
    </sec>
    <sec id="sec-6">
      <title>ACKNOWLEDGMENTS</title>
      <p>This work was supported by Science Foundation Ireland as part of
the ADAPT Centre (Grant 13/RC/2106) at Dublin City University.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Dzmitry</given-names>
            <surname>Bahdanau</surname>
          </string-name>
          , Kyunghyun Cho, and
          <string-name>
            <given-names>Yoshua</given-names>
            <surname>Bengio</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Neural Machine Translation by Jointly Learning to Align and Translate</article-title>
          .
          <source>In 3rd International Conference on Learning Representations (ICLR).</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Piotr</surname>
          </string-name>
          . Bojanowski, Edouard. Grave, Armand. Joulin, and
          <string-name>
            <surname>Ttomas</surname>
          </string-name>
          . Mikolov.
          <year>2016</year>
          .
          <article-title>Enriching word vectors with subword information</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          <volume>5</volume>
          (
          <year>2016</year>
          ),
          <fpage>135</fpage>
          -
          <lpage>146</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Marc-André</surname>
            <given-names>Carbonneau</given-names>
          </string-name>
          , Veronika Cheplygina, Eric Granger, and
          <string-name>
            <given-names>Ghyslain</given-names>
            <surname>Gagnon</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Multiple instance learning: A survey of problem characteristics and applications</article-title>
          .
          <source>Pattern Recognition</source>
          <volume>77</volume>
          (
          <year>2018</year>
          ),
          <fpage>329</fpage>
          -
          <lpage>353</lpage>
          . https://doi.org/10.1016/j.patcog.
          <year>2017</year>
          .
          <volume>10</volume>
          .009
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>De-An</surname>
            <given-names>Huang</given-names>
          </string-name>
          , Shyamal Buch, Lucio Dery, Animiesh Garg,
          <string-name>
            <surname>Li</surname>
            <given-names>FeiFei</given-names>
          </string-name>
          , and Juan Carlos Niebles.
          <year>2018</year>
          . Finding “It”:
          <string-name>
            <surname>Weakly-Supervised</surname>
          </string-name>
          ,
          <article-title>Reference-Aware Visual Grounding in Instructional Videos</article-title>
          .
          <source>In International Conference on Computer Vision and Pattern Recognition (CVPR)</source>
          .
          <volume>5948</volume>
          -
          <fpage>5957</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Andrej</given-names>
            <surname>Karpathy</surname>
          </string-name>
          and
          <string-name>
            <given-names>Li</given-names>
            <surname>Fei-Fei</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Deep visual-semantic alignments for generating image descriptions</article-title>
          .
          <source>In Computer Vision and Pattern Recognition (CVPR)</source>
          .
          <volume>3128</volume>
          -
          <fpage>3137</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Francisco</given-names>
            <surname>Massa and Ross Girshick</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>maskrcnn-benchmark: Fast, modular reference implementation of Instance Segmentation and Object Detection algorithms in PyTorch</article-title>
          . https://github.com/ facebookresearch/maskrcnn-benchmark. (
          <year>2018</year>
          ).
          <source>Accessed: 07 June</source>
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Yasufumi</given-names>
            <surname>Moriya</surname>
          </string-name>
          , Ramon Sanabria, Florian Metze, and
          <string-name>
            <surname>Gareth Jones J. F. MediaEval</surname>
          </string-name>
          <article-title>2019: Eyes and Ears Together</article-title>
          .
          <source>In Proceedings of MediaEval</source>
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Anna</given-names>
            <surname>Rohrbach</surname>
          </string-name>
          , Marcus Rohrbach, Ronghang Hu, Trevor Darrell, and
          <string-name>
            <given-names>Bernt</given-names>
            <surname>Schiele</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Grounding of Textual Phrases in Images by Reconstruction</article-title>
          .
          <source>In European Conference on Computer Vision (ECCV)</source>
          .
          <volume>817</volume>
          -
          <fpage>834</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Ranom</given-names>
            <surname>Sanabria</surname>
          </string-name>
          , Ozan Caglayan, Shurti Palaskar, Desmond Elliott, Loic Barrault, Lucia Specia, and
          <string-name>
            <given-names>Florian</given-names>
            <surname>Metze</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>How2: A Largescale Dataset For Multimodal Language Understanding</article-title>
          . In Workshop on Visually Grounded Interaction and
          <string-name>
            <surname>Language (ViGIL). NeurIPS</surname>
          </string-name>
          . http: //arxiv.org/abs/
          <year>1811</year>
          .00347
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Saining</surname>
            <given-names>Xie</given-names>
          </string-name>
          , Ross Girshick, Piotr Dollar, Zhuowen Tu, and
          <string-name>
            <given-names>Kaiming</given-names>
            <surname>He</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Aggregated Residual Transformations for Deep Neural Networks</article-title>
          .
          <source>In The IEEE Conference on Computer Vision and Pattern Recognition (CVPR).</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>