SC^2-PCR: A Second Order Spatial Compatibility for Efficient and Robust Point Cloud Registration

• URL: http://arxiv.org/abs/2203.14453v1
• Date: Mon, 28 Mar 2022 02:41:28 GMT
• Title: SC^2-PCR: A Second Order Spatial Compatibility for Efficient and Robust Point Cloud Registration
• Authors: Zhi Chen, Kun Sun, Fan Yang, Wenbing Tao
• Abstract summary: We propose a second order spatial compatibility (SC2) measure to compute the similarity between correspondences. Based on this measure, our registration pipeline employs a global spectral technique to find some reliable seeds from the initial correspondences. Our method can guarantee to find a certain number of outlier-free consensus sets using fewer samplings.
• Score: 32.87420625579577
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we present a second order spatial compatibility (SC^2) measure based method for efficient and robust point cloud registration (PCR), called SC^2-PCR. Firstly, we propose a second order spatial compatibility (SC^2) measure to compute the similarity between correspondences. It considers the global compatibility instead of local consistency, allowing for more distinctive clustering between inliers and outliers at early stage. Based on this measure, our registration pipeline employs a global spectral technique to find some reliable seeds from the initial correspondences. Then we design a two-stage strategy to expand each seed to a consensus set based on the SC^2 measure matrix. Finally, we feed each consensus set to a weighted SVD algorithm to generate a candidate rigid transformation and select the best model as the final result. Our method can guarantee to find a certain number of outlier-free consensus sets using fewer samplings, making the model estimation more efficient and robust. In addition, the proposed SC^2 measure is general and can be easily plugged into deep learning based frameworks. Extensive experiments are carried out to investigate the performance of our method. Code will be available at \url{https://github.com/ZhiChen902/SC2-PCR}.

Related papers

• Micro-Structures Graph-Based Point Cloud Registration for Balancing Efficiency and Accuracy [5.70403503863614]
  We propose a novel micro-structures graph-based global point cloud registration method. Our proposed method performs well on the 3DMatch and ETH datasets.
  arXiv  Detail & Related papers  (2024-10-29T08:36:23Z)
• Latent Semantic Consensus For Deterministic Geometric Model Fitting [109.44565542031384]
  We propose an effective method called Latent Semantic Consensus (LSC) LSC formulates the model fitting problem into two latent semantic spaces based on data points and model hypotheses. LSC is able to provide consistent and reliable solutions within only a few milliseconds for general multi-structural model fitting.
  arXiv  Detail & Related papers  (2024-03-11T05:35:38Z)
• "Clustering and Conquer" Procedures for Parallel Large-Scale Ranking and Selection [0.0]
  We modify the commonly used "divide and conquer" framework in parallel computing by adding a correlation-based clustering step. This seemingly simple modification can achieve an $mathcalO(p)$ sample complexity reduction rate. In large-scale AI applications such as neural architecture search, our methods demonstrate superior performance.
  arXiv  Detail & Related papers  (2024-02-03T15:56:03Z)
• Semi-DETR: Semi-Supervised Object Detection with Detection Transformers [105.45018934087076]
  We analyze the DETR-based framework on semi-supervised object detection (SSOD) We present Semi-DETR, the first transformer-based end-to-end semi-supervised object detector. Our method outperforms all state-of-the-art methods by clear margins.
  arXiv  Detail & Related papers  (2023-07-16T16:32:14Z)
• Actor-Critic based Improper Reinforcement Learning [61.430513757337486]
  We consider an improper reinforcement learning setting where a learner is given $M$ base controllers for an unknown Markov decision process. We propose two algorithms: (1) a Policy Gradient-based approach; and (2) an algorithm that can switch between a simple Actor-Critic scheme and a Natural Actor-Critic scheme.
  arXiv  Detail & Related papers  (2022-07-19T05:55:02Z)
• Rapid Person Re-Identification via Sub-space Consistency Regularization [51.76876061721556]
  Person Re-Identification (ReID) matches pedestrians across disjoint cameras. Existing ReID methods adopting real-value feature descriptors have achieved high accuracy, but they are low in efficiency due to the slow Euclidean distance computation. We propose a novel Sub-space Consistency Regularization (SCR) algorithm that can speed up the ReID procedure by 0.25$ times.
  arXiv  Detail & Related papers  (2022-07-13T02:44:05Z)
• Learning to Register Unbalanced Point Pairs [10.369750912567714]
  Recent 3D registration methods can effectively handle large-scale or partially overlapping point pairs. We present a novel 3D registration method, called UPPNet, for the unbalanced point pairs.
  arXiv  Detail & Related papers  (2022-07-09T08:03:59Z)
• DANIEL: A Fast and Robust Consensus Maximization Method for Point Cloud Registration with High Outlier Ratios [6.8858952804978335]
  Correspondence-based point cloud registration is a cornerstone in computer vision, robotics perception, photogrammetry and remote sensing. Current 3D keypoint matching techniques are very prone to yield outliers, probably even in very large numbers. We present a novel time-efficient RANSAC-type consensus solver, named DANIEL, for robust registration.
  arXiv  Detail & Related papers  (2021-10-11T08:27:00Z)
• LSG-CPD: Coherent Point Drift with Local Surface Geometry for Point Cloud Registration [1.8876415010297891]
  We propose a novel method called CPD with Local Surface Geometry (LSG-CPD) for rigid point cloud registration. Our method adaptively adds different levels of point-to-plane penalization on top of the point-to-point penalization based on the flatness of the local surface. It is significantly faster than modern implementations of CPD.
  arXiv  Detail & Related papers  (2021-03-28T03:46:41Z)
• Determinantal consensus clustering [77.34726150561087]
  We propose the use of determinantal point processes or DPP for the random restart of clustering algorithms. DPPs favor diversity of the center points within subsets. We show through simulations that, contrary to DPP, this technique fails both to ensure diversity, and to obtain a good coverage of all data facets.
  arXiv  Detail & Related papers  (2021-02-07T23:48:24Z)
• RPM-Net: Robust Point Matching using Learned Features [79.52112840465558]
  RPM-Net is a less sensitive and more robust deep learning-based approach for rigid point cloud registration. Unlike some existing methods, our RPM-Net handles missing correspondences and point clouds with partial visibility.
  arXiv  Detail & Related papers  (2020-03-30T13:45:27Z)

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.