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

一种高精度鲁棒的基于直线对应的位姿估计迭代算法
引用本文:张政,张小虎,傅丹.一种高精度鲁棒的基于直线对应的位姿估计迭代算法[J].计算机应用,2008,28(2):326-329,.
作者姓名:张政  张小虎  傅丹
作者单位:湖南长沙国防科学技术大学航天与材料工程学院学员5队
摘    要:2D-3D特征对应位姿估计问题算法多基于点对应,而基于直线对应求解比基于点对应求解更具有优势。从欧氏空间这一新颖角度出发,提出了一种从直线对应求解位姿估计问题的迭代算法,算法思想是先迭代求解出最优的旋转矩阵,然后再得到平移向量。针对不同的直线组情形,给出了相应的迭代初始值计算方法。仿真实验数据表明,算法具有对初始值较不敏感、高精度、鲁棒性好等特点。

关 键 词:直线对应    位姿估计    迭代算法
文章编号:1001-9081(2008)02-0326-04
收稿时间:2007-08-22
修稿时间:2007-10-16

Accurate and robust iterative pose estimation from line correspondences
ZHANG Zheng,ZHANG Xiao-hu,FU Dan.Accurate and robust iterative pose estimation from line correspondences[J].journal of Computer Applications,2008,28(2):326-329,.
Authors:ZHANG Zheng  ZHANG Xiao-hu  FU Dan
Affiliation:ZHANG Zheng,ZHANG Xiao-hu,FU Dan(College of Aerospace , Materials Engineering,National university of defense Technology,Changsha Hunan 410073,China)
Abstract:The methods for pose estimation problem from 2D to 3D feature correspondences are mainly based on point correspondences. However, it is advantageous to compute pose from line correspondences. From a novel point of view based on the Euclidean space, we presented an iterative algorithm for solving pose estimation problem by using line correspondences. The main idea is that, firstly the best rotation matrix is iteratively computed, and then the translation vector is obtained. For different groups of line correspondences, we presented different methods for getting an initial guess. Synthetic experimental data show the proposed algorithm is less sensitive to initialization, accurate and robust.
Keywords:line correspondences  pose estimation  iterative algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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