<!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>BUAA-iCC at ImageCLEF 2015 Scalable Concept Image Annotation Challenge</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ningning Liu</string-name>
          <email>ningning.liu@uibe.edu.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Li Zhang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Information Technology and Management, University of International Business and Economics</institution>
          ,
          <addr-line>Beijing 100029</addr-line>
          ,
          <country country="CN">P.R.China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Yunhong Wang and Jiaxin Chen Intelligent Recognition and Image Processing Lab, Beihang University</institution>
          ,
          <addr-line>Beijing 100191</addr-line>
          ,
          <country country="CN">P.R.China</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this working note, we mainly focus on the image annotation subtask of ImageCLEF 2015 challenge that BUAA-iCC research group participated. For this task, we ¯rstly explore textual similarity information between each test sample and prede¯ned concept. Subsequently, two di®erent kinds of semantic information are extracted from visual images: visual tags using generic object recognition classi¯ers and visual tags relevant to human being related concepts. For the former information, the visual tags are predicted by using deep convolutional neural network (CNN) and a set of support vector machines trained on ImageNet, and ¯nally transferred to textual information. For the latter visual information, human related concepts are extracted via face and facial attribute detection, and ¯nally transferred to similarity information by using manually designed mapping rules, in order to enhance the performance of annotating human related concepts. Meanwhile, a late fusion strategy is developed to incorporate aforementioned various kinds of similarity information. Results validate that the combination of the textual and visual similarity information and the adopted late fusion strategy could yield signi¯cantly better performance.</p>
      </abstract>
      <kwd-group>
        <kwd>Textual similarity information</kwd>
        <kwd>visual similarity information</kwd>
        <kwd>deep convolutional neural network (CNN)</kwd>
        <kwd>face and facial attribute detection</kwd>
        <kwd>late fusion</kwd>
        <kwd>ImageCLEF</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        For the ImageCLEF 2015 Scalable Concept Image Annotation Challenge [
        <xref ref-type="bibr" rid="ref1 ref2">1,
2</xref>
        ], we aim to develop a scalable image annotation approach, which could also
yield high performance.
      </p>
      <p>As shown in Fig.1, our proposed framework mainly consists of three
components: exploration of textual similarity information between each testing sample
and prede¯ned concept, visual similarity information extraction and fusion of
various kinds of similarity information.</p>
      <p>
        For textual similarity information, we directly utilize the path[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] semantic
distance that is based on WordNet[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] ontology to construct textual similarity
matrix SimM at text, of which the element in row i, column j indicates the
similarity score between the i ¡ th sample and the j ¡ th prede¯ned concept.
      </p>
      <p>
        For visual similarity information, two di®erent kinds of semantical
information from visual images are ¯rstly extracted: visual tags using generic objection
recognition classi¯er and human-being related visual tags. As to the former one,
a deep convolutional neural network is trained to extract discriminative features,
and a set of support vector machine are trained on on ImageNet [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], based on
which each visual image from ImageCLEF 2015 testing data are tagged by using
object categories with top 5 probabilities. Through this way, a given visual image
is then transferred into textual semantic information, based on which one kind
of visual similarity matrices SimM at vis could be calculated by following the
same method for constructing SimM at text. As to the latter one, we use
existing face and facial attribute detectors [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] to obtain the following information
from visual images: the number of faces, facial age and facial gender, in order to
enhance the image annotation of human related concepts such as 'female-child ',
'man' and 'woman'. Subsequently, these face and facial attribute detection
results are transferred into another kind of visual similarity matrix SimM at f ace
via manually designed mapping rules.
      </p>
      <p>Each kind of similarity information could individually yield an image
annotation result. However, in order to further enhance the performance of the proposed
annotation method, a late fusion strategy is adopt to learn the optimal weight
coe±cient using develop set. Results demonstrate that the incorporation of the
proposed textual and visual similarity information could boost the performance,
and the late fusion strategy could further enhance the annotation accuracy
compared with trivial fusion schemes.</p>
      <p>The remainder of this working notes is organized as follows. Section 2
describes the details of the textual/visual similarity information extraction, and
late fusion strategy of fusion multiple modal similarity information. In Section
3, we summarize the implementation details of the submitted runs, and
demonstrate the experimental results together with the corresponding experimental
analysis. Finally, in section 4, we draw the conclusion of this working note.
2</p>
    </sec>
    <sec id="sec-2">
      <title>The proposed Framework</title>
      <p>In this section, we will elaborate the details of each components. We ¯rstly
describe the textual similarity information exploration in Section 2.1, followed
by the visual similarity information exploration via deep convolutional neural
networks in Section 2.2. In section 2.3, we present the visual similarity
information exploration by using face and facial attribute detection, and ¯nally detail
the late fusion strategy of fusing multiple sources of similarity information.
2.1</p>
      <sec id="sec-2-1">
        <title>Textual Similarity Information Exploration</title>
        <p>As provided by ImageCLEF 2015, each sample is composed by a visual image
and corresponding web textual xml ¯le. Textual similarity is therefore an
important information for image annotation. In our submission, the textual similarity
is explored by the strategy elaborated in Algorithm 1.</p>
        <p>Speci¯cally, given the textual description of the textual xml ¯les of all 500000
500000 and the prede¯ned 251 concepts fDj gj2=511, our goal is
test samples fWigi=1
to calculate the similarity score sij between the i ¡ th sample Wi to the j ¡ th
concept Dj , which ¯nally consists of the similarity matrix SimM at text with
SimM at text(i; j) = sij . sij is calculated as the following:</p>
        <p>Ni Nj
sij = X X dist(wi;k; dj;m);</p>
        <p>k=1 m=1
where Wi = fwi;kgkN=i 1 and Dj = fdj;mgNmj=1.</p>
        <p>
          In our implementation, we follow the method depicted in [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] and utilize
path[
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] distance that is based on the WordNet ontology[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] to measure the
semantic similarity dist(wi;k; dj;m) between two synsets wi;k and dj;m:
dist(wi;k; dj;m) = dpath(wi;k; dj;m) =
1
1 + spl(wi;k; dj;m)
;
where spl(wi;k; dj;m) returns the distance of the shortest path linking the two
synsets (if one exists).
        </p>
        <p>
          Finally, we normalized the similarity matrix SimM at text to [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ] as the
following:
        </p>
        <p>SimM at text(i; j) = (SimM at text(i; j) ¡ vmin)=(vmax ¡ vmin);
where vmax = maxi;j SimM at text(i; j) and vmin = mini;j SimM at text(i; j).
Algorithm 1 (Textual Similarity Computation)
Input: textual xml ¯le fWigi5=001000 of the complete samples; textual description fDjgj2=511 of
prede¯ned concepts
Output: A similarity matrix SimMat text 2 R500000£251, of which the element in the i ¡ th row
and j ¡ th column is the similarity score between the textual ¯le of each sample and the prede¯ned
concept
Steps:
1. Preprocess fWigi5=001000 and fDjgj2=511 by using a stop-words ¯lter.
2. For each textual description of concept i = 1 to 50000</p>
        <p>For each textual xml ¯le of sample j = 1 to 251</p>
        <p>SimMat text(i; j) = PkN=i 1 PNmj=1 dist(wi;k; dj;m),
end
end
where Wi = fwi;kgkN=i 1 and Dj = fdj;mgNmj=1, and dist(wi;k; dj;m) is the semantic similarity
distance de¯ned by WordNet.</p>
        <p>3. Calculate the maximal value vmax and minimal value vmin of SimMat text, and normalize
SimMat text: SimMat text(i; j) = (SimMat text(i; j) ¡ vmin)=(vmax ¡ vmin).
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Visual Similarity Exploration Based on Objection Recognition</title>
      </sec>
      <sec id="sec-2-3">
        <title>Via Deep Convolutional Neural Network</title>
        <p>
          In the past few years, signi¯cant progress in generic visual object
recognition has been achieved, by virtue of the availability of large scale datasets such
as ImageNet [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] and advances in recognition algorithms such as deep learning
[
          <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
          ]. Current visual recognition systems based on deep learning are capable
of recognizing thousands of object categories with promising accuracy. For
instance, by using the deep convolutional neural network (CNN), He et al. [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] has
reduced the visual recognition error rate on ImageNet 2012 dataset to 4.94%,
which has amazingly surpassed human-level performance (with error rate 5.1%
for comparison).
        </p>
        <p>
          It is therefore reasonable to adopt deep CNN trained on ImageNet to help
automatically annotate a visual image with a list of terms representing concepts
depicted in the image. In our proposed framework, we follow the similar way as
depicted in [
          <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
          ] for visual objection recognition using deep CNN. Speci¯cally,
we use the 1,571,576 ImageNet images in the 1,372 synsets as our training set,
and the 500,000 images in the image annotation task of imageCLEF 2015 as
our test set. For images with di®erent sizes, we uniformly wrapped all training
and testing images into 256x256. For each image in both sets, we extracted
activation of a pre-trained CNN model as its feature. The model is a reference
implementation of the structure proposed in Krizhevsky et al. [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] with minor
modi¯cations, and is made publicly available through the Ca®e project [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
        <p>
          Once the feature is extracted for both training and test sets, 1,372 binary
classi¯ers are trained and applied using LIBSVM [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], which give probability
estimates for the test images. For each image, the 1,372 classi¯ers are then ranked
in order of their probability estimates. In order to reliably capture the
semantic information contained in the test image, we only choose the categories with
top 5 probabilities, through which visual images are ¯nally transferred into
tex500000. We therefore could construct visual similarity information
tual tags fTigi=1
SimM at vis 2 R500000£251 via the same way as the textual xml ¯le, i.e., by
using Algorithm 1 in Section 2.1.
2.3
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>Visual Similarity Exploration Via Face and Facial Attribute</title>
      </sec>
      <sec id="sec-2-5">
        <title>Detection</title>
        <p>
          Human being is one of the most frequently occurred objects in visual images,
of which face is one of the most representive and critical biometrics. Recent years
have seen the substantial progress in face detection, face recognition together
with facial attribute recognition. For example, on the largest unconstrained face
dataset Label Face in the Wild (LFW) [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], the most state-of-the-art approach
[
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] has archived 99.63% accuracy using deep learning. Many open access cloud
planform for face recognition have also merged, such as Face++ [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], which could
provide free API services for face and facial attributes (such as age, gender, race
and etc.) detection.
        </p>
        <p>
          In our framework, we assume that the face and facial attribute detection
could explore useful semantic information from visual images. Considering its
promising performance [
          <xref ref-type="bibr" rid="ref18 ref19">18, 19</xref>
          ] and open access, we adopt Face++ as a tool for
face and facial attribute detection, and ¯nally utilize the following three results
to enhance performance of visual image automatic annotation:
1). F Anum face: number of face detected.
2). F Aage: age of each detected face.
3). F Agender: gender of each detected face.
        </p>
        <p>It should be noted that F Anum face 2 N; F Aage 2 N; F Agender 2 f'female',
'male'g, where F Anum face and F Aage are numeric variables, and could not be
directly used for image annotation. Here, we manually design a mapping from
F Anum face, F Aage, F Agender to the similarity score between each visual image
and the prede¯ned 251 concepts.</p>
        <p>Speci¯cally, we ¯rstly select a concept subset C14 containing 14 concepts
related to human being from the complete 251 concept set CAll: C14 = f 'arm',
'eye', 'face', 'female-child ', 'foot ', 'hair ', 'head ', 'leg ', 'male', 'man', 'mouth',
'neck ', 'nose', 'woman' g. For the i¡th input visual image, we obtain F Anum face,
F Aageand F Agender using Face++. Subsequently, we calculate the 251
dimensional vector si describing the similarities between the visual image and CAll as
the following: if CAll(j) 2= C14, s(i; j) = 0; if CAll(j) 2 C14, s(i; j) is evaluated
according to F Anum face, F Aage, F Agender and the mapping rules described in
concept Call(j) is 'men', s(i; j) = 1, if F A(niu)m face &gt; 0 and F A(gie)nder =0 male0,
and s(i; j) = 0 otherwise. It is worth noting that di®erent concepts in C14 are
assigned di®erent values according to their prior tightness to facial attributes.
Considering that f 'eye', 'face', 'female-child ', 'male', 'man', 'mouth', 'nose',
'woman' g could be determined by the face and facial attribute with high
con¯dence, they are assigned the highest similarity score 1 once the condition is
satis¯ed as described in Tabel 1. f 'arm', 'hair ', 'head ', 'leg ', 'neck ' g are
assigned similarity score 0.8, since they are less closely related to facial attributes.
f 'foot ' g is evaluated 0.6, which is further less relevant to facial attributes.</p>
        <p>For each visual images of the 500000 testing samples, we could calculate a
251 dimensional similarity score vector, which ¯nally consists the similarity score
matrix SimM at f ace 2 R500000£251.</p>
        <p>Until now, we have obtained three di®erent kinds of similarity matrices:
SimM at text, SimM at vis, SimM at f ace, each of which could yield an
individual image annotation result. For instance, we could sort each row of SimM at text,
and select the concepts with top k similarity scores as the ¯nal annotations.
However, SimM at text, SimM at vis, SimM at f ace are three di®erent sources of
similarity information between each sample and concept. It could be expected
that better performance could be archived by fusing these three similarity
matrices.</p>
        <p>
          In our submission, we adopt similar late fusion scheme proposed by [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
Generally, given K di®erent similarity matrix fSimM at igiK=1, the overall similarity
K
matrix SimM at f inal is a weighted sum of fSimM at igi=1 as follows:
SimM at f inal =
        </p>
        <p>K
X wi ¤ SimM at i;
i=1
where PK</p>
        <p>i=1 wi = 1 and wi ¸ 0.</p>
        <p>
          In our implementation, the optimal weights fwigiK=1 are determined by using
the Selective Weighted Late Fusion (SWLF) algorithm [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] on the develop set
with 1980 annotated samples.
        </p>
        <p>After obtained the ¯nal similarity matrix SimM at f inal, we could assign the
label to each sample. In this submission, we mainly adopt two di®erent schemes:</p>
        <p>Annotation scheme 1 : we select concepts with top N similarity scores as the
¯nal annotations;</p>
        <p>Annotation scheme 2 : we select concepts, of which the similarity score is
greater than the given threshold T , as the ¯nal annotations.</p>
        <p>The optimal N and T could be chosen by maximizing the Mean Average
Precision (MAP) on the develop set.
3
3.1</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>BUAA-iCC Runs and Experimental Results</title>
      <sec id="sec-3-1">
        <title>Description of Submissions</title>
        <p>We submitted total ten runs, which are di®er from similarity information
fused, fusion strategies, and annotation schemes. The brief description of each
submission are summarized as follows:</p>
        <p>IRIP-iCC 01 : SimMat ¯nal=SimMat vis; adopt Annotation scheme 1, where
N = 6 is chosen by maximizing MAP on develop set.</p>
        <p>IRIP-iCC 02 : SimMat ¯nal=SimMat text; adopt Annotation scheme 1, where
N = 6 is chosen by maximizing MAP on develop set.</p>
        <p>IRIP-iCC 03 : SimMat ¯nal=SimMat text+SimMat vis+SimMat face; adopt
Annotation scheme 1, where N = 6 is chosen by maximizing MAP on develop
set.</p>
        <p>IRIP-iCC 04 : SimMat ¯nal=SimMat text+SimMat vis+SimMat face; adopt
Annotation scheme 1, where N = 7 is chosen manually.</p>
        <p>IRIP-iCC 05 : SimMat ¯nal=SimMat text+SimMat vis+SimMat face; adopt
Annotation scheme 1, where N = 251 is chosen manually.</p>
        <p>IRIP-iCC 06 : SimMat ¯nal=w*(SimMat text+SimMat vis)+(1¡w)*SimMat face,
where w = 0:6 is chosen by SWLF; adopt Annotation scheme 2, where T = 0:5
is chosen manually.</p>
        <p>IRIP-iCC 07 : SimMat ¯nal=w*(SimMat text+SimMat vis)+(1¡w)*SimMat face,
where w = 0:6 is chosen by SWLF; adopt Annotation scheme 1, where N = 6 is
chosen by maximizing MAP on develop set.</p>
        <p>IRIP-iCC 08 : SimMat ¯nal=w*(SimMat text+SimMat vis)+(1¡w)*SimMat face,
where w = 0:6 is chosen by SWLF; adopt Annotation scheme 1, where N = 7 is
chosen manually.</p>
        <p>IRIP-iCC 09 : SimMat ¯nal=w*(SimMat text+SimMat vis)+(1¡w)*SimMat face,
where w = 0:6 is chosen by SWLF; adopt Annotation scheme 2, where T = 0:6
is chosen by maximizing MAP on develop set.</p>
        <p>IRIP-iCC 10 : SimMat ¯nal=w*(SimMat text+SimMat vis)+(1¡w)*SimMat face,
where w = 0:6 is chosen by SWLF; adopt Annotation scheme 2, where T = 0:4
is chosen manually.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Results of Submitted runs</title>
        <p>
          As described in [
          <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
          ], the annotation accuracy together with the localization
precision are evaluated by Mean Average Precision (MAP) with ® overlap. For
instance, mAP 0 overlap stands for MAP without considering localization
overlap, and mAP 0:5 overlap stands for MAP with o.5 localization overlap. In our
submission, we mainly focus on evaluate the performance of the proposed
framework on annotation accuracy. So we mainly analyze the experimental results of
mAP 0 overlap. For mAP 0:5 overlap, we simply use the objectness detector
proposed in [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] for concept localization.
        </p>
        <p>The experimental results are shown in Table 2. From submissions
IRIPiCC 01, IRIP-iCC 02 and IRIP-iCC 03, we can see that visual similarity by
using CNN performs better than textual similarity information extracted from
xml ¯le, and fusion of visual similarity information and textual similarity
information could signi¯cantly boost the performance of each single similarity
information. It also could be seen that IRIP-iCC 06 and IRIP-iCC 09 yield top
1 and top 2 mAPs, respectively, indicating that the weight w via late fusion
strategy using SWLF could enhance the performance. The mAP of IRIP-iCC 09
is about 2% higher than IRIP-iCC 06, which could verify that the performance
could be further boosted by choosing optimal threshold T via develop set.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>In this paper, we described the participation of BUAA-iCC at ImageCLEF
2015 Scalable Concept Image Annotation Challenge. We proposed a novel image
annotation framework by fusing textual similarity information, and visual
similarity information explored by deep convolutional neural network (CNN), face
and facial attribute detection.</p>
      <p>Experimental results reveals that the visual similarity information extracted
by deep CNN, face and facial attribute detection could enhance the performance
of the textual similarity information extracted from xml ¯les. The similarity
information fusion strategy using selective weighted late fusion could signi¯cantly
boosts the performance. The annotation scheme by selecting concepts with
similarity score larger than an automatically determined threshold, which maximizes
the MAP of samples from develop set, yields better performance than other
annotation schemes.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgement</title>
      <p>This work was supported in part by the HongKong, Macao and Taiwan
Science &amp; Technology Cooperation Program of China under the grant L2015TGA9004,
the Fundamental Research Funds for the Central University in UIBE under grant
14QD21.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Villegas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>MuÄller</surname>
          </string-name>
          , H.,
          <string-name>
            <surname>Gilbert</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Piras</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mikolajczyk</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Herrera</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bromri</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Amin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mohammed</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Acar</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Uskudarli</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marvasti</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aldana</surname>
          </string-name>
          , and J., Garc¶³a., M.:
          <article-title>General Overview of ImageCLEF at CLEF2015 Labs</article-title>
          . Lecture Notes in Computer Science, Springer International Publishing,(
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Gilbert</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Piras</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , and et al.:
          <article-title>Overview of the ImageCLEF 2015 Scalable Image Annotation, Localization and Sentence Generation task</article-title>
          .
          <source>In: CEUR Workshop Proceedings</source>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dellandrea</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bichot</surname>
            ,
            <given-names>C. E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bras</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Tellez</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Multimodal recognition of visual concepts using histograms of textual concepts and selective weighted late fusion scheme</article-title>
          .
          <source>Computer Vision</source>
          and Image Understanding,
          <volume>117</volume>
          (
          <issue>5</issue>
          ), (
          <year>2013</year>
          )
          <fpage>493</fpage>
          -
          <lpage>512</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Budanitsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Hirst</surname>
          </string-name>
          , G.:
          <article-title>Semantic distance in WordNet: An experimental, application-oriented evaluation of ¯ve measures</article-title>
          .
          <source>In Workshop on WordNet and Other Lexical Resources (Vol. 2)</source>
          (
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>G. A.</given-names>
          </string-name>
          :
          <article-title>WordNet: a lexical database for English</article-title>
          .
          <source>Communications of the ACM</source>
          ,
          <volume>38</volume>
          (
          <issue>11</issue>
          ), (
          <year>1995</year>
          )
          <fpage>39</fpage>
          -
          <lpage>41</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Deng</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dong</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Socher</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>L. J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Fei-Fei</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Imagenet: A largescale hierarchical image database</article-title>
          .
          <source>In Computer Vision and Pattern Recognition</source>
          ,
          <year>2009</year>
          .
          <article-title>CVPR 2009</article-title>
          .
          <article-title>IEEE Conference on</article-title>
          .
          <source>IEEE</source>
          (
          <year>2009</year>
          )
          <fpage>248</fpage>
          -
          <lpage>255</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Krizhevsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Hinton</surname>
          </string-name>
          , G. E.:
          <article-title>Imagenet classi¯cation with deep convolutional neural networks</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          (
          <year>2012</year>
          )
          <fpage>1097</fpage>
          -
          <lpage>1105</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Szegedy</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jia</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sermanet</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reed</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Anguelov</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Erhan</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vanhoucke</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rabinovich</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Going deeper with convolutions</article-title>
          .
          <source>arXiv preprint arXiv:1409.4842</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>He</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ren</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Sun</surname>
          </string-name>
          , J.:
          <article-title>Delving deep into recti¯ers: Surpassing human-level performance on imagenet classi¯cation</article-title>
          .
          <source>arXiv preprint arXiv:1502</source>
          .
          <year>01852</year>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Russakovsky</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deng</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Su</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krause</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Satheesh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Ma,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Karpathy</surname>
          </string-name>
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Khosla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Bernstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Berg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.C.</given-names>
            , and
            <surname>Fei-Fei</surname>
          </string-name>
          ,
          <string-name>
            <surname>L.</surname>
          </string-name>
          :
          <article-title>ImageNet Large Scale Visual Recognition Challenge (ILSVRC)</article-title>
          .
          <source>arXiv:1409.0575</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Donahue</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jia</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vinyals</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <source>Ho®man, J</source>
          ., Zhang, N.,
          <string-name>
            <surname>Tzeng</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Darrell</surname>
            ,
            <given-names>T.L</given-names>
          </string-name>
          :
          <article-title>Decaf: A deep convolutional activation feature for generic visual recognition</article-title>
          .
          <source>arXiv preprint arXiv:1310.1531</source>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J. K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yan</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aker</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Gaizauskas</surname>
          </string-name>
          , R.:
          <article-title>A Poodle or a Dog? Evaluating Automatic Image Annotation Using Human Descriptions at Di®erent Levels of Granularity</article-title>
          . V&amp;L
          <string-name>
            <surname>Net</surname>
          </string-name>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Jia</surname>
          </string-name>
          , Y.:
          <article-title>Ca®e: An open source convolutional architecture for fast feature embedding</article-title>
          . http://ca®e. berkeleyvision. org (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>C. C.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>C. J.:</given-names>
          </string-name>
          <article-title>LIBSVM: a library for support vector machines</article-title>
          .
          <source>ACM Transactions on Intelligent Systems and Technology (TIST)</source>
          ,
          <volume>2</volume>
          (
          <issue>3</issue>
          ) (
          <year>2011</year>
          )
          <fpage>27</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>G. B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ramesh</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berg</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Learned-Miller</surname>
            ,
            <given-names>E:</given-names>
          </string-name>
          <article-title>Labeled faces in the wild: A database for studying face recognition in unconstrained environments</article-title>
          (Vol.
          <volume>1</volume>
          , No.
          <volume>2</volume>
          , p.
          <fpage>3</fpage>
          <lpage>)</lpage>
          .
          <source>Technical Report 07-49</source>
          , University of Massachusetts, Amherst (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16. Schro®,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Kalenichenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            , and
            <surname>Philbin</surname>
          </string-name>
          , J.:
          <article-title>Facenet: A uni¯ed embedding for face recognition and clustering</article-title>
          . In: CVPR. (
          <year>2015</year>
          ),
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>Megvii</given-names>
            <surname>Inc</surname>
          </string-name>
          .: Face++ Research Toolkit. http: //www.faceplusplus.com,
          <year>December 2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cao</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Yin</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          :
          <article-title>Naive-Deep Face Recognition: Touching the Limit of LFW Benchmark or Not?</article-title>
          .
          <source>arXiv preprint arXiv:1501.04690</source>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cao</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jiang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yin</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Doudou</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Learning deep face representation</article-title>
          .
          <source>arXiv preprint arXiv:1403.2802</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Alexe</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deselaers</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Ferrari</surname>
          </string-name>
          , V.:
          <article-title>Measuring the objectness of image windows</article-title>
          .
          <source>Pattern Analysis and Machine Intelligence</source>
          , IEEE Transactions on,
          <volume>34</volume>
          (
          <issue>11</issue>
          ),
          <fpage>2189</fpage>
          -
          <lpage>2202</lpage>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>