Abstract 3D point cloud registration is a critical technology in the fields of visual measurement and robot automation processing. In actual large-scale industrial production, the accuracy of point cloud registration directly affects the quality of automated welding processes. However, most existing methods are confronted with serious challenges such as the failure of partial-to-partial point cloud model registration when facing robot automatic processing guidance and error analysis work. Therefore, this paper proposes a novel two-stage network architecture for point cloud registration, which aims at robot pose adjustment and visual guidance in the field of automated welding by using 3D point cloud data. Specifically, we propose a neighborhood-based multi-head attention module in the coarse registration stage. The neighborhood information of each point can be aggregated through focusing on different weight coefficients of multi-head inputs. Then the spatial structure features which is used to establish the overlapping constraint of point clouds are obtained based on above neighborhood information. In the fine registration stage, we propose the similarity matching removal module based on multiple attention fusion features to explore deeper features from different aspects. By using deep fusion features to guide the similarity calculation, the interference of non-overlapping points is removed to achieve the finer registration. Eventually, we compare and analyze the proposed method with the SOTA ones through several error metrics and overlap estimation experiments based on the ModelNet40 dataset. The test results indicate that our method, relative to other mainstream techniques, achieves lower error rates and the most superior accuracy of 98.61% and recall of 98.37%. To demonstrate the generalization performance of proposed algorithm, extensive experiments on the Stanford 3D Scanning Repository, 7-Scenes and our own scanning dataset using partially overlapping point clouds individually under clean and noisy conditions show the validity and reliability of our proposed registration network.
Read full abstract