<!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>Retrieving Events in Life Logging</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ergina Kavallieratou</string-name>
          <email>kavallieratou@aegean.gr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Carlos R. del-Blanco</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Carlos Cuevas</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Narciso García</string-name>
          <email>narciso@gti.ssr.upm.es</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Information &amp; Communication Systems Engineering, University of the Aegean</institution>
          ,
          <addr-line>Samos 83200</addr-line>
          ,
          <country country="GR">Greece</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Grupo de Tratamiento de Imágenes, ETSI Telecomunicación, Universidad Politécnica de Madrid</institution>
          ,
          <addr-line>Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <fpage>5</fpage>
      <lpage>15</lpage>
      <abstract>
        <p>This paper describes our contribution for the Lifelog Moment Retrieval (LMRT) challenge of ImageCLEF Lifelog2018. Lifelogging has a tremendous potential in many applications. However, the wide range of possible moment events along with the lack of fully annotated databases make this task very challenging. This work proposes an interactive and weakly supervised learning approach that can dramatically reduce the time to retrieve any kind of events in huge databases. Impressive results have been obtained in the referred challenge, reaching the first rank.</p>
      </abstract>
      <kwd-group>
        <kwd>Life Logging</kwd>
        <kwd>Deep Learning</kwd>
        <kwd>Supervised Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Lifelogging is the procedure of retrieving and tracking personal data during the daily
life. The potential applications are endless, from memory retrieval [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] to surveillance
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Due to this fact, an increasing number of research works and events have been
appearing in the last years, such as:
• the LifeLog of DARPA of the U.S. Department of Defense [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and
• MyLifeBits by Gordon Bell of Microsoft [
        <xref ref-type="bibr" rid="ref4 ref5">4-5</xref>
        ].
      </p>
      <p>
        Since then, many lifeloggers have tracked huge quantities of big data for various
purposes [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ][
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The technology makes it easy to collect data automatically using
sensors. However, there is not still a consolidate framework to analyze all this data to
properly extract useful information for the target applications. On the other hand, a lot
of discussion is taking place over the privacy and the ethics dimension of lifelogging
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Besides all, the huge potential of lifelogging has encouraged new efforts to advance
in this line, such as the two competitions that have started the last two years:
• NTCIR Lifelog Task [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
• ImageCLEFlifelog [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>
        This year, the ImageCLEF Lifelog 2018 [
        <xref ref-type="bibr" rid="ref11 ref12">11-12</xref>
        ] has been divided into two subtasks
(challenges):
• The LMRT challenge about Lifelog Moment Retrieval
• The ADLT challenge about Activities of Daily Living.
      </p>
      <p>In this paper, three strategies are presented addressing the LMRT challenge. The
participants had to retrieve a number of specific moments in a lifelogger’s life.
Moments were defined as semantic events or activities that happened throughout the day.
The ground truth for this subtask was created using manual annotation. The dataset
consisted of 50 days of data from a lifelogger, namely: images (1,500-2,500 per day
from wearable cameras), visual concepts (automatically extracted visual concepts with
varying rates of accuracy), semantic content (semantic locations, semantic activities)
based on sensor readings (via the Moves App) on mobile devices, biometrics
information (heart rate, galvanic skin response, calorie burn, steps, etc.), music listening
history. The dataset is built based on the data available for the NTCIR-13 - Lifelog 2</p>
      <sec id="sec-1-1">
        <title>Task, which contained a total of 80,440 images.</title>
        <p>The rest of the paper is structured as follows. In section 2, the proposed three
strategies are described, in section 3 the experimental results for some trials are presented,
while the conclusions are included in the section 4.
2</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Proposed Strategies</title>
      <p>Three different strategies have been conceived for addressing the ImageCLEFlifelog
2018 challenge, with the purpose to accurately retrieve images that correspond to the
ten proposed topics (Table 1, Fig.1). The first strategy, called Two-class strategy, a
deep learning framework has been developed that considers every topic independently.
This is, two classes are considered per topic, one representing the event o action
described by the topic, and the other the absence of it. The second strategy, called
Tenclass strategy, considers all the topics simultaneously. Thus, the developed deep neural
network uses ten output classes, one per topic. And finally, the last strategy, called
Eleven-class strategy, is an evolution of the second one that adds an additional output
to consider events that do not belong to the 10 referred challenge topics.</p>
      <p>In this section the proposed strategies, as well as the preprocessing and
postprocessing stages, are described in detail.</p>
      <sec id="sec-2-1">
        <title>Topic Title</title>
        <sec id="sec-2-1-1">
          <title>Preparing Salad</title>
        </sec>
        <sec id="sec-2-1-2">
          <title>VR Experiments</title>
        </sec>
        <sec id="sec-2-1-3">
          <title>My Presentations</title>
        </sec>
        <sec id="sec-2-1-4">
          <title>Interviewed by a TV presenter</title>
        </sec>
        <sec id="sec-2-1-5">
          <title>Dinner at Home</title>
        </sec>
        <sec id="sec-2-1-6">
          <title>Assembling Furniture LST007 LST008 LST009</title>
          <p>LST010</p>
        </sec>
        <sec id="sec-2-1-7">
          <title>Taking a coach/bus in foreign countries</title>
        </sec>
        <sec id="sec-2-1-8">
          <title>Costa Coffee with friends</title>
        </sec>
        <sec id="sec-2-1-9">
          <title>Using mobile phone or tablets in a vehicle</title>
        </sec>
        <sec id="sec-2-1-10">
          <title>Graveyard</title>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Topic ID</title>
        <p>LST001
LST002
LST003
LST004
LST005
LST006
LST007
LST008
LST009
LST010
In order to limit the big volume of images, considering the given metadata and the
topics, we decided to split the images in the subdirectories, automatically, by using the
Location and Activity tag of the metadata. Thus, two sets of directories were created,
named after the names of the specific tag:
1. The Activity set was including just 3 directories: transport, airplane and
walking, plus a fourth one called No-activity, including all the images with no
information over activity.
2. The Location set was including 96 directories, plus a directory called No-place,
including all the images where no named place was mentioned.</p>
        <p>This automatic classification helped us to consider less images for a first retrieval to
train our systems. Thus, for the presented topics (Table 1) corresponding directories
were chosen, according to the description and the restrictions (Fig.1), as they are
presented in Table 2.
2.2</p>
      </sec>
      <sec id="sec-2-3">
        <title>Two-class strategy</title>
        <p>This strategy (Fig.2) had to be repeated for each topic separately. For each image the
question is: Does it satisfy the topic? Thus, for each topic we have two classes, namely:
True, where the correct images are included; and False, all the others. After a first
retrieval, applied to the corresponding directory, the system is retrained and tested over
all data.</p>
        <p>Considering the directory sets from preprocessing, the required steps include:
1. Manual choice of true images: In most cases about 10 images were selected as True,
most of the times by the same event. Important exceptions were the topics 006 and
010 that there were few examples and, especially in 006, difficult to be found.
2. Training by using pretrained CNN: The pretrained Convolution Neural Networks</p>
        <p>
          AlexNet [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] or GoogleNet [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] were used.
3. Testing on the corresponding data (Table 1): The appropriate directories were
chosen in accordance to the description and details given of the topic (Fig.1). The four
co-authors discussed a lot over the various topics. However, many times we had to
ask the organizers for explanations due to cultural differences and definitions.
4. Manually splitting the results to the two classes: here is where the maximum of five
minutes of search time allowed per topic, was used. In fact, a simple application was
created that was showing the True images and asking for a YES or NO entered by
the user. The procedure was very fast. In most topics, 1-2 minutes were enough. The
topic 008 required just few seconds. Exception was the topic 006. The negative
results were so many that we just kept the True and False that were reached in 5 mins,
so not all the images of the corresponding directory were used for the final training.
5. Training using the same pretrained CNN: the AlexNet or GoogleNet that were used
in step 2 was also used here.
        </p>
        <sec id="sec-2-3-1">
          <title>6. Testing on all data: the retrained CNN was applied to all 80,439 images.</title>
        </sec>
        <sec id="sec-2-3-2">
          <title>7. Postprocessing, in order to adapt the results to the required format. Three trials have been submitted by this strategy: one using AlexNet (subm#1), one using GoogleNet (subm#2) and one using the average of the two CNNs (subm#3).</title>
          <p>1st retrieval</p>
        </sec>
        <sec id="sec-2-3-3">
          <title>Manual choice of true images</title>
        </sec>
        <sec id="sec-2-3-4">
          <title>Training by using pretrained CNN</title>
        </sec>
        <sec id="sec-2-3-5">
          <title>Testing on the corresponding data (Table 1)</title>
        </sec>
        <sec id="sec-2-3-6">
          <title>Manually splitting the results to the two classes</title>
        </sec>
        <sec id="sec-2-3-7">
          <title>Training using the same pretrained CNN</title>
        </sec>
        <sec id="sec-2-3-8">
          <title>Testing on all data</title>
        </sec>
        <sec id="sec-2-3-9">
          <title>Postprocessing</title>
          <p>This strategy (Fig.3) is applied just once for the ten topics. However, it is required to
have the result of the first retrieval of the Two-class strategy (§2.2) that includes the
steps 1-4. Then the True classes of each topic is created by merging the results of the
previous strategy for both AlexNet and GoogleNet. These will be the ten classes of this
strategy. Thus, the strategy includes the steps:
1. Merging of the True classes of AlexNet and GoogleNet after the 1st retrieval (Fig.2)
for each topic i.e. 10 classes.
2. Training a pretrained CNN: the AlexNet or GoogleNet, using the ten classes.</p>
        </sec>
        <sec id="sec-2-3-10">
          <title>3. Testing on all data: the retrained CNN was applied to all 80,439 images.</title>
        </sec>
        <sec id="sec-2-3-11">
          <title>4. Postprocessing to adapt the required format.</title>
          <p>Two trials have been submitted by this strategy: one using AlexNet (subm#4) and
one using GoogleNet (subm#5). The AlexNet trial proved to be our best submission.
2.4</p>
        </sec>
      </sec>
      <sec id="sec-2-4">
        <title>Eleven-class strategy</title>
        <p>This strategy (Fig.4) is very similar to the previous one, including one more class:
the class that an image is included if doesn’t belong to any other. For the training, this
class was the merging all the False classes of the Two-class strategy, excluding the
images that have already included to the classes of the Ten-class strategy. Thus, this
strategy includes the steps:
1. Merging of the True classes of AlexNet and GoogleNet after the 1st retrieval (Fig.2)
for each topic i.e. 10 classes
2. Merging the False classes of the Two-class strategy, excluding the images included
at the 10 classes.
3. Training a pretrained CNN: the AlexNet or GoogleNet, using the eleven classes.</p>
        <sec id="sec-2-4-1">
          <title>4. Testing on all data: the retrained CNN was applied to all 80,439 images.</title>
        </sec>
        <sec id="sec-2-4-2">
          <title>5. Postprocessing to adapt the required format. One trial has been submitted by this strategy using AlexNet (subm#6). It was not possible to submit in-time using GoogleNet (subm#0), since it required to much time for train due to the large number of images in the eleventh class, that is 37,063 images.</title>
          <p>The Subtask 2 of ImageCLEFlifelog 2018 requires for the submissions a CSV file in
the following format:
[topic id, image id, confidence score]
(1)
Where: - topic id: Number of the queried topic, e.g., 1 to 10 - image id: ID of a relevant
image - confidence score: from 0 to 1. The CSV file should contain a diversified
summarization in 50 images for each query.</p>
          <p>The postprocessing procedure is creating the CSV file automatically and it is the same
for the three strategies, using the probabilities of the classify level of the CNN. Thus,
the images are ranked by the probabilities from high to low, for each result class (True
of the Two-class strategy and the ten classes of Ten-class and Eleven-class strategies.</p>
        </sec>
        <sec id="sec-2-4-3">
          <title>As correct are chosen the first 50 images that:</title>
          <p>• Have corresponding ID in metadata: the organizers were accepting as possible
correct images only the images that were labeled in metadata with an ID number.
• Satisfy all the rules e.g. in topic 005, since dinner is required the time is required to
be greater than 15.00.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experimental results</title>
      <p>For assessing performance, The organizers proposed the classic metrics for retrieval,
specifically:
• Cluster Recall at X (CR@X) - a metric that assesses how many different clusters
from the ground truth are represented among the top X results;
• Precision at X (P@X) - measures the number of relevant photos among the top X
results;
• F1-measure at X (F1@X) - the harmonic mean of the previous two.
All the presented results have been performed using Matlab in a computer with
processor Intel(R) Core™ i7-7700HQ CPU@2.80 GHz x8 and GPU NVIDIA GeForce GTX
1060. Exception was the trial that was not submitted, due to extreme requirements in
training. This was finally performed in a computer Intel(R) Core™ i9-7900X CPU@</p>
      <sec id="sec-3-1">
        <title>3.30 GHz x10 and GPU NVIDIA corporation device 1b02 x2.</title>
        <p>Submission ID
subm#1
subm#2
subm#3
subm#4
subm#5
subm#6
subm#0
Strategy</p>
      </sec>
      <sec id="sec-3-2">
        <title>Two-class</title>
      </sec>
      <sec id="sec-3-3">
        <title>Two-class</title>
      </sec>
      <sec id="sec-3-4">
        <title>Two-class</title>
      </sec>
      <sec id="sec-3-5">
        <title>Ten-class</title>
      </sec>
      <sec id="sec-3-6">
        <title>Ten-class</title>
      </sec>
      <sec id="sec-3-7">
        <title>Eleven-class</title>
      </sec>
      <sec id="sec-3-8">
        <title>Eleven-class</title>
        <p>CNN</p>
      </sec>
      <sec id="sec-3-9">
        <title>AlexNet</title>
      </sec>
      <sec id="sec-3-10">
        <title>GoogleNet</title>
      </sec>
      <sec id="sec-3-11">
        <title>Average</title>
      </sec>
      <sec id="sec-3-12">
        <title>AlexNet</title>
      </sec>
      <sec id="sec-3-13">
        <title>GoogleNet</title>
      </sec>
      <sec id="sec-3-14">
        <title>AlexNet</title>
      </sec>
      <sec id="sec-3-15">
        <title>GoogleNet</title>
        <p>Official ranking metrics this year are the F1-measure@10, which gives equal
importance to diversity (via CR@10) and relevance (via P@10). In table 3, indicative
Topic
LST001
LST002
LST003
LST004
LST005
LST006
LST007
LST008
LST009
LST010
Mean
Topic
LST001
LST002
LST003
LST004
LST005
LST006
LST007
LST008
LST009
LST010
Mean
Topic
LST001
LST002
LST003
LST004
LST005
LST006
LST007
LST008
LST009
LST010
Mean
Topic
LST001
LST002
LST003
LST004
LST005
LST006
LST007
LST008
LST009
LST010
Mean
results of F1@10 are given for all the mentioned submissions (subm#1-6), plus the not
submitted trial of the third strategy (subm#0).</p>
        <p>In Table 4, F1@Χ for various cut off points are considered, with X=5, 10, 20, 30, 40,
50, for all the proposed techniques. Finally, in Tables 5-11, are given all the detailed
results for the submission 1-6, plus the no-submitted trial.
0.66
0.22</p>
        <p>1
0.98
0.72
0
0.7
1
0.36
0.54
0.618
0.8
0.12
0.98
0.96
0.78</p>
        <p>0
0.96
1
0.1
0.34
0.604</p>
        <p>CR@30 F1@30
1 0.824
1 0.286
0.667 0.713</p>
        <p>1 0.966
0.167 0.274</p>
        <p>0 0
0.833 0.72
0.75 0.857
0.4 0.416
1 0.462
0.682 0.552</p>
        <p>P@40
0.625
0.175
0.825
0.95
0.775</p>
        <p>0
0.65</p>
        <p>1
0.575
0.25
0.583</p>
        <p>CR@50 F1@50
1 0.75
1 0.276
0.667 0.751</p>
        <p>1 0.958
0.292 0.422</p>
        <p>0 0
0.833 0.724
0.75 0.857
0.4 0.46
1 0.361
0.694 0.556
to handle a huge number of images for retrieving moments for ten specific topics. 3
different strategies were proposed in order to respond to the 10 topics. All of them used
deep learning and specifically AlexNet and GoogleNet.</p>
        <p>Except of the amount of images, other facts that we had to deal with was the cultural
differences e.g. what time is dinner for the specific country, as well as the differences
in definitions e.g. for some people, vehicle is what is moving on the road while for
others can be any transport mean. Last but no least, the explanation of the topics by the
participants could also be a problem e.g. what Assembling Furniture includes?</p>
        <p>The detailed results, given by the organizers and presented in section 3, require much
more experimentation and further study. For example, the topic LST004 Interviewed
by a TV presenter, almost always gave a result very close to 1, while the LST006
Assembling Furniture gave always 0. The last one means that no correct image was among
the ones we chose as True. Thus, the organizers could consider the possibility of giving</p>
      </sec>
      <sec id="sec-3-16">
        <title>1-2 correct images per topic, at the beginning of the competition. In any case, it is a challenge that can create many new research fields and worth to be considered.</title>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Acknowledgements</title>
      <p>This work has been partially supported by the Ministerio de Economía, Industria y
Competitividad (AEI/FEDER) of the Spanish Government under project
TEC201675981 (IVME).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Allen</surname>
          </string-name>
          , Anita L.:
          <article-title>Dredging up the past: Lifelogging, memory, and surveillance</article-title>
          . The University of Chicago Law Review, vol.
          <volume>75</volume>
          , no 1, p.
          <fpage>47</fpage>
          -
          <lpage>74</lpage>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>O</given-names>
            <surname>'Hara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Tuffield</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. M.</given-names>
            , &amp;
            <surname>Shadbolt</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          :
          <article-title>Lifelogging: Privacy and empowerment with memories for life</article-title>
          .
          <source>Identity in the Information Society</source>
          ,
          <volume>1</volume>
          (
          <issue>1</issue>
          ),
          <fpage>155</fpage>
          -
          <lpage>172</lpage>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Magazine</surname>
          </string-name>
          , G.:
          <article-title>LifeLog: DARPA looking to record lives of interested parties</article-title>
          . https://www.geek.com/news/lifelog-darpa
          <article-title>-looking-to-record-lives-of-interested-parties552879/ (</article-title>
          <year>2013</year>
          ),
          <source>retrieved on 28-5-2018.</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Gemmell</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bell</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lueder</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drucker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Wong</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>MyLifeBits: fulfilling the Memex vision</article-title>
          .
          <source>In Proceedings of the tenth ACM international conference on Multimedia</source>
          (pp.
          <fpage>235</fpage>
          -
          <lpage>238</lpage>
          ). ACM.(
          <year>2002</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Gemmell</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bell</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Lueder</surname>
          </string-name>
          , R.:
          <article-title>MyLifeBits: a personal database for everything</article-title>
          .
          <source>Communications of the ACM</source>
          ,
          <volume>49</volume>
          (
          <issue>1</issue>
          ),
          <fpage>88</fpage>
          -
          <lpage>95</lpage>
          , (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Sueda</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Miyaki</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Rekimoto</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Social geoscape: visualizing an image of the city for mobile UI using user generated geo-tagged objects</article-title>
          .
          <source>In International Conference on Mobile and Ubiquitous Systems: Computing</source>
          , Networking, and
          <string-name>
            <surname>Services</surname>
          </string-name>
          (pp.
          <fpage>1</fpage>
          -
          <lpage>12</lpage>
          ). Springer, Berlin, Heidelberg, (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Heo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kang</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Bae</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Lifelog collection using a smartphone for medical history form</article-title>
          .
          <source>In IT Convergence and Services</source>
          (pp.
          <fpage>575</fpage>
          -
          <lpage>581</lpage>
          ). Springer, Dordrecht, (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Jacquemard</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Novitzky</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>O'Brolcháin</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smeaton</surname>
            ,
            <given-names>A. F.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Gordijn</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Challenges and opportunities of lifelog technologies: A literature review and critical analysis</article-title>
          .
          <source>Science and engineering ethics</source>
          ,
          <volume>20</volume>
          (
          <issue>2</issue>
          ),
          <fpage>379</fpage>
          -
          <lpage>409</lpage>
          , (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>Cathal</given-names>
            <surname>Gurrin</surname>
          </string-name>
          , Hideo Joho, Frank Hopfgartner, Liting Zhou, Rami Albatal:
          <article-title>Overview of NTCIR-12 Lifelog Task</article-title>
          .
          <source>Proceedings of the 12th NTCIR Conference on Evaluation of Information Access Technologies</source>
          , Tokyo, Japan, (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Duc-Tien</surname>
            Dang-Nguyen,
            <given-names>Luca</given-names>
          </string-name>
          <string-name>
            <surname>Piras</surname>
          </string-name>
          , Michael Riegler, Giulia Boato, Liting Zhou, Cathal Gurrin: Overview of ImageCLEFlifelog 2017:
          <article-title>Lifelog Retrieval and Summarization</article-title>
          .
          <source>CLEF2017 Working Notes</source>
          , Dublin, Ireland, vol
          <year>1866</year>
          , (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Duc-Tien</surname>
          </string-name>
          Dang-Nguyen and
          <article-title>Luca Piras and Michael Riegler and Liting Zhou and Mathias Lux and Cathal Gurrin: Overview of ImageCLEFlifelog 2018: Daily Living Understanding and Lifelog Moment Retrieval</article-title>
          .
          <source>CLEF2018 Working Notes. CEUR Workshop Proceedings</source>
          . (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <article-title>Bogdan Ionescu and Henning Muller and Mauricio Villegas and Alba Garcia Seco de Herrera and Carsten Eickhoff and Vincent Andrearczyk and Yashin Dicente Cid and Vitali Liauchuk and Vassili Kovalev and Sadid A. Hasan and Yuan Ling and Oladimeji Farri and Joey Liu and Matthew Lungren and Duc-Tien Dang-Nguyen and Luca Piras and Michael Riegler and Liting Zhou and Mathias Lux and Cathal Gurrin: Overview of ImageCLEF 2018}: Challenges, Datasets and Evaluation. Experimental IR Meets Multilinguality, Multimodality, and Interaction</article-title>
          .
          <source>Proceedings of the Ninth International Conference of the CLEF Association (CLEF</source>
          <year>2018</year>
          ).
          <source>LNCS Lecture Notes in Computer Science</source>
          , Springer, (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Krizhevsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Hinton</surname>
            ,
            <given-names>G. E.</given-names>
          </string-name>
          :
          <article-title>Imagenet classification with deep convolutional neural networks</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          . pp.
          <fpage>1097</fpage>
          -
          <lpage>1105</lpage>
          , (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Szegedy</surname>
            , Christian, Wei Liu, Yangqing Jia,
            <given-names>Pierre</given-names>
          </string-name>
          <string-name>
            <surname>Sermanet</surname>
          </string-name>
          , Scott Reed, Dragomir Anguelov, Dumitru Erhan, Vincent Vanhoucke, and Andrew Rabinovich:
          <article-title>Going deeper with convolutions</article-title>
          .
          <source>In Proceedings of the IEEE conference on computer vision and pattern recognition</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          . (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>