RISE: An Incremental Trust-Region Method for Robust Online Sparse Least-Squares Estimation
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Many point estimation problems in robotics, computer vision, and machine learning can be formulated as instances of the general problem of minimizing a sparse nonlinear sum-of-squares objective function. For inference problems of this type, each input datum gives rise to a summand in the objective function, and therefore performing online inference corresponds to solving a sequence of sparse nonlinear least-squares minimization problems in which additional summands are added to the objective function over time. In this paper, we present Robust Incremental least-Squares Estimation (RISE), an incrementalized version of the Powell's Dog-Leg numerical optimization method suitable for use in online sequential sparse least-squares minimization. As a trust-region method, RISE is naturally robust to objective function nonlinearity and numerical ill-conditioning and is provably globally convergent for a broad class of inferential cost functions (twice-continuously differentiable functions with bounded sublevel sets). Consequently, RISE maintains the speed of current state-of-the-art online sparse least-squares methods while providing superior reliability.
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
A flexible new technique for camera calibration
Zhang, Z. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.888718 · Cited by 15,004
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×
“…indeed, performing ML or MAP estimation over any probability distribution p : Rn → R+ whose factor graph representation G = (F ,X , E) [17] is sparse and whose factors are positive and bounded is equivalent to solving a sparse least-squares problem of the form (1) in which each summand ri…”
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
EPnP: An Accurate O(n) Solution to the PnP Problem
Lepetit, V., Moreno-Noguer, F., & Fua, P. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0152-6 · Cited by 3,298
iSAM2: Incremental smoothing and mapping using the Bayes tree
Kaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J. J., & Dellaert, F. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911430419 · Cited by 1,362
Self-citationGlobally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
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 · cited 1×
“have developed incremental smoothing and mapping (iSAM) [9], [10], which exploits recent algorithmic advances in sparse numerical linear algebra to implement an efficient incrementalized version of the Gauss–Newton method [8] for use in online sparse least-squares minimization.”
MethodSelf-citationFast iterative alignment of pose graphs with poor initial estimates
Olson, E., Leonard, J., & Teller, S. (2006) · Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. · doi:10.1109/robot.2006.1642040 · Cited by 427
Self-citationGaussian Process Gauss–Newton for non-parametric simultaneous localization and mapping
Tong, C. H., Furgale, P., & Barfoot, T. D. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913478672 · Cited by 68 · cited 1×
“Recent work in the robotics [47] and computer vision [48] literature has shown promising results in this direction, but utilizes Gauss– Newton-based approaches that (as demonstrated herein) limit the class of objective functions that can be reliably employed.”
Background
Cited by
SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group
Rosen, D. M., Carlone, L., Bandeira, A. S., & Leonard, J. J. (2019) · The International Journal of Robotics Research · doi:10.1177/0278364918784361 · Cited by 282
Self-citationLagrangian duality in 3D SLAM: Verification techniques and optimal solutions
Carlone, L., Rosen, D. M., Calafiore, G., Leonard, J. J., & Dellaert, F. (2015) · 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2015.7353364 · Cited by 95
Self-citationA convex relaxation for approximate global optimization in simultaneous localization and mapping
Rosen, D. M., DuHadway, C., & Leonard, J. J. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7140014 · Cited by 56
“Consequently, SLAM has been the focus of a sustained research effort over the previous three decades, and there now exist a variety of mature algorithms and software libraries to solve this problem in practice (cf. [2]–[5]).”
BackgroundMethodInfluentialSelf-citationDuality-based verification techniques for 2D SLAM
Carlone, L., & Dellaert, F. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139835 · Cited by 49
Graph-based terrain relative navigation with optimal landmark database selection
Steiner, T. J., Brady, T. M., & Hoffman, J. A. (2015) · 2015 IEEE Aerospace Conference · doi:10.1109/aero.2015.7119053 · Cited by 16
Exploiting the Separable Structure of SLAM
Khosoussi, K., Huang, S., & Dissanayake, G. (2015) · Robotics: Science and Systems XI · doi:10.15607/rss.2015.xi.023 · Cited by 14
“, LM, Powell’s Dog-leg [23], etc) without any major modification.”
Metadata
- Authors
- Rosen, D. M., Kaess, M., & Leonard, J. J.
- Venue
- IEEE Transactions on Robotics
- Published
- 2014-10
- Volume
- 30
- Issue
- 5
- Pages
- 1091-1108
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W1121923220
- Cited by
- 64
- References
- 9
- FWCI
- 13.46
- Type
- journal article
- Language
- en
- Open access
- green
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.