Conservative Sparsification for efficient and consistent approximate estimation
The DOI matches its Crossref record.
Abstract
This paper presents a new technique for sparsification of the information matrix of a multi-dimensional Gaussian distribution. We call this technique Conservative Sparsification (CS) and show that it produces estimates which are consistent with respect to an optimal filter. This technique was applied to the Simultaneous Localisation and Mapping (SLAM) problem, and compared with two existing sparsification approaches; the Sparse Extended Information Filter (SEIF) and the Data Discarding Sparse Extended Information Filter (DDSEIF). Simulation demonstrates that CS is a consistent approach and provides a tighter upper bound than existing conservative methods.
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
Cited by
Communication-constrained multi-AUV cooperative SLAM
Paull, L., Huang, G., Seto, M., & Leonard, J. J. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139227 · Cited by 116
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
“On the other hand, conservative (consistent) sparsification of information matrix is introduced in [31] for sparse extended information filter (SEIF)-based SLAM [32], [33].”
BackgroundMethodInfluentialNonlinear 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
Williams, S., Indelman, V., Kaess, M., Roberts, R., Leonard, J. J., & Dellaert, F. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914531056 · Cited by 2
“Simplification algorithms such as Vial et al. (2011) are orthogonal to this work and can be used to further improve performance of the smoother.”
BackgroundMethod
Metadata
- Authors
- Vial, J., Durrant-Whyte, H., & Bailey, T.
- Venue
- 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems
- Publisher
- IEEE
- Published
- 2011-09
- Pages
- 886-893
- OpenAlex
- W2164035059
- Cited by
- 42
- References
- 0
- FWCI
- 6.82
- 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: Conservative Sparsification for efficient and consistent approximate estimation. https://app.cochat.ai/papers/10.1109/iros.2011.6095128
- The paper
- Vial, J., Durrant-Whyte, H., & Bailey, T. (2011). Conservative Sparsification for efficient and consistent approximate estimation. 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems. https://doi.org/10.1109/iros.2011.6095128
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.