点云
聚类分析
数据库扫描
分割
人工智能
欧几里德距离
数学
切线空间
相似性(几何)
豪斯多夫距离
模式识别(心理学)
计算机科学
模糊聚类
算法
CURE数据聚类算法
几何学
图像(数学)
作者
Hui Chen,Tingting Xie,Man Liang,Wanquan Liu,Peter Liu
标识
DOI:10.1016/j.patcog.2023.109307
摘要
This paper proposes an effective measure for the planar segmentation problem based on the clustering method. It uses the distance from a point to the local plane as a metric to characterize the relationship between data. As a result, the data points of the coplanar have a high similarity to distinguish each plane. A dissimilarity matrix of the input point cloud can be evaluated, and multidimensional scaling analysis is performed to reconstruct the correlation information between data points in the 3D Euclidean space. The obtained reconstructed point cloud shows the separation between different planes. An adaptive DBSCAN clustering method based on density stratification is developed to perform cluster segmentation on the reconstructed point cloud. Experimental results show that the proposed method can effectively solve the over-segmentation problem, and at the same time provide high segmentation accuracy.
科研通智能强力驱动
Strongly Powered by AbleSci AI