• DocumentCode
    3347379
  • Title

    Closing loops without places

  • Author

    Mei, Christopher ; Sibley, Gabe ; Newman, Paul

  • Author_Institution
    Mobile Robot. Group, Univ. of Oxford, Oxford, UK
  • fYear
    2010
  • fDate
    18-22 Oct. 2010
  • Firstpage
    3738
  • Lastpage
    3744
  • Abstract
    This paper proposes a new topo-metric representation of the world based on co-visibility that simplifies data association and improves the performance of appearance-based recognition. We introduce the concept of dynamic bagof-words, which is a novel form of query expansion based on finding cliques in the landmark co-visibility graph. The proposed approach avoids the - often arbitrary - discretisation of space from the robot´s trajectory that is common to most image-based loop closure algorithms. Instead we show that reasoning on sets of co-visible landmarks leads to a simple model that out-performs pose-based or view-based approaches. Using real and simulated imagery, we demonstrate that dynamic bag-of-words query expansion can improve precision and recall for appearance-based localisation.
  • Keywords
    cartography; graph theory; path planning; query processing; robot vision; sensor fusion; visibility; appearance based localisation; appearance based recognition; data association; dynamic bag-of-words; image based loop closure algorithm; landmark co-visibility graph; query expansion; robots trajectory; topo metric representation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Robots and Systems (IROS), 2010 IEEE/RSJ International Conference on
  • Conference_Location
    Taipei
  • ISSN
    2153-0858
  • Print_ISBN
    978-1-4244-6674-0
  • Type

    conf

  • DOI
    10.1109/IROS.2010.5652266
  • Filename
    5652266