<!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>Viewpoints combined classification method in image- based plant identification task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Gábor Szűcs</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dávid Papp</string-name>
          <email>pappdavid27@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dániel Lovas</string-name>
          <email>lovas.daniel@simonyi.bme.hu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics</institution>
          ,
          <addr-line>Magyar Tudósok krt. 2., H-1117, Budapest</addr-line>
          ,
          <country country="HU">Hungary</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Inter-University Centre for Telecommunications and Informatics</institution>
          ,
          <addr-line>Kassai str. 26., H-4028, Debrecen</addr-line>
          ,
          <country country="HU">Hungary</country>
        </aff>
      </contrib-group>
      <fpage>763</fpage>
      <lpage>770</lpage>
      <abstract>
        <p>The image-based plant identification challenge was focused on tree, herbs and ferns species identification based on different types of images. The aim of the task was to produce relevant species for each observation of a plant of the test dataset. We have elaborated a viewpoints combined classification method for this challenge. We have applied dense SIFT for feature detection and description; and Gaussian Mixture Model based Fisher vector was calculated to represent an image with high-level descriptor. The chosen classifier was the C-support vector classification algorithm with RBF (Radial Basis Function) kernel, and we have optimized two hyperparameters (C from C-SVC and γ from RBF kernel) by a grid search with two-dimensional grid. We have constructed a combined classifier using the weighted average of reliability values of classifier at each viewpoint. The results show that our combined method exceeds our best classifier among the list of classifiers constructed for different viewpoints.</p>
      </abstract>
      <kwd-group>
        <kwd>GMM based Fisher vector</kwd>
        <kwd>C-support vector classification</kwd>
        <kwd>viewpoint combination</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Accurate knowledge of the identity, statistics and uses of plants is essential in the
agricultural development. Identifying plant species is usually a very difficult task, even for
professionals (such as farmers or wood exploiters) or for the botanists themselves.
Using image retrieval technologies is nowadays considered by botanists as a promising
direction in this problem, and in order to solve it a challenge is announced in the
LifeCLEF campaign [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        The image-based plant identification task [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] was focused on tree, herbs and ferns
species identification based on different types of images. There are 7 viewpoints at the
images: branch, leaf, scan (scan or scan-like pictures of leaf, briefly “LeafScan”),
flower, fruit, stem, and entire views. The number of species was about 500, which is an
important step towards covering the entire flora of a given region.
      </p>
      <p>The aim of the task was to produce a list of relevant species for each observation of a
plant of the test dataset, i.e. one or a set of several pictures related to a same event: one
same person photographing several detailed views on various organs the same day with
the same device with the same lightening conditions observing one same plant. So the
task was observation-centered (not image-centered).</p>
      <p>The task was based on the Pl@ntView dataset focusing plants on France (some plants
observations came from neighbouring countries). It contains more than 60000 pictures
belonging each to one of the 7 types of view reported into the meta-data, in an xml file
(one per image) with explicit tags, like ObservationId, species names, date, etc.
The task was evaluated as a plant species retrieval task based on multi-image plant
observations queries. The goal was to retrieve the correct plant species among the top
results of a ranked list of species returned by the evaluated system. An observation may
contain 1 to 5 images depicting the same individual plant observed by the same person
the same day. Each image of a query observation is associated with a single view type
(entire plant, branch, leaf, fruit, flower, stem or leaf scan) and with contextual
metadata (data, location, and author). Each participating group was allowed to submit up to
4 runs built from different methods.</p>
      <p>User rating information (pictures with the average of the user ratings on image quality)
was also available, but we have not used this additional information.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Image-based plant classification</title>
    </sec>
    <sec id="sec-3">
      <title>Elaboration of image descriptors</title>
      <p>
        The first part of the classification is the accomplishment of representation of each image
based on the visual content. This consists of three steps: (i) feature detection, (ii) feature
description, (iii) image description as usual phases in computer vision.
Feature detection: Lots of different feature types can be detected in an image, e.g.
corners, edges, ridges, as “interesting” part of an image. Furthermore many possible
feature extraction methods are available for images, but we have chosen SIFT
(Scale-Invariant Feature Transform) algorithm [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ][
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], because this is a widely used method in
practice and in theoretical works (as well) with some possible further development of
this method.
Feature description: In our solution we have used dense sampling method with SIFT
(briefly dense SIFT). This sampling method can be considered as a two-dimensional
grid upon the image, where SIFT descriptors were calculated at each grid point. After
that we have used PCA (Principal Component Analysis) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ][
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] to reduce the dimensions
of the descriptor vectors from 128 to 80. This descriptor vector belongs to only one
“interesting” point of an image, but an image possesses many feature descriptor vectors,
which should be aggregated into an image descriptor.
      </p>
      <p>
        Image description: The final step of the representation creating is the completion of
high level representation of each image. We have applied BoW (bag-of-words) model
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ][
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] for this purpose, where images are treated as documents. According to this,
“visual words” (so called “codewords”) in images need to be defined from feature
descriptors. The whole set of codewords gives the codebook (similarly to dictionary in
text tasks). To determine the codebook we used GMM (Gaussian Mixture Model)
[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ][
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. This is a parametric probability density function represented as a weighted
sum of (in our case 256) Gaussian component densities. GMM parameters were
estimated based on the training set by using the iterative EM (Expectation Maximization)
algorithm [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], but an initial model was needed for EM. In our training procedure the
kmeans clustering [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] was performed over all the vectors with 256 clusters, which
resulted the initial model for EM. As a result of the algorithms described above, a
codebook with 256 codewords was available for further calculations, which can be
considered as a concise representation of the image set. According to the codebook the next
step is to create a descriptor that specifies the distribution of the visual codewords in
any image, called high-level descriptor. To represent an image with high-level
descriptor, the GMM based Fisher vector [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ][
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] was calculated. These vectors were the
final representation (image descriptor) of the images. The code used to train GMM
vocabularies and compute the Fisher vectors is a standalone C++ library, developed by
Jorge Sánchez, to support the research of Visual Geometry Group of Oxford University
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
2.2
      </p>
    </sec>
    <sec id="sec-4">
      <title>Training the classifier</title>
      <p>
        For the classification task we have divided the labelled image set into three subsets:
training, validation and test set (the last one is used for preliminary testing). The
validation image set was used for calibration of the trained model during the validation
phase of the training procedure. To train the classifier (classification model) based on
training image set, a variation of SVM (Support Vector Machine) was used, the C-SVC
(C-support vector classification) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ][
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] with RBF (Radial Basis Function) kernel. The
SVM is basically a binary linear classifier, thus in order to extend it to a number of
classified categories, the one-against-all technique was used. During this method a
binary classifier was created for each category in the training set.
The two hyperparameters (C from C-SVC and γ from RBF kernel) were optimized by
a grid search with two-dimensional grid. The algorithm was trained with the training
image set, and then validated on the validation set, while the hyperparameters were
different in each iteration. The parameter pair that gave the best result is selected to
train the final classification model (for each category) based on the whole image set.
2.3
      </p>
    </sec>
    <sec id="sec-5">
      <title>Preliminary testing</title>
      <p>After the training, the codebook was already available and only Fisher vector of each
image should be computed. At the preliminary testing we have selected only 50 species
(classes) for training and testing as well. RBF based kernel matrix was built from the
Fisher vectors of the test and training images. Each C-SVC classifier was parametered
with this matrix and the hyperparameters were the same as in the final classification
models. Since the classifiers are assigned to species, the generated model for a classifier
is responsible to separate the designated class from the other ones. Thus a classifier is
able to provide a confidence value showing a certainty of the class in a given image.
We have trained 7 classifiers for each viewpoint and we have evaluated as preliminary
testing based on precision and computer run time. The results of the preliminary testing
can be seen in Table 1.</p>
    </sec>
    <sec id="sec-6">
      <title>Viewpoints combination for observation classification</title>
      <p>The decision about the observation could be based on majority voting of image
decisions, but we have used continuous information instead of discrete one. C-SVC
classifier calculates continuous reliability value for each class at each image, and we have
constructed a combined classifier using the weighted average of reliability values. Our
precision
0.341
0.583
0.965
0.492
0.512
0.314
0.482
testing time (per image)
[sec]
1.82
1.59
0.95
1.39
1.61
1.44
1.56
combined classifier has applied a formula (as can be seen in Equation 1.) for the
aggregated reliability value that an image belongs to class c (species c).
(1)
 NVP is the number of viewpoints, which equals to seven in this challenge
 wi is the weight parameter of viewpoint i
 rn(c) is reliability value for class c coming from C-SVC classifier
 Ni,p is the number of images in viewpoint i taken from the p-th plant observed
Based on R(c) values the final decision is always the species that possesses the largest
R(c) value. In the challenge the order of predicted species should have been submitted,
and we have constructed the order based on R(c) values as well.</p>
      <p>At the estimation of weight parameters we have taken the goodness of different
viewpoint classifiers into the consideration. As can be seen in the results of the preliminary
testing (at Table 1), the LeafScan has the best precision. So the LeafScan has got the
largest weight parameter, and on an empirical way we have chosen the following weight
parameters: LeafScan: 7.5, Leaf: 2.5, Flower: 1.5, Fruit: 1.5, Stem: 1.5, Branch: 1.5,
Entire: 1.5.
3
3.1</p>
    </sec>
    <sec id="sec-7">
      <title>Evaluation</title>
    </sec>
    <sec id="sec-8">
      <title>Evaluation metrics</title>
      <p>In the official evaluation instead of precision (as used in our preliminary testing) a new
evaluation metric was defined for measurement of goodness of the observation
classification. This metric (S score) is defined as follows.
 U : number of users (who have at least one image in the test data)
 Pu : number of individual plants observed by the u-th user
 Nu,p : number of pictures taken from the p-th plant observed by the u-th user
 Su,p : score between 1 and 0 equals to the inverse of the rank of the correct species
(for the p-th plant observed by the u-th user)
Although the goal was to classify the observations containing more images, an
additional metric was defined for the image classification as can be seen in Equation 3.</p>
      <p>1 U 1 Pu 1 Nu,p
Simage  U u1 Pu p1 Nu, p n1 Su, p,n
(3)
 U : number of users (who have at least one image in the test data)
 Pu : number of individual plants observed by the u-th user
 Nu,p : number of pictures taken from the p-th plant observed by the u-th user
 Su,p,n : score between 1 and 0 equals to the inverse of the rank of the correct
species (for the n-th picture taken from the p-th plant observed by the u-th user)
3.2</p>
    </sec>
    <sec id="sec-9">
      <title>Final official results</title>
      <p>Simage score can be calculated for each viewpoint, and these scores can be compared.
Our final official results for each viewpoint and the observation can be seen in Table
2., and it can be shown that S score of observation exceeds the best S score of all
viewpoints.
Our final official observation results (BME TMIT) compared with other participants
can be seen in Fig. 1.
We have elaborated a viewpoints combined classification method for image-based plant
identification task. We have applied dense SIFT for feature detection and description;
and Gaussian Mixture Model based Fisher vector was calculated to represent an image
with high-level descriptor. The chosen classifier was the C-support vector classification
algorithm with RBF (Radial Basis Function) kernel, and we have optimized two
hyperparameters (C from C-SVC and γ from RBF kernel) by a grid search with
two-dimensional grid. We have constructed a combined classifier using the weighted average
of reliability values of classifier at each viewpoint. The weight parameters of the
combined classifier were based on our preliminary testing results. Our observation result of
the combined method exceeds our best score of all viewpoints. At the official evaluation
our solution has reached 0.255 score value.</p>
    </sec>
    <sec id="sec-10">
      <title>Acknowledgement</title>
      <p>The publication was supported by the TÁMOP-4.2.2.C-11/1/KONV-2012-0001
project. The project has been supported by the European Union, co-financed by the
European Social Fund.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Abdi</surname>
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Williams</surname>
            <given-names>L. J.: Principal</given-names>
          </string-name>
          <string-name>
            <surname>Component</surname>
            <given-names>Analysis</given-names>
          </string-name>
          ,
          <source>Wiley Interdisciplinary Reviews: Computational Statistics</source>
          , Vol
          <volume>2</volume>
          . No.
          <issue>4</issue>
          , pp.
          <fpage>433</fpage>
          -
          <lpage>459</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Boser</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guyon</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vapnik</surname>
          </string-name>
          , V.:
          <article-title>A Training Algorithm for Optimal Margin Classifier</article-title>
          ,
          <source>Proc. of the 5th Annual ACM Workshop on Computational Learning Theory</source>
          , pp.
          <fpage>144</fpage>
          -
          <lpage>152</lpage>
          (
          <year>1992</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Joly</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Müller</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goëau</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Glotin</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Spampinato</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rauber</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bonnet</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vellinga</surname>
            ,
            <given-names>W.P.</given-names>
          </string-name>
          , Fisher,
          <string-name>
            <surname>B.</surname>
          </string-name>
          :
          <article-title>Lifeclef 2014: multimedia life species identification challenges</article-title>
          .
          <source>In: Proceedings of CLEF</source>
          <year>2014</year>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Cortes</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vapnik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Support-vector networks</article-title>
          ,
          <source>Machine Learning</source>
          , Vol.
          <volume>20</volume>
          , No.
          <issue>3</issue>
          , pp.
          <fpage>273</fpage>
          -
          <lpage>297</lpage>
          (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Dempster</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Laird</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rubin</surname>
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Maximum likelihood from Incomplete Data via the EM Algorithm</article-title>
          ,
          <source>Journal of the Royal Statistical Society</source>
          , Vol.
          <volume>39</volume>
          , No.
          <issue>1</issue>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>38</lpage>
          (
          <year>1977</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Fei-Fei</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fergus</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , &amp; A.
          <string-name>
            <surname>Torralba</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Recognizing and Learning Object Categories</article-title>
          ,
          <source>IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR)</source>
          , (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Goeau</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joly</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bonnet</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Selmi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Molino</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barthélémy</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boujemaa</surname>
          </string-name>
          , N.:
          <article-title>Lifeclef plant identifcation task 2014</article-title>
          . In: CLEF working notes
          <year>2014</year>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>K.</given-names>
            <surname>Chatfield</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lempitsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vedaldi</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Zisserman</surname>
          </string-name>
          .:
          <article-title>The devil is in the details: an evaluation of recent feature encoding methods</article-title>
          ,
          <source>British Machine Vision Conference</source>
          , pp.
          <volume>76</volume>
          .
          <fpage>1</fpage>
          -
          <lpage>76</lpage>
          .
          <fpage>12</fpage>
          , (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Ke</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Sukthankar</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>PCA-SIFT: A more distinctive representation for local image descriptors, In Computer Vision</article-title>
          and Pattern Recognition,
          <string-name>
            <surname>CVPR</surname>
          </string-name>
          <year>2004</year>
          .
          <article-title>Proceedings of the 2004</article-title>
          IEEE Computer Society Conference on, Vol.
          <volume>2</volume>
          , pp.
          <fpage>II</fpage>
          -
          <volume>506</volume>
          . (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Lazebnik</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmid</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ponce</surname>
          </string-name>
          , J.:
          <article-title>Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories</article-title>
          ,
          <source>Proceedings of the IEEE Conference on Computer Vision</source>
          and Pattern Recognition, New York, Vol.
          <volume>2</volume>
          , pp.
          <fpage>2169</fpage>
          -
          <lpage>2178</lpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Lowe</surname>
            ,
            <given-names>D. G.</given-names>
          </string-name>
          :
          <article-title>Distinctive Image Features from Scale-Invariant Keypoints</article-title>
          ,
          <source>International Journal of Computer Vision</source>
          , Vol.
          <volume>60</volume>
          , No 2., pp.
          <fpage>91</fpage>
          -
          <lpage>110</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Lowe</surname>
            ,
            <given-names>D. G.</given-names>
          </string-name>
          :
          <article-title>Object Recognition from local scale-invariant features</article-title>
          ,
          <source>In International Conference on Computer Vision</source>
          , Corfu, Greece, pp.
          <fpage>1150</fpage>
          -
          <lpage>1157</lpage>
          (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>MacQueen</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Some methods for classification and analysis of multivariate observations</article-title>
          ,
          <source>Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability</source>
          , Vol.
          <volume>1</volume>
          , pp.
          <fpage>281</fpage>
          -
          <lpage>297</lpage>
          (
          <year>1967</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Perronnin</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dance</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Fisher kernel on visual vocabularies for image categorization</article-title>
          ,
          <source>IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR)</source>
          , (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Reynolds</surname>
            <given-names>D. A.</given-names>
          </string-name>
          : Gaussian Mixture Models,
          <source>Encyclopedia of Biometric Recognition</source>
          , Springer, February, pp.
          <fpage>659</fpage>
          -
          <lpage>663</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Sánchez</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Perronnin</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mensink</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Improved Fisher Vector for Large Scale Image Classification</article-title>
          ,
          <source>In Proc. of the 11th European Conference on Computer Vision</source>
          (ECCV):
          <string-name>
            <surname>Part</surname>
            <given-names>IV</given-names>
          </string-name>
          ,
          <source>September 05-11</source>
          , pp.
          <fpage>143</fpage>
          -
          <lpage>156</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Tomasi</surname>
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Estimating gaussian mixture densities with EM: A tutorial, (Tech. rep</article-title>
          ., Duke University);
          <source>Chinese Journal of Electron Devices</source>
          , pp,
          <fpage>15</fpage>
          -
          <lpage>18</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>