Closing loops without places
Lists
Only you see this
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.
BibTeX
@inproceedings{mei2010closing,
author = {Christopher Mei and Gabe Sibley and Paul Newman},
title = {{Closing loops without places}},
booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems},
year = {2010},
url = {https://openreview.net/forum?id=Ud5hyAZF9EN},
}Loading related content...