<!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>NUDT's Participation in the Robot Vision Challenge of ImageCLEF2014</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yi Zhang</string-name>
          <email>gfkdzhangyi@126.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jian Qin</string-name>
          <email>qinjian714@126.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fanglin Chen</string-name>
          <email>fanglinchen@nudt.edu.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dewen Hu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Automatic Control, College of Mechatronics and Automation National University of Defense Technology</institution>
          ,
          <addr-line>Changsha, Hunan</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <fpage>355</fpage>
      <lpage>359</lpage>
      <abstract>
        <p>This working note describes the method of the NUDT team for scene classi cation and object recognition in the ImageCLEF 2014 Robot Vision Challenge. The method is composed of two steps: 1. spatial pyramid match (SPM) and a Pyramid of HOG (Histograms of Oriented Gradient) are incorporated to represent an indoor place image. 2. a multiclass SVM (Support Vector Machine) is utilized to classify an image by one-versus-all binary SVMs. Based on the method, our system wins the championship this year.</p>
      </abstract>
      <kwd-group>
        <kwd>indoor robot localization</kwd>
        <kwd>indoor object recognition</kwd>
        <kwd>SPM</kwd>
        <kwd>PHOG</kwd>
        <kwd>multi-class SVM</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        The proposed image representation incorporates appearance and shape. For
appearance, we follow the approach of SPM [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. SIFT descriptors [2] of 16 16
pixel patches are computed over a dense regular grid with spacing of 8 pixels.
We perform k-means clustering of a random subset of patches from the training
set to form a visual codebook of V codes, and the corresponding descriptors are
assigned to their closest vocabulary codes using the Euclidean distance. In the
pyramid layer, multiple codes from inside each sub-region are pooled together
into a histogram. Finally, the histograms from all sub-regions are concatenated
together to generate SPM. Local place shape is described by HOG [3] within
an image block quantized into B bins. Orientations of edges within a certain
angular range are counted, forming each bin in the histogram. Incorporating
spatial pooling like SPM, PHOG is formed [4]. The nal image representation is
formed by concatenating SPM and PHOG. The total cells at level l in the each
pyramid is 4l. The entire image representation is a vector with dimensionality
      </p>
      <p>L L
V X 4l + B X 4l. For example, levels up to L = 1, V = 10 visual words and
l=0 l=0
B = 10 bins it will be a 100-vector.
3</p>
    </sec>
    <sec id="sec-2">
      <title>Multiclass classi cation</title>
      <p>We believe that adopting an appropriate multi-class classi er meets the
requirement of promoting the recognition performance. The multi-class SVM using
one-versus-all role proves its discrimination in many practical applications and
is adopted in our system. For each class s, after the responding SVM classi er
has been obtained through training, the nal decision function fs(x) for a test
sample x has the following form:</p>
      <p>m
fs(x) = max(X ai yi ker(xi; x) + bs)</p>
      <p>s
i=1
(1)
Where ker(xi; x) is the kernel function, ais; bs are the learned model parameters
of each one-versus-all binary SVM, yi is the label of the training sample xi, m
is the number of the training samples. Then the ultimate label belongs to the
class with the maximal value. In practice, we nd that the one-versus-all SVM
with nonlinear kernel is suitable for classifying the scenes and objects.
4</p>
    </sec>
    <sec id="sec-3">
      <title>Experiments</title>
      <p>In the Robot Vision Challenge this year, only one training sequence is provided
with 5000 labeled images. An additional validation sequence with 1500 labelled
images is provided, and includes 500 images of a non-previously seen building
that presents similar room categories and objects as for the training sequences
and 1000 images of the old building in the training sequence. The test sequence
contains 3000 unlabeled images. In these three sequence, only visual information
is considered irrespective of depth information.</p>
      <p>
        For the task, we utilize the whole images of training sequence for training
SVM, and the result is similar to the result of utilizing the same number of
images for per class to train SVM. In the application, only grey level cues are
used. And a visual codebook of 200 codes is used for appearance, and HOG with
range [0; 360] using all orientation is discretized into B = 8 bins for shape. For
multi-class classi cation, we utilize LIBSVM [5] with one-versus-all classifying
rule. Specially, pyramid match kernel [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] is adopted. Moreover, we limit the
number of levels to L = 2 to prohibit over tting. All experiments are repeated
10 times with all training images. Some example images are shown in Fig. 1,
Fig. 2, Fig. 3.
      </p>
      <p>Results on the validation sequence
We utilize our method on the validation sequence, and compute the respective
classi cation accuracy for each scene category and object class. Detailed results
are shown in Table 1 and Table 2.
In the ultimate submission for classifying test sequence, we mix the training
sequence and the validation sequence into a dataset for training and classify the
test sequence. Scene classi cation and object recognition are realized separately.
Finally, Our team ranks the rst out of four teams, results are listed in Table 3.
#
1
2
4</p>
      <sec id="sec-3-1">
        <title>Group</title>
      </sec>
      <sec id="sec-3-2">
        <title>NUDT</title>
      </sec>
      <sec id="sec-3-3">
        <title>UFMS</title>
      </sec>
      <sec id="sec-3-4">
        <title>3 Baseline Results</title>
      </sec>
      <sec id="sec-3-5">
        <title>AEGEAN</title>
        <p>In the paper, we introduce our method for the Robot Vision Challenge in
ImageCLEF2014. Our method applies the SPM and PHOG for image representation
and multi-class SVM for classi cation, which achieves the best performance
among all the participants. However, From the results of the challenge, there are
still some scene categories and object classes can not be processed correctly. In
addition, obviously, the non-previously seen building in uences the performance.
In the future, we will focus on the further improvement on the classi cation
accuracy and the generalization of our method.
Recognition, 2006 IEEE Computer Society Conference on, volume 2, pages 2169{
2178, 2006.</p>
      </sec>
      <sec id="sec-3-6">
        <title>2. DavidG. Lowe. Distinctive image features from scale-invariant keypoints. Interna</title>
        <p>tional Journal of Computer Vision, 60(2):91{110, 2004.</p>
      </sec>
      <sec id="sec-3-7">
        <title>3. N. Dalal and B. Triggs. Histograms of oriented gradients for human detection.</title>
        <p>In Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer
Society Conference on, volume 1, pages 886{893 vol. 1, June 2005.
4. A. Bosch, A. Zisserman, and X. Muoz. Image classi cation using random forests and
ferns. In Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference
on, pages 1{8, Oct 2007.</p>
      </sec>
      <sec id="sec-3-8">
        <title>5. Chih-Chung Chang and Chih-Jen Lin. LIBSVM: A library for support vector ma</title>
        <p>chines. ACM Transactions on Intelligent Systems and Technology, 2:27:1{27:27,
2011. Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm.</p>
      </sec>
      <sec id="sec-3-9">
        <title>6. Barbara Caputo, Henning Muller, Jesus Martinez-Gomez, Mauricio Villegas, Burak</title>
        <p>Acar, Novi Patricia, Neda Marvasti, Suzan Uskudarl , Roberto Paredes, Miguel</p>
      </sec>
      <sec id="sec-3-10">
        <title>Cazorla, Ismael Garcia-Varea, and Vicente Morell. ImageCLEF 2014: Overview and</title>
        <p>analysis of the results. In CLEF proceedings, Lecture Notes in Computer Science.</p>
      </sec>
      <sec id="sec-3-11">
        <title>Springer Berlin Heidelberg, 2014.</title>
      </sec>
      <sec id="sec-3-12">
        <title>7. Jesus Martinez-Gomez, Miguel Cazorla, Ismael Garcia-Varea, and Vicente Morell.</title>
      </sec>
      <sec id="sec-3-13">
        <title>Overview of the ImageCLEF 2014 Robot Vision Task. In CLEF 2014 Evaluation</title>
        <p>Labs and Workshop, Online Working Notes, 2014.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>S.</given-names>
            <surname>Lazebnik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Schmid</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Ponce</surname>
          </string-name>
          .
          <article-title>Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories</article-title>
          .
          <source>In Computer Vision</source>
          and Pattern
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>