Vast-scale Outdoor Navigation Using Adaptive Relative Bundle Adjustment
The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
In this paper we describe a relative approach to simultaneous localization and mapping, based on the insight that a continuous relative representation can make the problem tractable at large scales. First, it is well known that bundle adjustment is the optimal non-linear least-squares formulation for this problem, in that its maximum-likelihood form matches the definition of the Cramer—Rao lower bound. Unfortunately, computing the maximum-likelihood solution is often prohibitively expensive: this is especially true during loop closures, which often necessitate adjusting all parameters in a loop. In this paper we note that it is precisely the choice of a single privileged coordinate frame that makes bundle adjustment costly, and that this expense can be avoided by adopting a completely relative approach. We derive a new relative bundle adjustment which, instead of optimizing in a single Euclidean space, works in a metric space defined by a manifold. Using an adaptive optimization strategy, we show experimentally that it is possible to solve for the full maximum-likelihood solution incrementally in constant time, even at loop closure. Our approach is, by definition, everywhere locally Euclidean, and we show that the local Euclidean estimate matches that of traditional bundle adjustment. Our system operates online in realtime using stereo data, with fast appearance-based loop closure detection. We show results on over 850,000 images that indicate the accuracy and scalability of the approach, and process over 330 GB of image data into a relative map covering 142 km of Southern England. To demonstrate a baseline sufficiency for navigation, we show that it is possible to find shortest paths in the relative maps we build, in terms of both time and distance. Query images from the web of popular landmarks around London, such as the London Eye or Trafalgar Square, are matched to the relative map to provide route planning goals.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
Multiple View Geometry in Computer Vision
Hartley, R., & Zisserman, A. (2004) · doi:10.1017/cbo9780511811685 · Cited by 21,070
A Combined Corner and Edge Detector
Harris, C., & Stephens, M. (1988) · Procedings of the Alvey Vision Conference 1988 · doi:10.5244/c.2.23 · Cited by 12,901 · cited 1×
“Features are sorted by their Harris corner score (Harris and Stephens 1988), and those with higher scores are instantiated first.”
BackgroundRobust estimation of a location parameter
Huber, P. J. (1964) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177703732 · Cited by 7,228
Machine Learning for High-Speed Corner Detection
Rosten, E., & Drummond, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744023_34 · Cited by 4,555 · cited 1×
“We use FAST features (Rosten and Drummond 2006) extracted at different levels of a scale-space pyramid for robustness to image blur.”
MethodBundle Adjustment — A Modern Synthesis
Triggs, B., McLauchlan, P. F., Hartley, R. I., & Fitzgibbon, A. W. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44480-7_21 · Cited by 3,988
MonoSLAM: Real-time single camera SLAM
Davison, A. J., Reid, I. D., Molton, N. D., & Stasse, O. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1049 · Cited by 3,959 · cited 1×
“The most common solution is probably sub-mapping (Bosse et al. 2004 Davison et al. 2007 Pinies and Tardos 2007 Eade and Drummond 2008), which breaks the estimation into many smaller mapping regions, computes individual solutions for each region, and then estimates the relationships between these…”
BackgroundSelf-citationFAB-MAP: Probabilistic Localization and Mapping in the Space of Appearance
Cummins, M., & Newman, P. (2008) · The International Journal of Robotics Research · doi:10.1177/0278364908090961 · Cited by 1,472 · cited 3×
“For loop closure and place recognition we rely on FAB-MAP, which represents each place using the bag-of-words model developed for image retrieval systems by the computer vision community Sivic and Zisserman (2006) Cummins and Newman (2008).”
BackgroundMethodSelf-citationiSAM: Incremental Smoothing and Mapping
Kaess, M., Ranganathan, A., & Dellaert, F. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2006706 · Cited by 1,076
Cited by
Visual Place Recognition: A Survey
Lowry, S., Sünderhauf, N., Newman, P., Leonard, J. J., Cox, D., Corke, P., & Milford, M. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2015.2496823 · Cited by 1,079
“coupled from the online local update step, and many systems independently perform both SLAM-like local metric correction and topological-like loop closure [1], [2], [80], [161]; a system”
BackgroundMethodInfluentialSelf-citationPL-SLAM: A Stereo SLAM System Through the Combination of Points and Line Segments
Gomez-Ojeda, R., Moreno, F.-A., Zuniga-Noel, D., Scaramuzza, D., & Gonzalez-Jimenez, J. (2019) · IEEE Transactions on Robotics · doi:10.1109/tro.2019.2899783 · Cited by 560
Visual SLAM and Structure from Motion in Dynamic Environments: A Survey
Saputra, M. R. U., Markham, A., & Trigoni, N. (2019) · ACM Computing Surveys · doi:10.1145/3177853 · Cited by 398
Associating Uncertainty With Three-Dimensional Poses for Use in Estimation Problems
Barfoot, T. D., & Furgale, P. T. (2014) · IEEE Transactions on Robotics · doi:10.1109/tro.2014.2298059 · Cited by 305
Double window optimisation for constant time visual SLAM
Strasdat, H., Davison, A. J., Montiel, J. M. M., & Konolige, K. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126517 · Cited by 296
Metadata
- Authors
- Sibley, G., Mei, C., Reid, I., & Newman, P.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2010-05-04
- Volume
- 29
- Issue
- 8
- Pages
- 958-980
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2113685147
- Cited by
- 156
- References
- 12
- FWCI
- 44.45
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Vast-scale Outdoor Navigation Using Adaptive Relative Bundle Adjustment. https://app.cochat.ai/papers/10.1177/0278364910369268
- The paper
- Sibley, G., Mei, C., Reid, I., & Newman, P. (2010). Vast-scale Outdoor Navigation Using Adaptive Relative Bundle Adjustment. The International Journal of Robotics Research. https://doi.org/10.1177/0278364910369268
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.