...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of optical technology >Study on a stitching algorithm of the iterative closest point based on dynamic hierarchy
【24h】

Study on a stitching algorithm of the iterative closest point based on dynamic hierarchy

机译：基于动态层次的迭代最近点拼接算法研究

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

获取外文期刊封面封底 >>

       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In order to improve the efficiency of matching marked points, the accuracy and automation of point cloud stitching, a stitching algorithm of dynamic hierarchy of the iterative closest point is proposed. First, the dynamic distance matrix was introduced to record the distance of hierarchical searching marked point; to complete the coarse stitching, the marked point was matched through the dynamic distance matrix and the least square method was used to resolve the transformation matrix. Second, at the stage of precisely stitching dynamic hierarchical search points a set was taken to initialize a valid initial position for the iterative closest point algorithm, then the local optimum of the iterative closest point algorithm was avoided. In a three-dimensional stitching experiment the precise stitching distance error has reached 0.0085 mm; the method is testified to be simple, practical and characterized by high stitching precision. (C) 2015 Optical Society of America.
机译：为了提高标记点的匹配效率，提高点云拼接的准确性和自动化程度，提出了一种动态最近点动态层次的拼接算法。首先，引入动态距离矩阵来记录分层搜索标记点的距离。为了完成粗拼接，通过动态距离矩阵对标记点进行匹配，并采用最小二乘法求解变换矩阵。其次，在精确拼接动态分层搜索点的阶段，采用一组来初始化迭代最近点算法的有效初始位置，然后避免迭代最近点算法的局部最优。在三维缝合实验中，精确的缝合距离误差达到0.0085毫米。经验证，该方法简单，实用，拼接精度高。 （C）2015年美国眼镜学会。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号