This paper tackles the problem of accurately matching the points of two 3D point clouds. Most conventional methods improve their performance by extracting representative features from each point via deep-learning-based algorithms. On the other hand, the correspondence calculation between the extracted features has not been examined in depth, and non-trainable algorithms (e.g. the Sinkhorn algorithm) are frequently applied. As a result, the extracted features may be forcibly fitted to a non-trainable algorithm. Furthermore, the extracted features frequently contain stochastically unavoidable errors, which degrades the matching accuracy. In this paper, instead of using a non-trainable algorithm, we propose a differentiable matching network that can be jointly optimized with the feature extraction procedure. Our network first constructs graphs with edges connecting the points of each point cloud and then extracts discriminative edge features by using two main components: a shared set-encoder and an edge-selective cross-concatenation. These components enable us to symmetrically consider two point clouds and to extract discriminative edge features, respectively. By using the extracted discriminative edge features, our network can accurately calculate the correspondence between points. Our experimental results show that the proposed network can significantly improve the performance of point cloud matching. Our code is available at https://github.com/yanarin/ESFW
翻译:本文解决了准确匹配两个 3D 点云点点的问题。 大多数常规方法都通过深层学习的算法从每个点抽取代表特征来改进它们的性能。 另一方面,尚未对提取的特征之间的对应计算进行深入的检查,而且经常使用非可培训的算法(例如Sinkhorn算法),结果,提取的特征可能被迫安装到非可培训的算法中。此外,提取的特征经常包含不切实际的不可避免的错误,会降低匹配的准确性。在本文件中,我们建议了一个不同的匹配网络,而不是使用非可操作的算法。我们网络首先构建的图表,其边端连接每个点的云点,然后通过使用两个主要组成部分:共享的定点和边缘选择的交叉连接。这些组成部分使我们能够对称地考虑两个点的云,并提取有区别的边缘特征。我们网络可以通过利用所选的偏向边缘点来精确地测量我们网络的运行结果。