Self-supervised rigid transformation equivariance for accurate 3D point cloud registration. (October 2022)

• Record Type: Journal Article
• Authors: Zhang, Zhiyuan; Sun, Jiadai; Dai, Yuchao; Zhou, Dingfu; Song, Xibin; He, Mingyi
• Is Part Of: Pattern recognition. Volume 130(2022)
• Publication Date: 2022-10
• Subjects: Point cloud -- Rigid transformation equivariance -- Learned cost volume; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2022.108784
• Languages: English
• ISSNs: 0031-3203

Abstract

Highlights: We build a dedicated RTE and design a Siamese structurefor 3D point cloud registration. We propose to learn the matching matrix from the LCV more effectively instead of the hand crafted matching strategy. Remarkable performance on several datasets topping the state of the art methods proves the effectiveness of our method. Abstract: Transformation equivariance has been widely investigated in 3D point cloud representation learning for more informative descriptors, which formulates the change of the representation with respect to the transformation of the input point clouds explicitly. In this paper, we extend this property to the task of 3D point cloud registration and propose a r igid t ransformation e quivariance (RTE ) for accurate 3D point cloud registration. Specifically, RTE formulates the change of the relative pose explicitly with respect to the rigid transformation of the input point clouds. To exploit RTE, we adopt a Siamese structure network with two shared registration branches. One focuses on the input pair of point clouds, and the other one focuses on the new pair achieved by applying two random rigid transformations to the input point clouds respectively. Since the change of the two output relative poses has been predicted according to RTE, a new additional self-supervised loss is obtained to supervise the training. This general network structure can be integrated with most learning-based point cloud registration frameworks easily to improve the performance. Our method adopts the state-of-the-art virtual point-based pipelines as our shared branches, in which we propose a data-driven matching based on l earned c ost v olume (LCV ) rather than traditional hand-crafted matching strategies. Experimental evaluations on both synthetic datasets and real datasets validate the effectiveness of our proposed framework. The source code will be made public.