期刊文献+

求解位姿估计问题的对偶方法

A dual method for the pose estimation problem
下载PDF
导出
摘要 位姿估计是计算机图形学、机器视觉、摄影测量学等研究领域中的核心问题之一,利用给定的3D-2D参考点来估计相机与对象间的旋转和平移.针对该问题的四元数模型,人们最近开发应用半定规划松弛(SDR)和平方和松弛(SOS)得到了很好的计算效果.在原始模型的基础上,通过添加冗余约束,提出了Lagrangian对偶松弛方法(Dual).这三种方法的核心是各自求解一个常数维度的半定规划问题,调用SeDuMi求解的系数矩阵规模分别为SDR:117×32,SOS:266×70和Dual:81×12,大量的数值实验表明Lagrangian对偶松弛方法在进一步缩短了计算时间的同时计算效果也十分卓越. The pose estimation problem is one of the key problems in computer graphics, machine vision, and photogrammetry. It is to estimate the rotation and translation between a camera and an object based on given 3D-to-2D reference points. Recently, with the help of a quaternion model, semidefinite programming relaxation (SDR) and sum-of-square relaxation (SOS) are proposed in literature. In this paper, by adding redundant constraints to the original problem, we develop a Lagrangian dual model for pose estimation, which can be reformulated as a semidefinite program. We use SeDuMi to solve these three models. They are captured in matrices of 117 × 32 (SDR), 266 × 70 (SOS) and 81 × 12 (Dual), respectively. Numerical results show that our method is not only fast but also very efficient.
作者 韩颖薇 夏勇
出处 《运筹学学报》 CSCD 北大核心 2013年第3期86-92,共7页 Operations Research Transactions
基金 国家自然科学基金项目(Nos.11001006 91130019/A011702) 软件开发环境国家重点实验室开放课题(No.SKLSDE-2013ZX-13)
关键词 位姿问题 Lagrangian对偶 半定规划 pose estimation, Lagrangian dual, semidefinite programming
  • 相关文献

参考文献1

二级参考文献16

  • 1Anstreicher, K. M.: Recent advances in the solution of quadratic assignment problems. Mathematical Programming, Set. B, 97, 24-42 (2003).
  • 2Cela, E.: The Quadratic Assignment Problem: Theory and Algorithms, Kluwer Academic Publishers, Dordrecht, 1998.
  • 3Loiola, E. M., Abreu, N. M. M., Boaventura-Netto, P. O., et al.: An analytical survey for the quadratic assignment problem. European Journal of Operational Research, 176, 657-690 (2007).
  • 4Xia, Y.: Theory and Algorithms for the Quadratic Assignment Problems (in Chinese), Ph.D. Diss., Chinese Academy of Sciences, 2007.
  • 5Xia, Y.: New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problem. Journal of Industrial and Management Optimization, 5(4), 881-892 (2009).
  • 6Xia, Y.: An efficient continuation method for quadratic assignment problems. Computers & Operations Research, 37, 1027-1032 (2010).
  • 7Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the Association of Computing Machinery, 23, 555-565 (1976).
  • 8Xia, Y., Yuan, Y. Y.: A new linearization method for quadratic assignment problems. Optimization Methods Software, 21(5) 803-816 (2006).
  • 9Xia, Y.: Second order cone programming relaxation for the quadratic assignment problem. Optimization Methods & Software, 23(3), 441-449 (2008).
  • 10Finke, G., Burkard, R. E., Rendl, F.: Quadratic assignment problems. Ann. Discrete Math., 31, 61-82 (1987).

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部