<!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>Big Data For Lifelog Moments Retrieval Improvement</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Fatma Ben Abdallah</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ghada Feki</string-name>
          <email>ghada.feki@ieee.org</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anis Ben Ammar</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chokri Ben Amar</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Higher Institute of Technological Studies, ISET Kairouan</institution>
          ,
          <addr-line>3199 Raccada</addr-line>
          ,
          <country country="TN">Tunisia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>REGIM-Lab.: REsearch Groups in Intelligent Machines, University of Sfax, National Engineering School of Sfax (ENIS)</institution>
          ,
          <addr-line>BP 1173, Sfax, 3038</addr-line>
          ,
          <country country="TN">Tunisia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The ImageCLEF lifelog Moment Retrieval Task promotes research for lifelogging retrieval by providing a benchmark with an evaluation process that allows a comparative analysis of lifelog methods, approaches and tools. In this paper, we describe our participation at the ImageCLEF lifelog LMRT 2019. Findings from our initial experiments in the LMRT sub-task in ImageCLEFlifelog2018 have motivated us to improve our deep learning-based processing for lifelog image retrieval approach using NoSQL database. The new version employs a distributed database and framework for storing and processing large volumes of data. We try to reduce user involvement during the ne-tuning phase by using the ground truth for the development dataset. We implement our architecture using Matlab, Cassandra, and Spark. The best results were given by the rst run with precision@10=0.28. This run is based on ne-tuning Googlenet with the weights freeze of the 110 rst layers.</p>
      </abstract>
      <kwd-group>
        <kwd>Deep-learning Lifelog Moments Retrieval</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Transfer-learning</title>
    </sec>
    <sec id="sec-2">
      <title>Big Data</title>
    </sec>
    <sec id="sec-3">
      <title>NoSQL</title>
      <p>
        Lifelogging is a concept that has emerged in recent years to translate people’s
interest in the daily logging of their lives. The lifelogging is intended for private
use, unlike social networks which are also kinds of lifelogs. Many devices and
applications are available to monitor our training, diet, health, sleep, etc. The
information collected by these devices and applications is characterized by the
heterogeneity and the multimodality which make the research process in this
mass of data a complex and non-trivial task. Considering this context, several
workshops, panels, and evaluation campaign oers research tasks to deal with the
problem of retrieving, summarizing and visualizing lifelogging data. Given the
huge amount of digital data, it has become necessary to develop new methods to
manage and analyze them. Big Data is about nding, capturing, storing, sharing
and presenting this data. To satisfy the need of heavy data processing, NoSQL
is a database query language for Big Data. Several NoSQL database exist with
document store (CouchDB, MongoDB, TerraStore, eXist, Virtuoso), key-value
store (DynamoDB, Voldemort, Azure Table Storage, MongoDB), graph store
(AllegroGraph, InniteGraph) and, tabular store (Cassandra, Hadoop / Hbase,
Hypertable). Since that storing into tables allows greater ease of developpement
with a SQL-like language with CQL, our choice focused on Apache Cassandra.
Our research to date has focused on proposing a deep learning-based
processing approach for lifelog image retrieval [24]. Compared to our initial approach
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], our participation in the ImageCLEF Lifelog Moment Retrieval Task 2019
(LMRT) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] which is part of the Conference and Labs of the Evaluation Forum
(CLEF 2019) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] has two main improvements. First, we use the ground truth of
the development dataset to automatically dispatch images into categories for the
ne-tuning. Second, we use Apache Cassandra a NoSQL-based database
management system (DBMS) designed to handle massive amounts of data. Cassandra
Query Language (CQL) only implements a subset of SQL, so we use Spark with
Cassandra to operate data analytics that CQL doesn’t provide. From an initial
query, our approach can automatically extract from it relevant concepts based
on Long-Term-Short-Memory(LSTM). After that, the retrieval phase consists
in searching the extracted query concepts in the le containing the image
concepts. The runs submitted in the LMRT 2019 vary in the generation of image
concepts. For the rst run, we ne-tune Googlenet with the weight freeze of the
rst 110 layers. For the second run, we ne-tune Googlenet without freezing.
For the third run, we ne-tune Alexnet. For the fourth and fth run, we use
respectively Googlenet and Alexnet to classify all the images of the test dataset.
For the sixth run, we used only the textual features given by the organizers. The
best results were given by the rst run with F1-measure=0.188, ranked sixth in
the challenge.
      </p>
      <p>The remainder of this paper is divided into ve sections. In section 2, we present
existing retrieval architectures using ne-tuning. In section 3, we detail our
approach. Section 4 presents the experimental results of our implementation.
Section 5 provides some concluding remarks and suggests future works
2</p>
      <sec id="sec-3-1">
        <title>Related Work</title>
        <p>Training models to have human-like capabilities requires a lot of resources in
terms of data and time. To optimize this learning, we must pool knowledge from
one model to another by practicing transfer learning and especially ne-tuning.
Mainly, in the case of image processing, we re-use the layers of a model that has
already learned that we xed, the last layers as for it will change according to
the learning data and will rene according to input data.</p>
        <p>
          Babenko et al. [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] have demonstrated a signicant improvement in the search
performance of the neural network when it is trained on a dataset which is
similar to the one encountered during the test phase. Bases of this observation, we
focused our study on existing retrieval architectures using ne-tuning.
Authors in [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] proposed a CNN framework for clothes image retrieval in
recommendation system. The rst framework’s module use Alexnet pre-trained on
Imagenet for learning rich mid-level visual representations. The second one,
netune the Alexnet network on clothing dataset using backpropagation. Finally,
the images are retrieved via hierarchical deep search. Authors in [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] proposed
to ne-tune CNN for image retrieval from a large collection of images using 3D
reconstruction and siamese architecture. In [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], the authors investigate the use of
CNN-based features for food retrieval. They use the last fully connected layer of
Resnet-50 as a feature extractor. The most similar approach to our lifelog image
retrieval context is proposed in [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. The authors developed a general
framework to translate lifelog images into features. They choose to ne-tune VGG-16
pre-trained on ImageNet1K 3 by replacing the last layer which contains 1000
neurons with 634, followed by sigmoid activation instead of softmax function. Other
frameworks/systems for lifelog image retrieval were proposed in [
          <xref ref-type="bibr" rid="ref16">16, 1820</xref>
          ] and
rely only on CNN and DNN pre-trained on Imagenet to extract feature.
Finetuning method outperforms those use only pre-trained CNN on Imagenet1K,
Places3654 or MSCOCO5. These armations are conrmed by the experimental
results conducted in section 4.
3
        </p>
        <p>Proposed Approach: Big Data For Lifelog Moments
Retrieval
3.1</p>
        <p>
          Overview
We based our proposed approach on our previous participation in LMRT 2018
[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. However, the main dierence between the two approaches is that the new
version employs a distributed database and framework for storing and
processing large volumes of data. Furthermore, we automate the images dispatching for
the ne-tuning phase by using the ground truth for the development dataset.
The ImageCLEF LMRT dataset, in addition to containing images, includes a set
of metadata consisting of biometrics, historic glucose index, semantic locations
visited, physical activities, attributes predicted by using the Place CNN trained
on SUNattribute dataset and also trained on Place 365 dataset, the class name,
the bounding box and the score of the 25 objects with the highest score in each
image predicted by using Faster R-CNN [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] trained on the COCO dataset. To
exploit these huge lifelog metadata description, we use CQL Query with Spark
connector. From an initial query, our approach can automatically extract from
its relevant concepts based on Long-Term-Short-Memory(LSTM). After that,
the retrieval phase consists in searching the extracted query concepts in the le
3 http://www.image-net.org/
4 http://places2.csail.mit.edu/download.html
5 http://cocodataset.org/
containing the image concepts.
        </p>
        <p>
          Fig. 1 presents the overview of our proposed approach for lifelog moments
retrieval. Our approach has ve main phases:
Fine-Tuning : We organize 9676 images into 51 classes using the ground
truth (GT) of the development set. The classes were formed from the
clusters le provided with the GT. For the clusters restaurant, watch videos and
cooking which contain several sub-clusters (respectively 11, 31 and 10), we
had to check visually the images to more appropriately rename the classes.
Nevertheless, several topics do not appear in the GT. For the topic in a
toyshop and seeking food in the fridge, we choose manually the images. For
the topic coee time, we used the images from the imageCLEF LMRT 2018.
For the CNN parameters, we used the same setting as last participation
last year[
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. In fact, we replace the last three layers of the network: a fully
connected layer, a softmax layer, and a classication output layer. Besides,
during the training process with 70% of the images for training and 30%
for validation, we use data augmentation to prevent the network from
overtting. After the training, we classify all the images from the dataset and
generate CSV le containing for each image the concept with the highest
score.
        </p>
        <p>
          CQL Query : For each lifelogger u1 and u2, two tables were provided: the
minute-based table and the categories and concepts table. We import for
each lifelogger a table in the DBMS Cassandra, then we use Scala on Spark
to write CQL query. By analyzing topics in the test set, we nd that each
one can be divided into 5 axes to facilitate the retrieval process : user,
concept, activity, location, and irrelevance. These 5 axes can be translate to
a CQL query : Select column from user table where condition . The column
contains the activity, the concepts and the location. In the condition we can
use NOT IN to express irrelevance, IN, CONTAINS or LIKE to
express matching with concepts. The possibilities are numerous.
Query Analysis : To extract relevant concepts from the given query, we
build labeled textual descriptions of queries moments. For that purpose, we
used the development and the test set topics of the NTCIR-12 [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ],
NTCIR13, imageCLEF LRT 2017 [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] and imageCLEF LMRT 2018 that we have
combined. We obtained a csv le which contains for each topic title, the
topic description and the relevant concepts associated with the topic. We
convert the concepts to numeric vectors by training a word embedding.
After that, we create and train an LSTM network based on the sequences of
word vectors. The concepts used in query analysis phase are the same as the
one dened in ne-tuning phase.
        </p>
        <p>LSTM Classication : We choose to use LSTM in our architecture to
predict concepts for any given user query and not only those given by the
organizers. We aim to be general and global. For example, we take the case
of a lifelogger searching for the moments who shows him driving. He writes
either the title or the description and the trained LSTM will return the
concepts steering wheel, windshield.</p>
        <p>Retrieval : The retrieval phase consists of matching the extracted concepts
from the LSTM with the concept from the rst phase of ne-tuning. For
example, with the concepts steering wheel, windshield gived from the
previous LSTM classication phase, we perform a simple matching of these
concepts in the CSV le generated during the rst phase. After that, we sort
decreasingly the result to obtain the highest score values.
4</p>
      </sec>
      <sec id="sec-3-2">
        <title>Results obtained</title>
        <p>
          We submitted 6 runs on the LMRT subtask 2019 summarized in Table 1.
The runs submitted in the LMRT 2019 vary in the generation of image concepts.
For the rst run, we ne-tune Googlenet with the weight freeze of the rst 110
layers. For the second run, we ne-tune Googlenet without freezing. For the
third run, we ne-tune Alexnet. For the fourth and fth run, we use respectively
Googlenet and Alexnet to classify all the images of the test dataset. For the sixth
run, we used only the textual features given by the organizers. Fig. 2 presents the
detailed results of all teams that participated to the ImageCLEF LMRT tasks.
Ocial ranking metrics is the F1-measure@10, which gives equal importance
to diversity (via CR@10) and relevance (via P@10). The best team HCMUS
obtained F1-measure@10=0.61 with an interactive approach [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. For our team
REGIMLAB, which proposed only automatic approach, the best results were
given by the rst run with F1-measure=0.188, ranked sixth in the challenge.
The results of the runs submitted to the LMRT 2019 subtask are detailed in
tables 2, 3 and 4.
UPB
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Analysis of the results</title>
        <p>By analyzing F1-measure@10 results for each query Fig.3, we note that a neural
network that is trained on a dataset which is similar to the one encountered
during the test phase demonstrated a signicant improvement in the search
performance. Furthermore, ne-tuning with Googlenet with freezing the weights of
Cut-o P@5 P@10 P@20 P@30 P@40 P@50
RUN_1 0.280 0.280 0.240 0.237 0.233 0.222
RUN_2 0.260 0.250 0.235 0.220 0.218 0.214
RUN_3 0.260 0.250 0.240 0.227 0.223 0.220
RUN_4 0.100 0.090 0.100 0.103 0.093 0.088
RUN_5 0.080 0.070 0.070 0.067 0.063 0.064
RUN_6 0.060 0.070 0.055 0.040 0.043 0.040
Cut-o CR@5 CR@10 CR@20 CR@30 CR@40 CR@50
RUN_1 0.136 0.158 0.179 0.189 0.225 0.230
RUN_2 0.125 0.142 0.153 0.186 0.222 0.222
RUN_3 0.092 0.103 0.197 0.219 0.250 0.256
RUN_4 0.026 0.048 0.142 0.159 0.159 0.170
RUN_5 0.072 0.088 0.104 0.120 0.136 0.136
RUN_6 0.055 0.076 0.087 0.087 0.103 0.125
Cut-o F1@5 F1@10 F1@20 F1@30 F1@40 F1@50
RUN_1 0.168 0.188 0.180 0.180 0.207 0.202
RUN_2 0.153 0.167 0.161 0.170 0.197 0.194
RUN_3 0.133 0.142 0.185 0.183 0.191 0.190
RUN_4 0.041 0.062 0.096 0.111 0.100 0.101
RUN_5 0.060 0.062 0.069 0.074 0.076 0.073</p>
        <p>RUN_6 0.037 0.061 0.054 0.045 0.052 0.055
the 110 rst layers gave better performance than with Alexnet.</p>
        <p>We also see that for the second topic Find any moment when u1 was driving
home from the oce , the run 6 which is based on CQL overpass the best run.
This is due to the consideration of the latitude and longitude of volunteer’s
position described in the lifelog metadata description.</p>
        <p>Considering the precision measure in Fig.4 which assess the proportion of
relevant documents found among all documents found by the system, we can notice
a considerable dierence from one query to another. The accuracy depends
essentially on the examples that were provided during the transfer learning. The
three rst runs that are based on ne-tuning achieved a precision@10=1 for
the query : Find the moment when either u1 or u2 was watching football on
the TV . Besides, despite the fact that the ne-tuned images for the class
coffee come from another lifelogger, we achieved a precision@10=0.7 for the query
:Find the moment when u1 was having coee in a cafe .</p>
        <sec id="sec-3-3-1">
          <title>Topic001</title>
          <p>Run1
Run2
Run3
Run4
Run5
Run6
Run1
Run2
Run3
Run4
Run5
Run6
0.7
0.6
0.5
0.2
0.1
0
1
0.9
0.8
0.7
0.3
0.2
0.1
0</p>
        </sec>
        <sec id="sec-3-3-2">
          <title>Topic001</title>
          <p>6</p>
          <p>Conclusion and perspectives for future work
This paper presents our approach for lifelog moment retrieval at the ImageCLEF
Lifelog Moment Retrieval Task 2019. The new version, compared to the previous
participation at the LMRT 2018, employs a distributed database and framework
for storing and processing large volumes of data. The best performance was
reached by an interactive approach which incite us to include the user in the
process.</p>
          <p>The time limit and technical problems did not allow us to submit all the planned
runs. So as future work, we will combine visual and textual features to improve
the results. We also plan to perform neural network training on more powerful
computers with more GPUs to reduce learning time. Besides, we should lter
the dataset before the ne-tuning by removing uninformative and blurry images.
7</p>
        </sec>
      </sec>
      <sec id="sec-3-4">
        <title>Acknowledgments</title>
        <p>The research leading to these results has received funding from the Ministry of
Higher Education and Scientic Research of Tunisia under the grant agreement
number LR11ES48.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Babenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Slesarev</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Chigorin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Lempitsky</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Fleet</surname>
          </string-name>
          ; D., Pajdla; T.,
          <string-name>
            <surname>Schiele</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Tuytelaars</surname>
            ,
            <given-names>T</given-names>
          </string-name>
          . (Eds.),
          <article-title>Neural Codes for Image Retrieval Computer Vision</article-title>
          , ECCV , Springer International Publishing, pp.
          <fpage>584</fpage>
          -
          <lpage>599</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Abdallah</surname>
            ,
            <given-names>F. B.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Feki</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Ammar</surname>
            ,
            <given-names>A. B.</given-names>
          </string-name>
          ; &amp;
          <string-name>
            <surname>Amar</surname>
            ,
            <given-names>C. B.</given-names>
          </string-name>
          ,
          <article-title>A new model driven architecture for deep learning-based multimodal lifelog retrieval</article-title>
          .
          <source>In: poster Proceedings: International Conference WSCG, CSRN 2803</source>
          , pp
          <fpage>8</fpage>
          -
          <lpage>17</lpage>
          ,
          <string-name>
            <given-names>Czech</given-names>
            <surname>Republic</surname>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Abdallah</surname>
            ,
            <given-names>F.B.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Feki</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ; Ezzarka,
          <string-name>
            <given-names>M.</given-names>
            ;
            <surname>Ammar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.B.</given-names>
            &amp;
            <surname>Amar</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.B.</surname>
          </string-name>
          ,
          <source>Regim Lab Team at ImageCLEF Lifelog Moment Retrieval Task 2018. Working Notes of CLEF</source>
          <year>2018</year>
          , France(
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Abdallah</surname>
            ,
            <given-names>F. B.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Feki</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Ammar</surname>
            ,
            <given-names>A. B.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Amar</surname>
            ,
            <given-names>C. B.</given-names>
          </string-name>
          ,
          <article-title>Multilevel Deep Learning-Based Processing for Lifelog Image Retrieval Enhancement</article-title>
          .
          <source>In: Proceedings of the IEEE International Conference SMC</source>
          , pp
          <fpage>1348</fpage>
          -
          <lpage>1354</lpage>
          ,
          <string-name>
            <surname>Japan</surname>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ciocca</surname>
            , G.; Napoletano,
            <given-names>P.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Schettini</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Battiato</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ; Farinella,
          <string-name>
            <given-names>G. M.</given-names>
            ;
            <surname>Leo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            &amp;
            <surname>Gallo</surname>
          </string-name>
          ,
          <string-name>
            <surname>G</surname>
          </string-name>
          . (Eds.),
          <article-title>Learning CNN-based Features for Retrieval of Food Images, New Trends in Image Analysis and Processing</article-title>
          , ICIAP, Springer International Publishing, pp.
          <fpage>426</fpage>
          -
          <lpage>434</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Dang-Nguyen</surname>
          </string-name>
          , D.-T.;
          <string-name>
            <surname>Piras</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Riegler</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Boato</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Gurrin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , Overview of ImageCLEFlifelog 2017:
          <article-title>Lifelog Retrieval and Summarization CLEF2017 Working Notes</article-title>
          , CEUR-WS,
          <year>2017</year>
          , 1866
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Dang-Nguyen</surname>
          </string-name>
          , D.-T.;
          <string-name>
            <surname>Piras</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Riegler</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Lux</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Gurrin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , Overview of ImageCLEFlifelog 2018:
          <article-title>Daily Living Understanding and Lifelog Moment Retrieval CLEF2018 Working Notes, CEUR-WS.org /ceur-ws</article-title>
          .
          <source>org&gt;</source>
          ,
          <year>2018</year>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Dang-Nguyen</surname>
          </string-name>
          , D.-T.;
          <string-name>
            <surname>Piras</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Riegler</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Tran</surname>
          </string-name>
          , M.-T.;
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Lux</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Le</surname>
          </string-name>
          , T.-K.;
          <string-name>
            <surname>Ninh</surname>
          </string-name>
          , V.-T. &amp;
          <string-name>
            <surname>Gurrin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , Overview of ImageCLEFlifelog 2019:
          <article-title>Solve my life puzzle and Lifelog Moment Retrieval CLEF2019 Working Notes, CEUR-WS</article-title>
          .org ,
          <year>2019</year>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Ionescu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Mller</surname>
            , H.; PØteri, R.; Cid,
            <given-names>Y. D.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Liauchuk</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Kovalev</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Klimuk</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Tarasau</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Abacha</surname>
            ,
            <given-names>A. B.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Hasan</surname>
            ,
            <given-names>S. A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Datla</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ; Liu,
          <string-name>
            <given-names>J.</given-names>
            ;
            <surname>Demner-Fushman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ;
            <surname>Dang-Nguyen</surname>
          </string-name>
          , D.-T.;
          <string-name>
            <surname>Piras</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Riegler</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Tran</surname>
          </string-name>
          , M.-T.;
          <string-name>
            <surname>Lux</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Gurrin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Pelka</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Friedrich</surname>
          </string-name>
          ,
          <string-name>
            <surname>C. M.; de Herrera</surname>
            ,
            <given-names>A. G. S.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Garcia</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Kavallieratou</surname>
          </string-name>
          , E.;
          <string-name>
            <surname>del Blanco</surname>
            ,
            <given-names>C. R.</given-names>
          </string-name>
          ; Rodrguez,
          <string-name>
            <given-names>C. C.</given-names>
            ;
            <surname>Vasillopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ;
            <surname>Karampidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ;
            <surname>Chamberlain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ;
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            &amp;
            <surname>Campello</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          ,
          <source>ImageCLEF</source>
          <year>2019</year>
          :
          <article-title>Multimedia Retrieval in Medicine, Lifelogging, Security and Nature Experimental IR Meets Multilinguality</article-title>
          , Multimodality, and Interaction,
          <source>LNCS Lecture Notes in Computer Science</source>
          , Springer (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Gurrin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Joho</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Hopfgartner</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ; Albatal,
          <string-name>
            <surname>R.</surname>
          </string-name>
          ; Nguyen, D.T.D.,
          <source>Overview of NTCIR-13 Lifelog-2 Task. Proceedings of the Thirteenth NTCIR conference (NTCIR-13)</source>
          , Tokyo, Japan (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Gurrin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Joho</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Hopfgartner</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ; &amp;
          <string-name>
            <surname>Albatal</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2016</year>
          )., Overview of NTCIR-12
          <string-name>
            <given-names>Lifelog</given-names>
            <surname>Task</surname>
          </string-name>
          .
          <source>Proceedings of the 12th NTCIR Conference on Evaluation of Information Access Technologies</source>
          ,
          <string-name>
            <surname>Japan</surname>
          </string-name>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Le</surname>
          </string-name>
          , N.;
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ; Hoang,
          <string-name>
            <given-names>T.</given-names>
            ;
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ;
            <surname>Truong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ;
            <surname>Duy</surname>
          </string-name>
          , T. D.;
          <string-name>
            <surname>Luong</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Vo-Ho</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Tran</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <source>HCMUS at the NTCIR-14 Lifelog-3 Task. Proceedings of the 14th NTCIR Conference on Evaluation of Information Access Technologies</source>
          ,
          <string-name>
            <surname>Japan</surname>
          </string-name>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Yang</surname>
          </string-name>
          , H.-F.;
          <string-name>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.-H.; Hsiao</surname>
            ,
            <given-names>J.-H.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Chen</surname>
          </string-name>
          , C.-S.
          <source>Rapid Clothing Retrieval via Deep Learning of Binary Codes and Hierarchical Search Proceedings of the 5th ACM on International Conference on Multimedia Retrieval</source>
          , pp.
          <fpage>499</fpage>
          -
          <lpage>502</lpage>
          , ACM (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Radenovic</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Tolias</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Chum</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Leibe</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Matas</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ; Sebe,
          <string-name>
            <given-names>N.</given-names>
            &amp;
            <surname>Welling</surname>
          </string-name>
          , M. (Eds.)
          <article-title>CNN Image Retrieval Learns from BoW : Unsupervised Fine-Tuning with Hard Examples Computer Vision</article-title>
          , ECCV, Springer International Publishing, pp.
          <fpage>3</fpage>
          -
          <lpage>20</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Ren</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>He</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Girshick</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Faster</surname>
          </string-name>
          r-cnn:
          <article-title>Towards real-time object detection with region proposal networks</article-title>
          <source>Advances in neural information processing systems</source>
          ,
          <year>2015</year>
          ,
          <fpage>91</fpage>
          -
          <lpage>99</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Safadi</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Mulhem</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ; Qunot,
          <string-name>
            <given-names>G.</given-names>
            ;
            <surname>Chevallet</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.P.</surname>
          </string-name>
          :
          <article-title>LIG-MRIM at NTCIR12 Lifelog Semantic Access Task</article-title>
          ,
          <source>In The 12th NTCIR Conference</source>
          , Tokyo, Japan (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>del Molino</surname>
            ,
            <given-names>A. G.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Fang</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Subbaraju</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Lim</surname>
            ,
            <given-names>J. H.</given-names>
          </string-name>
          ; &amp;
          <string-name>
            <surname>Chandrasekhar</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <article-title>VCI2R at the NTCIR-13 Lifelog-2 Lifelog Semantic Access Task</article-title>
          .
          <source>In : Thirteenth NTCIR conference (NTCIR-13)</source>
          , Tokyo, Japan (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18. Xia L.; Ma Y.;
          <string-name>
            <surname>Fan</surname>
            <given-names>W. :</given-names>
          </string-name>
          <article-title>VTIR at the NTCIR-12 2016 Lifelog Semantic Access Task</article-title>
          .
          <source>In The 12th NTCIR Conference, Evaluation of Information Access Technologies</source>
          , Tokyo, Japan (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Yamamoto</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ; Nishimura,
          <string-name>
            <given-names>T.</given-names>
            ;
            <surname>Akagi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ;
            <surname>Takimoto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ;
            <surname>Inoue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            &amp;
            <surname>Toda</surname>
          </string-name>
          ,
          <string-name>
            <surname>H.</surname>
          </string-name>
          <article-title>Pbg at the ntcir-13 lifelog-2 lat, lsat, and lest tasks</article-title>
          ,
          <source>Proceedings of NTCIR13</source>
          , Tokyo, Japan, (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Piras</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Riegler</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Boato</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Nguyen</surname>
          </string-name>
          , D.T.D.;
          <string-name>
            <surname>Gurrin</surname>
            <given-names>C.</given-names>
          </string-name>
          , Organizer Team at ImageCLEFlifelog 2017:
          <article-title>Baseline Approaches for Lifelog Retrieval and Summarization</article-title>
          ,
          <source>In : CLEF2017 Working Notes (CEUR Workshop Proceedings)</source>
          , Dublin, Ireland (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>