Monocular graph SLAM with complexity reduction
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We present a graph-based SLAM approach, using monocular vision and odometry, designed to operate on computationally constrained platforms. When computation and memory are limited, visual tracking becomes difficult or impossible, and map representation and update costs must remain low. Our system constructs a map of structured views using only weak temporal assumptions, and performs recognition and relative pose estimation over the set of views. Visual observations are fused with differential sensors in an incrementally optimized graph representation. Using variable elimination and constraint pruning, the graph complexity and storage is kept linear in explored space rather than in time. We evaluate performance on sequences with ground truth, and also compare to a standard graph SLAM approach.
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
Bundle 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
Nonlinear Constraint Network Optimization for Efficient Map Learning
Grisetti, G., Stachniss, C., & Burgard, W. (2009) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2009.2026444 · Cited by 222 · cited 2×
“One technique suggested for bounding this growth is that the robot be occasionally virtually “kidnapped”, disconnecting its current pose in the graph from previous poses and re-inserting it in using only recent observations[6].”
BackgroundMethod
Cited by
Consistent sparsification for graph optimization
Huang, G., Kaess, M., & Leonard, J. J. (2013) · 2013 European Conference on Mobile Robots · doi:10.1109/ecmr.2013.6698835 · Cited by 70
“Similarly, in [5] marginalization is employed to reduce graph complexity.”
BackgroundMethodResultInfluentialNonlinear factor recovery for long-term SLAM
Mazuran, M., Burgard, W., & Tipaldi, G. D. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915581629 · Cited by 63
Generic factor-based node marginalization and edge sparsification for pose-graph SLAM
Carlevaris-Bianco, N., & Eustice, R. M. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6631403 · Cited by 52
Efficient information-theoretic graph pruning for graph-based SLAM with laser range finders
Kretzschmar, H., Stachniss, C., & Grisetti, G. (2011) · 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2011.6094414 · Cited by 48
“[4] presented a view-based monocular SLAM system that reduces the complexity of the graph by marginalization and subsequent suppression of edges incident to nodes of high degrees.”
BackgroundTemporally scalable visual SLAM using a reduced pose graph
Johannsson, H., Kaess, M., Fallon, M., & Leonard, J. J. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6630556 · Cited by 39
Metadata
- Authors
- Eade, E., Fong, P., & Munich, M. E.
- Venue
- 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems
- Publisher
- IEEE
- Published
- 2010-10
- Pages
- 3017-3024
- OpenAlex
- W2073968412
- Cited by
- 59
- References
- 3
- FWCI
- 8.30
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Monocular graph SLAM with complexity reduction. https://app.cochat.ai/papers/10.1109/iros.2010.5649205
- The paper
- Eade, E., Fong, P., & Munich, M. E. (2010). Monocular graph SLAM with complexity reduction. 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems. https://doi.org/10.1109/iros.2010.5649205
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.