Online environment mapping
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
The paper proposes a vision based online mapping of large-scale environments. Our novel approach uses a hybrid representation of a fully metric Euclidean environment map and a topological map. This novel hybrid representation facilitates our scalable online hierarchical bundle adjustment approach. The proposed method achieves scalability by solving the local registration through embedding neighboring keyframes and landmarks into a Euclidean space. The global adjustment is performed on a segmentation of the keyframes and posed as the iterative optimization of the arrangement of keyframes in each segment and the arrangement of rigidly moving segments. The iterative global adjustment is performed concurrently with the local registration of the keyframes in a local map. Thus the map is always locally metric around the current location, and likely to be globally consistent. Loop closures are handled very efficiently benefiting from the topological nature of the map and overcoming the loss of the metric map properties as previous approaches. The effectiveness of the proposed method is demonstrated in real-time on various challenging video sequences.
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
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
Speeded-Up Robust Features (SURF)
Bay, H., Ess, A., Tuytelaars, T., & Van Gool, L. (2008) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2007.09.014 · Cited by 13,557
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
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
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×
“Recently there have been many attempts to address SLAM for larger environment using monocular or stereo cameras [9, 14, 8].”
BackgroundVisual odometry for ground vehicle applications
Nistér, D., Naroditsky, O., & Bergen, J. (2006) · Journal of Field Robotics · doi:10.1002/rob.20103 · Cited by 634 · cited 1×
“The recent advances in structure-and-motion research provide the theoretical basis and useful machineries [23, 21].”
BackgroundAdaptive relative bundle adjustment
Sibley, G., Mei, C., Reid, I., & Newman, P. (2009) · Robotics: Science and Systems V · doi:10.15607/rss.2009.v.023 · Cited by 139 · cited 4×
“Additionally, our technique is conceptually simpler than RBA since it fully operates in the familiar metric space and can use all known bundle adjustment methods.”
BackgroundMethodInfluential
Cited by
Strasdat, H., Montiel, J. M. M., & Davison, A. J. (2012) · Image and Vision Computing · doi:10.1016/j.imavis.2012.02.009 · Cited by 439
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
“Instead of anchoring the 3D points with respect to a keyframe [16, 11], we express them simply in a global coordinate frame, and thus can avoid a point management overhead.”
BackgroundMethodInfluentialFast relocalisation and loop closing in keyframe-based SLAM
Mur-Artal, R., & Tardos, J. D. (2014) · 2014 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2014.6906953 · Cited by 264
Tsintotas, K. A., Bampis, L., & Gasteratos, A. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3175656 · Cited by 175
“This way, faster indexing was achieved, while high performances were preserved [213], [246], [344], [345].”
BackgroundLight-weight localization for vehicles using road markings
Ranganathan, A., Ilstrup, D., & Wu, T. (2013) · 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2013.6696460 · Cited by 50
Metadata
- Authors
- Lim, J., Frahm, J.-M., & Pollefeys, M.
- Venue
- CVPR 2011
- Publisher
- IEEE
- Published
- 2011-06
- Pages
- 3489-3496
- OpenAlex
- W2068057901
- Cited by
- 53
- References
- 7
- FWCI
- 13.64
- 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.