Two-view point cloud registration network: feature and geometry

被引:3
作者
Wang, Lingpeng [1 ]
Yang, Bing [1 ]
Ye, Hailiang [1 ]
Cao, Feilong [1 ]
机构
[1] China Jiliang Univ, Coll Sci, Hangzhou 310018, Peoples R China
基金
中国国家自然科学基金;
关键词
Deep learning; Point cloud registration; Feature matching; Graph neural network;
D O I
10.1007/s10489-023-05263-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Rigid point cloud registration is a crucial upstream task in computer vision, whose goal is to align two misaligned point clouds using a rigid transformation. Existing methods, which directly utilize extracted point features for computing point relationships, are likely to result in a wrong-matching relationship since two or more similar feature points in the source point cloud easily correspond to the same point in the target point cloud. To this end, this paper proposes a two-view point cloud registration network that better alleviates the problem of similar feature points from both the feature and geometry levels. Specifically, at the feature level, a residual correction unit is proposed to learn feature-aware coefficients from raw 3D point clouds to adaptively increase or decrease the difference between features. An attention mechanism is established in two-point clouds to capture the implicit feature relationship between the two-point clouds, gathering the information of another point cloud to enrich the feature information of its own point cloud. Second, at the geometry level, a dual-view graph topology fusion module is described. All points in the graph structure are no longer independent but connected by their geometry structure. Therefore, each point can aggregate neighbor information in the same point cloud and in different point clouds through the constructed single graph and interactive graph, so that each point can enhance the difference between points through its geometry structure. In order to fuse the information of a single graph and an interactive graph, a cross-attention module is proposed to supplement contextual information to obtain point features that are more suitable for matching. Experimental results demonstrate that our method achieves excellent results on complete and partial noisy point clouds.
引用
收藏
页码:3135 / 3151
页数:17
相关论文
共 49 条
[1]   4-points congruent sets for robust pairwise surface registration [J].
Aiger, Dror ;
Mitra, Niloy J. ;
Cohen-Or, Daniel .
ACM TRANSACTIONS ON GRAPHICS, 2008, 27 (03)
[2]  
[Anonymous], 2015, PROC CVPR IEEE, DOI DOI 10.1109/CVPR.2015.7298801
[3]   PointNetLK: Robust & Efficient Point Cloud Registration using PointNet [J].
Aoki, Yasuhiro ;
Goforth, Hunter ;
Srivatsan, Rangaprasad Arun ;
Lucey, Simon .
2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, :7156-7165
[4]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[5]   Sparse Iterative Closest Point [J].
Bouaziz, Sofien ;
Tagliasacchi, Andrea ;
Pauly, Mark .
COMPUTER GRAPHICS FORUM, 2013, 32 (05) :113-123
[6]   LCDNet: Deep Loop Closure Detection and Point Cloud Registration for LiDAR SLAM [J].
Cattaneo, Daniele ;
Vaghi, Matteo ;
Valada, Abhinav .
IEEE TRANSACTIONS ON ROBOTICS, 2022, 38 (04) :2074-2093
[7]   Deep Learning for Image and Point Cloud Fusion in Autonomous Driving: A Review [J].
Cui, Yaodong ;
Chen, Ren ;
Chu, Wenbo ;
Chen, Long ;
Tian, Daxin ;
Li, Ying ;
Cao, Dongpu .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 23 (02) :722-739
[8]   Shape Completion using 3D-Encoder-Predictor CNNs and Shape Synthesis [J].
Dai, Angela ;
Qi, Charles Ruizhongtai ;
Niessner, Matthias .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :6545-6554
[9]  
Das A, 2012, IEEE INT C INT ROBOT, P2705, DOI 10.1109/IROS.2012.6386185
[10]  
Devlin J, 2019, 2019 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL HLT 2019), VOL. 1, P4171