Registration is a fundamental but critical task in point cloud processing, which usually depends on finding element correspondence from two point clouds. However, the finding of reliable correspondence relies on establishing a robust and discriminative description of elements and the correct matching of corresponding elements. In this letter, we develop a coarse-to-fine registration strategy, which utilizes rotation-invariant features and a new weighted graph matching method for iteratively finding correspondence. In the graph matching method, the similarity of nodes and edges in Euclidean and feature space are formulated to construct the optimization function. The proposed strategy is evaluated using two benchmark datasets and compared with several state-of-the-art methods. Regarding the experimental results, our proposed method can achieve a fine registration with rotation errors of less than 0.2 degrees and translation errors of less than 0.1m.
翻译:在点云处理中,登记是一项基本但关键的任务,通常取决于从两个点云中找到元素对应,然而,找到可靠的通信取决于对元素进行有力和有区别的描述,并正确匹配相应的元素。在本信中,我们制定了粗略至细微的登记战略,利用旋转变量特征和新的加权图表匹配方法来迭接查找通信。在图形匹配方法中,为构建优化功能制定了欧立底和特征空间的节点和边缘的相似性。拟议战略使用两个基准数据集进行评估,并与几个最新方法进行比较。关于实验结果,我们拟议方法可以实现精确的登记,旋转误差小于0.2度,翻译误差小于0.1米。