The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Real-time monocular SLAM: Why filter?
Abstract
While the most accurate solution to off-line structure from motion (SFM) problems is undoubtedly to extract as much correspondence information as possible and perform global optimisation, sequential methods suitable for live video streams must approximate this to fit within fixed computational bounds. Two quite different approaches to real-time SFM - also called monocular SLAM (Simultaneous Localisation and Mapping) - have proven successful, but they sparsify the problem in different ways. Filtering methods marginalise out past poses and summarise the information gained over time with a probability distribution. Keyframe methods retain the optimisation approach of global bundle adjustment, but computationally must select only a small number of past frames to process. In this paper we perform the first rigorous analysis of the relative advantages of filtering and sparse optimisation for sequential monocular SLAM. A series of experiments in simulation as well using a real image SLAM system were performed by means of covariance propagation and Monte Carlo methods, and comparisons made using a combined cost/accuracy measure. With some well-discussed reservations, we conclude that while filtering may have a niche in systems with low processing resources, in most modern applications keyframe optimisation gives the most accuracy per unit of computing time.
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
Multiple View Geometry in Computer Vision
Hartley, R., & Zisserman, A. (2004) · doi:10.1017/cbo9780511811685 · Cited by 21,070
SURF: Speeded Up Robust Features
Bay, H., Tuytelaars, T., & Van Gool, L. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744023_32 · Cited by 14,955
Parallel Tracking and Mapping for Small AR Workspaces
Klein, G., & Murray, D. (2007) · 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality · doi:10.1109/ismar.2007.4538852 · Cited by 4,346
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
Self-citationMultiple View Geometry in Computer Vision
(2001) · Kybernetes · doi:10.1108/k.2001.30.9_10.1333.2 · Cited by 3,336
Real-time simultaneous localisation and mapping with a single camera
Davison (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238654 · Cited by 1,733
Nistér, D., Naroditsky, O., & Bergen, J. R. (2004) · Cited by 1,169
Fusing points and lines for high performance tracking
Rosten, E., & Drummond, T. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.104 · Cited by 1,119
iSAM: 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
Nister, D., Naroditsky, O., & Bergen, J. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315094 · Cited by 1,030
SBA: A software package for generic sparse bundle adjustment
Lourakis, M. I. A., & Argyros, A. A. (2009) · ACM Transactions on Mathematical Software · doi:10.1145/1486525.1486527 · Cited by 788
Inverse Depth Parametrization for Monocular SLAM
Civera, J., Davison, A. J., & Montiel, J. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2003276 · Cited by 779
Self-citationData association in stochastic mapping using the joint compatibility test
Neira, J., & Tardos, J. D. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.976019 · Cited by 772
FrameSLAM: From Bundle Adjustment to Real-Time Visual Mapping
Konolige, K., & Agrawal, M. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2004832 · Cited by 532
Fast and Incremental Method for Loop-Closure Detection Using Bags of Visual Words
Angeli, A., Filliat, D., Doncieux, S., & Meyer, J.-A. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2004514 · Cited by 514
Real Time Localization and 3D Reconstruction
Mouragnon, E., Lhuillier, M., Dhome, M., Dekeyser, F., & Sayd, P. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06) · doi:10.1109/cvpr.2006.236 · Cited by 396
Improving the Agility of Keyframe-Based SLAM
Klein, G., & Murray, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88688-4_59 · Cited by 335
Probabilistic Appearance Based Navigation and Loop Closing
Cummins, M., & Newman, P. (2007) · Proceedings 2007 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2007.363622 · Cited by 167
Monocular SLAM as a Graph of Coalesced Observations
Eade, E., & Drummond, T. W. (2007) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2007.4409098 · Cited by 134
Large-Scale SLAM Building Conditionally Independent Local Maps: Application to Monocular Vision
Piniés, P., & Tardós, J. D. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2004636 · Cited by 130
A Constant-Time Efficient Stereo SLAM System
Christopher Mei, A., Sibley, G., Cummins, M., Newman, P. M., & Reid, I. D. (2009) · British Machine Vision Conference (BMVC) · doi:10.5244/c.23.54 · Cited by 111
3D Positional Integration from Image Sequences
Harris, C. G., & Pike, J. M. (1987) · Alvey Vision Conference (AVC) · doi:10.5244/c.1.32 · Cited by 63
Active matching for visual tracking
Chli, M., & Davison, A. J. (2009) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2009.07.010 · Cited by 34
Self-citation
Cited by
KinectFusion: Real-time dense surface mapping and tracking
Newcombe, R. A., Fitzgibbon, A., Izadi, S., Hilliges, O., Molyneaux, D., Kim, D., Davison, A. J., Kohi, P., Shotton, J., & Hodges, S. (2011) · 2011 10th IEEE International Symposium on Mixed and Augmented Reality · doi:10.1109/ismar.2011.6092378 · Cited by 4,008
Self-citationSVO: Fast semi-direct monocular visual odometry
Forster, C., Pizzoli, M., & Scaramuzza, D. (2014) · 2014 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2014.6906584 · Cited by 2,205
Keyframe-based visual–inertial odometry using nonlinear optimization
Leutenegger, S., Lynen, S., Bosse, M., Siegwart, R., & Furgale, P. (2015) · The International Journal of Robotics Research · doi:10.1177/0278364914554813 · Cited by 1,723
Scaramuzza, D., & Fraundorfer, F. (2011) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2011.943233 · Cited by 1,550
On-Manifold Preintegration for Real-Time Visual--Inertial Odometry
Forster, C., Carlone, L., Dellaert, F., & Scaramuzza, D. (2017) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2597321 · Cited by 1,502
“The front-end also selects a subset of images, called keyframes [32], for which we want to compute a pose estimate.”
Background
Metadata
- Authors
- Strasdat, H., Montiel, J. M. M., & Davison, A. J.
- Venue
- 2010 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2010-05
- Pages
- 2657-2664
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W1991793962
- Cited by
- 475
- References
- 23
- FWCI
- 90.70
- Type
- conference paper
- 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
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.