3D Registration with Maximal Cliques

• URL: http://arxiv.org/abs/2305.10854v1
• Date: Thu, 18 May 2023 10:15:44 GMT
• Title: 3D Registration with Maximal Cliques
• Authors: Xiyu Zhang, Jiaqi Yang, Shikun Zhang and Yanning Zhang
• Abstract summary: We present a 3D registration method with maximal cliques (MAC) The key insight is to loosen the previous maximum clique constraint. Experiments on U3M, 3DMatch, 3DLoMatch and KITTI demonstrate that MAC effectively increases registration accuracy.
• Score: 49.41310839477418
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As a fundamental problem in computer vision, 3D point cloud registration (PCR) aims to seek the optimal pose to align a point cloud pair. In this paper, we present a 3D registration method with maximal cliques (MAC). The key insight is to loosen the previous maximum clique constraint, and mine more local consensus information in a graph for accurate pose hypotheses generation: 1) A compatibility graph is constructed to render the affinity relationship between initial correspondences. 2) We search for maximal cliques in the graph, each of which represents a consensus set. We perform node-guided clique selection then, where each node corresponds to the maximal clique with the greatest graph weight. 3) Transformation hypotheses are computed for the selected cliques by the SVD algorithm and the best hypothesis is used to perform registration. Extensive experiments on U3M, 3DMatch, 3DLoMatch and KITTI demonstrate that MAC effectively increases registration accuracy, outperforms various state-of-the-art methods and boosts the performance of deep-learned methods. MAC combined with deep-learned methods achieves state-of-the-art registration recall of 95.7% / 78.9% on 3DMatch / 3DLoMatch.

Related papers

• FastMAC: Stochastic Spectral Sampling of Correspondence Graph [55.75524096647733]
  We present the first study that introduces graph signal processing into the domain of correspondence graph. We exploit the generalized degree signal on correspondence graph and pursue sampling strategies that preserve high-frequency components. As an application, we build a complete 3D registration algorithm termed FastMAC, that reaches real-time speed.
  arXiv  Detail & Related papers  (2024-03-13T17:59:56Z)
• CLIPPER+: A Fast Maximal Clique Algorithm for Robust Global Registration [3.448338949969246]
  We present CLIPPER+, an algorithm for finding maximal cliques in unweighted graphs for outlier-robust global registration. We evaluate the performance of CLIPPER+ on standard graph benchmarks, as well as synthetic and real-world point cloud registration problems.
  arXiv  Detail & Related papers  (2024-02-23T17:50:22Z)
• M3C: A Framework towards Convergent, Flexible, and Unsupervised Learning of Mixture Graph Matching and Clustering [57.947071423091415]
  We introduce Minorize-Maximization Matching and Clustering (M3C), a learning-free algorithm that guarantees theoretical convergence. We develop UM3C, an unsupervised model that incorporates novel edge-wise affinity learning and pseudo label selection. Our method outperforms state-of-the-art graph matching and mixture graph matching and clustering approaches in both accuracy and efficiency.
  arXiv  Detail & Related papers  (2023-10-27T19:40:34Z)
• SimMatchV2: Semi-Supervised Learning with Graph Consistency [53.31681712576555]
  We introduce a new semi-supervised learning algorithm - SimMatchV2. It formulates various consistency regularizations between labeled and unlabeled data from the graph perspective. SimMatchV2 has been validated on multiple semi-supervised learning benchmarks.
  arXiv  Detail & Related papers  (2023-08-13T05:56:36Z)
• CheckerPose: Progressive Dense Keypoint Localization for Object Pose Estimation with Graph Neural Network [66.24726878647543]
  Estimating the 6-DoF pose of a rigid object from a single RGB image is a crucial yet challenging task. Recent studies have shown the great potential of dense correspondence-based solutions. We propose a novel pose estimation algorithm named CheckerPose, which improves on three main aspects.
  arXiv  Detail & Related papers  (2023-03-29T17:30:53Z)
• Large-scale Point Cloud Registration Based on Graph Matching Optimization [30.92028761652611]
  We propose a underlineGraph underlineMatching underlineOptimization based underlineNetwork. The proposed method has been evaluated on the 3DMatch/3DLoMatch benchmarks and the KITTI benchmark.
  arXiv  Detail & Related papers  (2023-02-12T03:29:35Z)
• GraphReg: Dynamical Point Cloud Registration with Geometry-aware Graph Signal Processing [0.0]
  This study presents a high-accuracy, efficient, and physically induced method for 3D point cloud registration. We explore geometry aware rigid-body dynamics to regulate the particle (point) motion, which results in more precise and robust registration. Results demonstrate that our proposed method outperforms state-of-the-art approaches in terms of accuracy and is more suitable for registering large-scale point clouds.
  arXiv  Detail & Related papers  (2023-02-02T14:06:46Z)
• Robust Point Cloud Registration Framework Based on Deep Graph Matching(TPAMI Version) [13.286247750893681]
  3D point cloud registration is a fundamental problem in computer vision and robotics. We propose a novel deep graph matching-based framework for point cloud registration.
  arXiv  Detail & Related papers  (2022-11-09T06:05:25Z)
• 2D or not 2D? Adaptive 3D Convolution Selection for Efficient Video Recognition [84.697097472401]
  We introduce Ada3D, a conditional computation framework that learns instance-specific 3D usage policies to determine frames and convolution layers to be used in a 3D network. We demonstrate that our method achieves similar accuracies to state-of-the-art 3D models while requiring 20%-50% less computation across different datasets.
  arXiv  Detail & Related papers  (2020-12-29T21:40:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.