检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:桑旦 潘恺 SANG Dan;PAN Kai(Shanghai Institute of Surveying and Mapping,Shanghai 200063,China;Key Laboratory of Spatial-temporal Big Data Analysis and Application of Natural Resources in Megacities,MNR,Shanghai 200063,China)
机构地区:[1]上海市测绘院,上海200063 [2]自然资源部超大城市自然资源时空大数据分析应用重点实验室,上海200063
出 处:《地理空间信息》2025年第4期12-15,24,共5页Geospatial Information
基 金:上海2021年度社会发展科技攻关项目(21DZ1204100);上海2022年度社会发展科技攻关项目(22DZ1202900)。
摘 要:随着三维点云技术在工程测量、建模等方面应用的不断深入,对点云配准技术提出更高的要求。因此从实际应用的角度出发,对点云数据自动配准算法进行研究,针对常用的粗配准方法的不足,将尺度不变特征转换(SIFT)算法应用于三维点云粗配准中,研究了基于SIFT关键点的粗配准方法;针对传统的迭代最近点(ICP)算法存在的问题,将迭代系数和法线特征约束引入传统的ICP算法中提高配准的效率,实现了对传统ICP精配准算法的改进。实际应用结果表明,基于SIFT点的改进ICP点云自动配准算法可以有效提高配准效率和精度,具有较好的应用价值。With the continuous deepening of 3D point application technology in engineering measurement,modeling,and other fields,higher requirements are put forward for point cloud registration technology.We studied the automatic registration algorithm for point cloud data from the perspective of practical applications.In response to the shortcomings of commonly used coarse registration methods,we applied the scale invariant feature transform(SIFT) algorithm to coarse registration,and studied a coarse registration method based on SIFT key points.In response to the problems existing in the traditional iterative closest point(ICP) algorithm,we introduced the iteration coefficients and normal feature constraints into the traditional ICP algorithm to improve the efficiency of registration,and achieved improvements to the traditional ICP precision registration algorithm.The practical application results show that the improved ICP point cloud automatic registration algorithm based on SIFT points can effectively improve registration efficiency and accuracy,and has good application value.
分 类 号:P258[天文地球—测绘科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.90