• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Measuring Technology and Mechatronics Automation >An Allowance Optimal Distribution Method Based on Improved Iterative Closest Point Algorithm
【24h】

An Allowance Optimal Distribution Method Based on Improved Iterative Closest Point Algorithm

机译：基于改进迭代最近点算法的余量最优分配方法

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

摘要

To deal with the problem about allowance optimal distribution, a method based on improved iterative closest point algorithm was put forward. The method consists of the following parts. Firstly, Measure the blank using a 3D laser scanner. And then apply the improved iterative algorithm to the measured model and the ideal CAD model to optimize the allocation distribution. In the improved algorithm, a coarse registration based on the principal component analysis algorithm was carried out to improve the speed and accuracy of the fine registration. And the iterative closet point algorithm was applied for the fine registration, where a KD-Tree topology of point cloud data was established to improve the speed of searching the nearest point. At the end of the paper, an example has been developed with the window feature of a cabin to verify the improved algorithm. The results show the proposed method is effective and feasible.
机译：针对配额最优分配问题，提出了一种基于改进的迭代最近点算法的方法。该方法包括以下部分。首先，使用3D激光扫描仪测量毛坯。然后将改进的迭代算法应用于实测模型和理想的CAD模型，以优化分配分布。在改进算法中，基于主成分分析算法进行了粗配准，以提高细配准的速度和准确性。并采用迭代隐蔽点算法进行精细配准，建立了点云数据的KD-Tree拓扑结构，提高了最近点的搜索速度。在本文的最后，开发了一个带有机舱窗户特征的示例，以验证改进后的算法。结果表明，该方法是有效可行的。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号