TY - GEN
T1 - The generalized relative pose and scale problem
T2 - IEEE Winter Conference on Applications of Computer Vision, WACV 2016
AU - Kneip, Laurent
AU - Sweeney, Chris
AU - Hartley, Richard
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/5/23
Y1 - 2016/5/23
N2 - It is well-known that the relative pose problem can be generalized to non-central cameras. We present a further generalization, denoted the generalized relative pose and scale problem. It has surprising importance for classical problems such as solving similarity transformations for view-graph concatenation in hierarchical structure from motion and loop-closure in visual SLAM, both posed as a 2D-2D registration problem. The relative pose problem and all its generalizations constitute a family of similar symmetric eigenvalue problems, which allow us to compress data and find a geometrically meaningful solution by an efficient search in the space of rotations. While the derivation of a completely general closed-form solver appears intractable, we make use of a simple heuristic global energy minimization scheme based on local minimum suppression, returning outstanding performance in practically relevant scenarios. Efficiency and reliability of our algorithm are demonstrated on both simulated and real data, supporting our claim of superior performance with respect to both generalized 2D-3D and 3D-3D registration approaches. By directly employing image information, we avoid the common noise in point clouds occuring especially along the depth direction.
AB - It is well-known that the relative pose problem can be generalized to non-central cameras. We present a further generalization, denoted the generalized relative pose and scale problem. It has surprising importance for classical problems such as solving similarity transformations for view-graph concatenation in hierarchical structure from motion and loop-closure in visual SLAM, both posed as a 2D-2D registration problem. The relative pose problem and all its generalizations constitute a family of similar symmetric eigenvalue problems, which allow us to compress data and find a geometrically meaningful solution by an efficient search in the space of rotations. While the derivation of a completely general closed-form solver appears intractable, we make use of a simple heuristic global energy minimization scheme based on local minimum suppression, returning outstanding performance in practically relevant scenarios. Efficiency and reliability of our algorithm are demonstrated on both simulated and real data, supporting our claim of superior performance with respect to both generalized 2D-3D and 3D-3D registration approaches. By directly employing image information, we avoid the common noise in point clouds occuring especially along the depth direction.
UR - http://www.scopus.com/inward/record.url?scp=84977644883&partnerID=8YFLogxK
U2 - 10.1109/WACV.2016.7477656
DO - 10.1109/WACV.2016.7477656
M3 - Conference contribution
T3 - 2016 IEEE Winter Conference on Applications of Computer Vision, WACV 2016
BT - 2016 IEEE Winter Conference on Applications of Computer Vision, WACV 2016
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 7 March 2016 through 10 March 2016
ER -