首页 | 本学科首页   官方微博 | 高级检索  
     

结合分支定界法和线性规划的摄像机位姿估计
引用本文:马文娟.结合分支定界法和线性规划的摄像机位姿估计[J].中国图象图形学报,2012,17(5):694-699.
作者姓名:马文娟
作者单位:浙江理工大学数字媒体技术系,杭州 310018
基金项目:浙江理工大学科研启动基金项目(1004838-Y)
摘    要:介绍了一种新的利用对应点估计摄像机位姿的算法。通常情况下,摄像机位姿估计可以转化为一个最优化问题,现有算法将问题转换成一个序列二阶锥规划问题,通过对旋转矩阵所在空间进行分支定界搜索来求取全局最优解。对现有算法进行改进,通过将二阶锥约束松弛为线性约束,提出了一种结合分支定界法和线性规划方法的全局优化算法。该算法不仅能够求得全局最优解,而且算法速度较现有算法提高了一倍以上。最后通过模拟数据和真实数据对该算法进行了验证,结果表明了该算法的准确性和高效性。

关 键 词:位姿估计  全局最优化  分支定界  线性规划  二阶锥规划
收稿时间:2011/6/15 0:00:00
修稿时间:2011/10/24 0:00:00

Camera pose estimation using branch and bound method with linear programming
Ma Wenjuan.Camera pose estimation using branch and bound method with linear programming[J].Journal of Image and Graphics,2012,17(5):694-699.
Authors:Ma Wenjuan
Affiliation:Department of Digital Media Technology, Zhejiang Sci-Tech University, Hangzhou 310018,China
Abstract:In this paper,we introduce a new algorithm for estimating camera pose from point correspondences.Generally,the camera pose problem could be formulated as an optimization problem.The current methods transform the problem into a set of second order cone programming (SOCP) feasibility problems which obtain the global optimal solution by searching the rotation space.In this paper,by relaxing the second-order cone constraints to linear constraints,we propose an improved method that combines branching and bounding with linear programming (LP).Our method cannot only get the global optimal pose but also runs two times faster than the curreut best method.Our approach has been tested on a number of synthetically generated and real data sets,and the results demonstrate the accuracy and the high speed of the proposed method.
Keywords:pose estimation  global optimization  branch and bound  linear programming  second order cone programming
本文献已被 CNKI 等数据库收录!
点击此处可从《中国图象图形学报》浏览原始摘要信息
点击此处可从《中国图象图形学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号