nav emailalert searchbtn searchbox tablepage yinyongbenwen piczone journalimg journalInfo journalinfonormal searchdiv searchzone qikanlogo popupnotification paper paperNew
2022, 08, v.20 59-63
融合kmeans聚类与Hausdorff距离的点云精简算法改进
基金项目(Foundation): 安徽省教育厅无人机开发及数据应用重点实验室开放基金资助项目(WRJ19004)
邮箱(Email):
DOI:
发布时间: 2022-08-28
出版时间: 2022-08-28
移动端阅读
摘要:

通常情况下,融合kmeans聚类与Hausdorff距离的点云精简算法在目标曲面的曲率值过小时需要设定Hausdorff距离阈值,在模型表面复杂情况下曲率估算精度不高,针对以上问题对该算法进行改进。首先在kmeans聚类中k值的确定采用手肘法确定聚类数保证聚类精度,然后采用维数特征Hausdorff距离代替主曲率Hausdorff距离提取特征点,避免了曲率的估算和在曲率值过小时设定Hausdorff距离阈值,最后融合kmeans聚类簇心与采用维数特征Hausdorff距离提取的特征点实现数据精简。采用实际扫描的点云数据进行验证,实验表明改进后的算法在相近精简率下提取的特征点更多,精度更高。

Abstract:

In the past, the point cloud simplification algorithm integrating K-means clustering and Hausdorff distance needs to set the Hausdorff distance threshold when the curvature value is too small in the flat region, and the accuracy of curvature estimation is not high in the case of complex model surface. In view of the above problems, we improved the algorithm. Firstly, the determination of K value in K-means clustering was made by using the elbow method to determine the clustering number to ensure the clustering accuracy. Then, the Hausdorff distance was used to extract feature points by replacing the main curvature Hausdorff distance with the dimension feature, avoiding the estimation of curvature and setting the Hausdorff distance threshold when the curvature value is too small. Finally, the K-means cluster core was fused with the feature points extracted by the Hausdorff distance with the dimension feature to achieve data simplification. The experimental results show that the improved algorithm can extract more feature points at the same reduction rate, and the reduction accuracy is higher.

参考文献

[1] Hong T W,Li Y Z,Ji D U,et al. Simplification and ErrorAnalysis Based on Implicit Surface for Measuring Point-sets[J].Journal of Image&Graphics,2007,12(11):2 114-2 118

[2]李仁忠,杨曼,刘阳阳,等.一种散乱点云的均匀精简算法[J].光学学报,2017,37(7):97-105

[3]陈璋雯,达飞鹏.基于模糊熵迭代的三维点云精简算法[J].光学学报,2013,33(8):161-167

[4]李健,曹垚,王宗敏,等.融合k-means聚类和Hausdorff距离的散乱点云精简算法[J].武汉大学学报(信息科学版),2020,45(2):250-257

[5] Shi B Q,Liang J,Liu Q. Adaptive Simplification of Point Cloud Using kmeans Clustering[J]. ComputerAided Design,2011,43(8):910-922

[6]吕钊,康志忠.利用地面激光扫描数据进行建筑物变化检测[J].武汉大学学报(信息科学版),2011,36(11):1 284-1 289

[7] Li T,Pan Q,Gao L,et al. A Novel Simplification Method of Point Cloud with Directed Hausdorff Distance[C]. IEEE 21st International Conference on Computer Supported Cooperative Work in Design(CSCWD),Wellington,New Zealand,2017

[8]王建仁,马鑫,段刚龙.改进的K-means聚类k值选择算法[J].计算机工程与应用,2019,55(8):27-33

[9]陈建华.融合主成分分析和局部邻域的平面点云去噪[J].测绘通报,2020(5):47-50

[10]杨必胜,董震,魏征,等.从车载激光扫描数据中提取复杂建筑物立面的方法[J].测绘学报,2013,42(3):411-417

[11]刘春,吴杭彬.基于真三维TIN的三维激光扫描数据压缩方法[J].武汉大学学报(信息科学版),2006(10):908-911

[12]陈朋,周大伟.点到平面距离的点云数据压缩方法[J].测绘科学,2015,40(8):117-120

基本信息:

中图分类号:TP391.41;TN249

引用信息:

[1]彭海驹,严科文,林松,等.融合kmeans聚类与Hausdorff距离的点云精简算法改进[J].地理空间信息,2022,20(08):59-63.

基金信息:

安徽省教育厅无人机开发及数据应用重点实验室开放基金资助项目(WRJ19004)

发布时间:

2022-08-28

出版时间:

2022-08-28

检 索 高级检索

引用

GB/T 7714-2015 格式引文
MLA格式引文
APA格式引文