A novel point cloud simplification method with integration of multiple-feature fusion and density uniformity

被引:18
作者
Chen, Nuo [1 ]
Lu, XinJiang [1 ]
机构
[1] Cent South Univ, State Key Lab High Performance Complex Mfg, Changsha 410083, Peoples R China
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
3D point cloud simplification; 3D reconstruction; geometric features; texture features;
D O I
10.1088/1361-6501/ac2a68
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In recent years, 3D point cloud technology has played an increasingly important role in the field of casting parts detection. Due to the huge amount of high-precision point cloud data, simplification is often necessary before 3D reconstruction to improve computational efficiency. However, most of the existing point cloud simplification algorithms often blur edge details and produce holes in the final 3D reconstruction. To avoid these problems, a novel point cloud simplification method is proposed here. To accurately describe the geometric and texture features, a multi-featured fusion method was first developed to integrate the curvature, local projection distance, normal vector and local color differences. As this approach uses multiple types of geometric features, it accurately distinguishes sharp and smooth edges. Moreover, due to the use of local color difference, the texture features of the point cloud are recognizable. Then, to evaluate the density of the non-uniform point cloud, a globular neighborhood search strategy was used to estimate the density of the point cloud itself. Since the number of points in the spherical neighborhood reflected the sparsity of the point cloud, this method accurately represented the density of a point cloud with an uneven distribution. Finally, the feature fusion and density uniformity were integrated, allowing the use of these preserved points to retain more edge details of the point cloud in the final 3D reconstruction. This approach also avoided holes in the final 3D reconstruction. On the point cloud data of Anchor, Fantisk and Humana, the root mean square error of the proposed method reduces 40%, 32% and 19% than the best algorithm among the K-means clustering, Grid average, and Graph based method, respectively.
引用
收藏
页数:10
相关论文
共 39 条
[1]   From reverse engineering to shape engineering in mechanical design [J].
Anwer, Nabil ;
Mathieu, Luc .
CIRP ANNALS-MANUFACTURING TECHNOLOGY, 2016, 65 (01) :165-168
[2]   Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem [J].
Billionnet, Alain ;
Elloumi, Sourour .
MATHEMATICAL PROGRAMMING, 2007, 109 (01) :55-68
[3]   QPCOMP: A quadratic programming based solver for mixed complementarity problems [J].
Billups, SC ;
Ferris, MC .
MATHEMATICAL PROGRAMMING, 1997, 76 (03) :533-562
[4]   Fast Resampling of Three-Dimensional Point Clouds via Graphs [J].
Chen, Siheng ;
Tian, Dong ;
Feng, Chen ;
Vetro, Anthony ;
Kovacevic, Jelena .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2018, 66 (03) :666-681
[5]   Multi-pose system for geometric measurement of large-scale assembled rotational parts [J].
Deng, Bowen ;
Wang, Zhaoba ;
Jin, Yong ;
Chen, Youxing .
MEASUREMENT SCIENCE AND TECHNOLOGY, 2017, 28 (05)
[6]   AN EFFICIENT SIMPLIFICATION METHOD FOR POINT CLOUD BASED ON SALIENT REGIONS DETECTION [J].
El Sayed, Abdul Rahman ;
El Chakik, Abdallah ;
Alabboud, Hassan ;
Yassine, Adnan .
RAIRO-OPERATIONS RESEARCH, 2019, 53 (02) :487-504
[7]   Automatic extraction of pavement markings on streets from point cloud data of mobile LiDAR [J].
Gao, Yang ;
Zhong, Ruofei ;
Tang, Tao ;
Wang, Liuzhao ;
Liu, Xianlin .
MEASUREMENT SCIENCE AND TECHNOLOGY, 2017, 28 (08)
[8]   LiDAR mapping of canopy gaps in continuous cover forests: A comparison of canopy height model and point cloud based techniques [J].
Gaulton, R. ;
Malthus, T. J. .
INTERNATIONAL JOURNAL OF REMOTE SENSING, 2010, 31 (05) :1193-1211
[9]  
Harwin S, 2012, INT ARCH PHOTOGRAMM, V39, P475
[10]   Point Cloud Simplification Method Based on k-Means Clustering [J].
He Yibo ;
Chen Ranli ;
Wu Kan ;
Duan Zhixin .
LASER & OPTOELECTRONICS PROGRESS, 2019, 56 (09)