| Michael Kaess | |
| Center for Robotics and Intelligent Machines, Georgia Tech | GT CoC IC GVU RIM@GT BORG |
|
Home Publications Courses Links Contact Personal |
please see my MIT page for up-to-date information
An Incremental Trust-Region Method for Robust Online Sparse Least-Squares EstimationDownload: PDF. “An Incremental Trust-Region Method for Robust Online Sparse Least-Squares Estimation” by D.M. Rosen, M. Kaess, and J.J. Leonard. In IEEE Intl. Conf. on Robotics and Automation, ICRA, (St. Paul, MN), May 2012. To appear. AbstractMany online inference problems in computer vision and robotics are characterized by probability distributions whose factor graph representations are sparse and whose factors are all Gaussian functions of error residuals. Under these conditions, maximum likelihood estimation corresponds to solving a sequence of sparse 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 trust-region method suitable for use in online sparse least-squares minimization. As a trust-region method, Powell's Dog-Leg enjoys excellent global convergence properties, and is known to be considerably faster than both Gauss-Newton and Levenberg-Marquardt when applied to sparse least-squares problems. Consequently, RISE maintains the speed of current state-of-the-art incremental sparse least-squares methods while providing superior robustness to objective function nonlinearities. Download: PDF. BibTeX entry:
@inproceedings{Rosen12icra,
author = {D.M. Rosen and M. Kaess and J.J. Leonard},
title = {An Incremental Trust-Region Method for Robust Online Sparse
Least-Squares Estimation},
booktitle = {IEEE Intl. Conf. on Robotics and Automation, ICRA},
address = {St. Paul, MN},
month = {May},
year = {2012},
note = {To appear}
}
|
|
Last updated: Jan 10, 2012 by kaess @ ieee.org © 2011 Michael Kaess. All Rights Reserved. |