首页> 外文会议>Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on >A branch-and-bound algorithm for globally optimal hand-eye calibration
【24h】

A branch-and-bound algorithm for globally optimal hand-eye calibration

机译:全球最佳手眼校准的分支定界算法

获取原文
获取原文并翻译 | 示例

摘要

This paper introduces a novel solution to hand-eye calibration problem. It is the first method that uses camera measurements directly and at the same time requires neither prior knowledge of the external camera calibrations nor a known calibration device. Our algorithm uses branch-and-bound approach to minimize an objective function based on the epipolar constraint. Further, it employs Linear Programming to decide the bounding step of the algorithm. The presented technique is able to recover both the unknown rotation and translation simultaneously and the solution is guaranteed to be globally optimal with respect to the L∞-norm.
机译:本文介绍了一种解决手眼校准问题的新颖方法。这是直接使用摄像机测量值的第一种方法,同时不需要外部摄像机校准的先验知识或已知的校准设备。我们的算法使用分支定界方法基于对极约束最小化目标函数。此外,它采用线性编程来确定算法的边界步骤。所提出的技术能够同时恢复未知的旋转和平移,并且保证该解相对于L∞范数是全局最优的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号