<!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>UNED-UV@2016 Retrieving Diverse Social Images Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>E. de Ves Informatics</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>U. Valencia esther.deves@uv.es</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>A. Castellanos NLP&amp;IR Group UNED</institution>
          ,
          <addr-line>Madrid</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>A. García-Serrano NLP&amp;IR Group UNED</institution>
          ,
          <addr-line>Madrid</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>X. Benavent Informatics, U. Valencia</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2016</year>
      </pub-date>
      <fpage>20</fpage>
      <lpage>21</lpage>
      <abstract>
        <p>This paper details the participation of the UNED-UV group at the MediaEval 2016 Retrieving Diverse Social Images Task using a multimodal approach. Several Local Logistic Regression models, which use the visual low-level features, estimate the relevance probability for all the images in the dataset. Then, the images are ranked by selecting the highest probability image at each of the textual clusters. These textual clusters are generated by making use of a textual algorithm based on Formal Concept Analysis (FCA) and Hierarchical Agglomerative Clustering (HAC) to detect the latent topics addressed. The images will be then diversi ed according to detected topics.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        Information retrieval systems have mainly relied on
optimizing the result list according to accuracy-based metrics.
However, when dealing with image retrieval, systems should
be able to o er relevant but also diverse results [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Then,
we propose a multimodal approach that works with
relevance and diversity. It uses a relevance feedback algorithm
developed by the UV group [
        <xref ref-type="bibr" rid="ref3 ref6 ref7">3, 6, 7</xref>
        ]. This method estimates
the similarity probability of all the images from the dataset
using visual low-level features by means of several Local
Logistic Regression models (LLR) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. It has extensively been
proven that the visual information has a great impact in
the information retrieval systems [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. For diversi cation,
we propose an approach to represent an image by applying
the concepts covered by the textual information of the
images. This conceptual representation is tackled by means of
Formal Concept Analysis (FCA) [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], a data organization
technique. In our participation in previous editions of this
task, we proved that this approach was able to identify the
di erent topics addressed in the images, allowing the
diversi cation of the results list according to them [
        <xref ref-type="bibr" rid="ref4 ref5">5, 4</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>SYSTEM DESCRIPTION</title>
      <p>We present a two-step system that ranks a list of retrieved
images taking into account the relevance of the retrieved
images to the given query and showing as much diversity
as possible. The rst step is based on a relevance feedback
algorithm that estimates the relevance of each image to the
query by using the provided visual low-level features of the
2.1</p>
    </sec>
    <sec id="sec-3">
      <title>Relevancy via relevance feedback</title>
      <p>
        We try to get the relevance of each of the images to the
given query by using a relevance feedback algorithm [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The
general methodology involves four steps:
1. Reduction of the data dimensionality. The provided
low-level visual features [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] are used to generate a feature
vector associated to each image that will be generically
denoted as x in a dimensional space N = 8194. These features
are reduced using a Principal Component Analysis (PCA).
We retain only the rst components that account for 80%
of the data variability. We have used this idea to reduce the
original dimension of our characteristic space in a new
characteristic vector of dimension M &lt; N , being M = 52. One
of the advantages of this reduction is that the new
transformed components are in decreasing order with respect to
the variance explained by the corresponding principal
component;
2. Selecting the relevant and non-relevant sets. The user
looks at a few screens, each showing some images and marks
some of them as being relevant and non-relevant (run4 ). For
the automatic runs (run1, run3 and run5 ), these sets are
automatically selected. Relevant images are the rst P images
of the ranked Flicker list that belong to di erent
textualFCA o visual (k-means) clusters, being P = 5. The goal
of selecting relevant images from di erent clusters is to give
diverse relevant example images for the model to improve
the diversity in the estimation. We use a K-means
clustering by using provided visual low-level features in run1 and
run5, and a textual FCA cluster by using provided textual
features [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] in run3. Non-relevant images are selected from
other topics at each query;
3. Parameter estimation of the Local Logistic Regression
Models [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The reduced feature vectors (PCA) and the
relevant and non-relevant sets are the inputs or several Local
Logistic Regression models whose outputs are the
probabilities that an image belongs to the relevant set. The feature
vector is splitted dynamically in m groups of non- xed size.
Each group is used for adjusting the model of higher order,
given the inputs sets and PCA components;
4. Ranking of the database. Models are evaluated on all
the images of the database and return the probabilities of
being relevant for each estimated model; as results, we have
a probability vector (p) of dimension m for each individual
image. We combine these probabilities in just one by using
a weighted average. The weights (w) for a given probability
are obtained by the amount of variance accounted for the
group of components used to adjust the model. Finally, this
procedure gives us a score/probability for each image.
2.2
      </p>
    </sec>
    <sec id="sec-4">
      <title>Clusters for diversity</title>
      <p>The nal rank is generated by selecting the highest
probability image from the di erent clusters trying to give as
much diversity as possible to the diverse nal list. If there
are less than 50 clusters, a second highest probability
image selection is done. We have generated clusters for the
ranking using textual information, from run2 to run5, and
k-means clusters by using the visual information of the
images (run1 ).
2.2.1</p>
      <sec id="sec-4-1">
        <title>Textual clusters with FCA</title>
        <p>
          The presented clustering procedure is based on the
discovering of the latent topics addressed by the textual
information in the images. To that end, Formal Concept Analysis
is proposed to detect these topics and a Hierarchical
Agglomerative Clustering (HAC) [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] to group similar images
together into the detected topics. Each HAC-based cluster
contains the image set covering a similar topic. Thereafter,
the images of each cluster are ranked according to their
diversity based on their visual features.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>FCA-based Modelling.</title>
        <p>
          Formal Concept Analysis (FCA) is a theory of concept
formation [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] for the organization of content according to
their related features. The basic formation of FCA is the
formal context, a structure K := (G; M; I), where G is a set
of objects, M a set of attributes related to these objects and
I a binary relationship between G and M , denoted by gIm:
the object g has the attribute m. From the formal context,
a set of formal concepts can be inferred i.e., a formal
concept is a pair (A; B) of images A and the features shared
by those images B and organized in a lattice from the most
generic to the most speci c one. By applying FCA to the
formal context containing the textual information of the
images, they are modelled in terms of formal concepts, which
group together the images sharing a same set of features.
In order to select only those most-representative features,
we applied Kullback-Leibler Divergence (KLD) [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] on the
textual contents related to the images. This KLD-based
selection represents each image by the textual contents that
better di erentiates a image from the other ones.
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>HAC-based grouping.</title>
        <p>
          From the FCA formal concepts, a set of diverse image
groups is created by applying a HAC algorithm [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
Specifically, we propose a Single Linking Hierarchical Clustering
that groups together similar formal concepts and the
ZeroInduces index to set the cluster similarity [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ].
2.2.2
        </p>
      </sec>
      <sec id="sec-4-4">
        <title>Visual clusters</title>
        <p>
          The clusters are made by a k-means procedure (k = 18)
over the PCA components of the provided visual low-level
features [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>RESULTS</title>
      <p>We submitted ve runs (see table 1), four of them are
automatic (run1, run2, run3 and run5 ), and one, run4 a
run1
run2
run3
run4
run5
text
human-based run. All of them use our two-step system
except run2 that uses only the second step, ranking the images
by textual clusters with FCA. Three of them are multimodal
runs (run3, run4 and run5 ) using both textual and visual
information.</p>
      <p>Results are presented in table 2. It is interesting to point
out that our best result for both precision and diversi cation
is obtained with the multimodal human-based approach:
estimating the probability of the relevance of each image to the
query by a LLR model, and then ranking the nal list with
FCA clusters, run4, F @20 = 0:4597. Second best result,
run5, F @20 = 0:4562, is the same run4 approach, but
automatically selecting the relevant and non-relevant images
sets for estimating the LLR models. It is also important
to observe that both automatic multimodal runs, run5 and
run4, overcome the automatic monomodal runs, run1 and
run2 as expected.
4.</p>
    </sec>
    <sec id="sec-6">
      <title>CONCLUSIONS</title>
      <p>We presented a multimodal approach, that estimates the
relevance of the images by a relevance feedback algorithm
using the visual features for determining the similarity. To
handle image diversi cation, we apply a conceptual-based
procedure (based on FCA and HAC) to cluster the images
according to the latent topics addressed by their textual
content. Results show that our multimodal approach works
properly for retrieving similar diverse images. Results also
show the importance of a proper selection of relevant and
non-relevant sets for the relevance algorithm. A human
knows better the meaning and the diversity of the topics.
Our challenge is to make the approach automatic to be able
to select these relevant and non-relevant images as a human
being. The presented results are encouraging.</p>
      <p>Acknowledgements. This work has been partially
supported by PhD fellowship (FPI-UNED 2014), VOXPOPULI
(TIN2013-47090-C3-1-P), MUSACCES (S2015/HUM3494)
and DPI2013-47279-C2-1-R projects.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gollapudi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Halverson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Ieong</surname>
          </string-name>
          .
          <article-title>Diversifying search results</article-title>
          .
          <source>In Proceedings of the Second ACM International Conference on Web Search and Data Mining</source>
          , pages
          <volume>5</volume>
          {
          <fpage>14</fpage>
          . ACM,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>F.</given-names>
            <surname>Alqadah</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Bhatnagar</surname>
          </string-name>
          .
          <article-title>Similarity measures in formal concept analysis</article-title>
          .
          <source>Annals of Mathematics and Arti cial Intelligence</source>
          ,
          <volume>61</volume>
          (
          <issue>3</issue>
          ):
          <volume>245</volume>
          {
          <fpage>256</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>X.</given-names>
            <surname>Benavent</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Garcia-Serrano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Granados</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Benavent</surname>
          </string-name>
          , and E. de Ves.
          <article-title>Multimedia information retrieval based on late semantic fusion approaches: Experiments on a wikipedia image collection</article-title>
          .
          <source>Multimedia</source>
          , IEEE Transactions on,
          <source>PP(99):1{1</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Castellanos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Benavent</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Garc</surname>
          </string-name>
          a-Serrano, E. de Ves, and
          <string-name>
            <given-names>J.</given-names>
            <surname>Cigarran</surname>
          </string-name>
          .
          <article-title>Uned-uv @ retrieving diverse social images task</article-title>
          .
          <source>In MediaEval Multimedia Benchmark Workshop, CEUR-WS.org, 1436, ISSN 1613-0073</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Castellanos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cigarran</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Garc</surname>
          </string-name>
          a-Serrano.
          <article-title>Uned @ retrieving diverse social images task</article-title>
          .
          <source>In MediaEval Multimedia Benchmark Workshop, CEUR-WS.org, 1263, ISSN 1613-0073</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6] E. de Ves, G. Ayala,
          <string-name>
            <given-names>X.</given-names>
            <surname>Benavent</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Domingo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Dura</surname>
          </string-name>
          .
          <article-title>Modeling user preferences in content-based image retrieval: a novel attempt to bridge the semantic gap</article-title>
          .
          <source>Neurocomputing</source>
          ,
          <volume>168</volume>
          :
          <fpage>829</fpage>
          {
          <fpage>845</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>E. de Ves</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Benavent</surname>
            ,
            <given-names>I. Coma</given-names>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Ayala</surname>
          </string-name>
          .
          <article-title>A novel dynamic multi-model relevance feedback procedure for content-based image retrieval</article-title>
          .
          <source>Neurocomputing</source>
          , pages
          <volume>99</volume>
          {
          <fpage>107</fpage>
          ,
          <year>October 2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>B.</given-names>
            <surname>Ionescu</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. L. G</surname>
          </string-name>
          ^nsca,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zaharieva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Boteanu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lupu</surname>
          </string-name>
          , , and H. Muller.
          <source>Retrieving Diverse Social Images at MediaEval</source>
          <year>2016</year>
          :
          <article-title>Challenge, Dataset and Evaluation</article-title>
          . In MediaEval 2016 Workshop, October 20-21, Hilversum, Netherlands,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kullback</surname>
          </string-name>
          and
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Leibler</surname>
          </string-name>
          .
          <article-title>On information and su ciency</article-title>
          .
          <source>The Annals of Mathematical Statistics</source>
          ,
          <volume>22</volume>
          (
          <issue>1</issue>
          ):
          <volume>79</volume>
          {
          <fpage>86</fpage>
          ,
          <year>1951</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>C.</given-names>
            <surname>Loader</surname>
          </string-name>
          .
          <article-title>Local regression and likelihood</article-title>
          . New York: Springer-Verlag,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>C. D. Manning</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Raghavan</surname>
          </string-name>
          , and H. Schutze.
          <source>Hierarchical clustering. pages</source>
          <volume>377</volume>
          {
          <fpage>403</fpage>
          .
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Rudinac</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hanjalic</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Larson</surname>
          </string-name>
          .
          <article-title>Generating visual summaries of geographic areas using community-contributed images</article-title>
          .
          <source>IEEE Transactions on Multimedia</source>
          ,
          <volume>15</volume>
          (
          <issue>4</issue>
          ):
          <volume>921</volume>
          {
          <fpage>932</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>R.</given-names>
            <surname>Wille</surname>
          </string-name>
          .
          <article-title>Concept lattices and conceptual knowledge systems</article-title>
          .
          <source>Computers &amp; mathematics with applications</source>
          ,
          <volume>23</volume>
          (
          <issue>6</issue>
          ):
          <volume>493</volume>
          {
          <fpage>515</fpage>
          ,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>