Title :
Convex relaxations of SE(2) and SE(3) for visual pose estimation
Author :
Horowitz, Matanya B. ; Matni, Nikolai ; Burdick, Joel W.
Author_Institution :
Dept. of Control & Dynamical Syst., Caltech, Pasadena, CA, USA
fDate :
May 31 2014-June 7 2014
Abstract :
This paper proposes a new method for rigid body pose estimation based on spectrahedral representations of the tautological orbitopes of SE(2) and SE(3). The approach can use dense point cloud data from stereo vision or an RGB-D sensor (such as the Microsoft Kinect), as well as visual appearance data as input. The method is a convex relaxation of the classical pose estimation problem, and is based on explicit linear matrix inequality (LMI) representations for the convex hulls of SE(2) and SE(3). Given these representations, the relaxed pose estimation problem can be framed as a robust least squares problem with the optimization variable constrained to these convex sets. Although this formulation is a relaxation of the original problem, numerical experiments indicates that it is indeed exact - i.e. its solution is a member of SE(2) or SE(3) - in many interesting settings. We additionally show that this method is guaranteed to be exact for a large class of pose estimation problems.
Keywords :
computer vision; convex programming; least squares approximations; linear matrix inequalities; pose estimation; stereo image processing; LMI representations; RGB-D sensor; SE(2) convex hull; SE(3) convex hull; convex relaxation; dense point cloud data; linear matrix inequality; optimization variable; red-green-blue-depth sensor; rigid body pose estimation; robust least squares problem; spectrahedral representation; stereo vision; tautological orbitopes; visual appearance data; visual pose estimation; Estimation; Least squares approximations; Optimization; Robot sensing systems; Robustness; Visualization;
Conference_Titel :
Robotics and Automation (ICRA), 2014 IEEE International Conference on
Conference_Location :
Hong Kong
DOI :
10.1109/ICRA.2014.6906998