mlsanityData to 7 Oct 2026

RANSAC Back to SOTA: A Two-stage Consensus Filtering for Real-time 3D Registration

arXiv 2410.15682 ↗First posted 21 Oct 2024cs.CV cs.ROcited by 7

Not on the map. Why?

Abstract (arXiv)

Correspondence-based point cloud registration (PCR) plays a key role in robotics and computer vision. However, challenges like sensor noises, object occlusions, and descriptor limitations inevitably result in numerous outliers. RANSAC family is the most popular outlier removal solution. However, the requisite iterations escalate exponentially with the outlier ratio, rendering it far inferior to existing methods (SC2PCR [1], MAC [2], etc.) in terms of accuracy or speed. Thus, we propose a two-stage consensus filtering (TCF) that elevates RANSAC to state-of-the-art (SOTA) speed and accuracy. Firstly, one-point RANSAC obtains a consensus set based on length consistency. Subsequently, two-point RANSAC refines the set via angle consistency. Then, three-point RANSAC computes a coarse pose and removes outliers based on transformed correspondence's distances. Drawing on optimizations from one-point and two-point RANSAC, three-point RANSAC requires only a few iterations. Eventually, an iterative reweighted least squares (IRLS) is applied to yield the optimal pose. Experiments on the large-scale KITTI and ETH datasets demonstrate our method achieves up to three-orders-of-magnitude speedup compared to MAC while maintaining registration accuracy and recall. Our code is available at https://github.com/ShiPC-AI/TCF.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 18 of its 46 references that are in the map. First posted on arXiv 21 Oct 2024.

Builds on

18 of 46 references.

References · 18

  1. 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,220
  2. 2015Pointer Networkscited by 882
  3. 20163DMatch: Learning Local Geometric Descriptors from RGB-D Reconstructionscited by 333
  4. 2019Deep Closest Point: Learning Representations for Point Cloud Registrationcited by 318
  5. 2020PREDATOR: Registration of 3D Point Clouds with Low Overlapcited by 287
  6. 2020TEASER: Fast and Certifiable Point Cloud Registrationcited by 274
  7. 2018PPFNet: Global Context Aware Local Features for Robust 3D Point Matchingcited by 180
  8. 2016Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registrationcited by 159
  9. 2018PPF-FoldNet: Unsupervised Learning of Rotation Invariant 3D Local Descriptorscited by 140
  10. 2017Graph-Cut RANSACcited by 133
  11. 2022REGTR: End-to-end Point Cloud Correspondences with Transformerscited by 94
  12. 2019Graduated Non-Convexity for Robust Spatial Perception: From Non-Minimal Solvers to Global Outlier Rejectioncited by 92
6 more
  1. 20233D Registration with Maximal Cliquescited by 83
  2. 2022SC^2-PCR: A Second Order Spatial Compatibility for Efficient and Robust Point Cloud Registrationcited by 62
  3. 2020ROBIN: a Graph-Theoretic Approach to Reject Outliers in Robust Estimation using Invariantscited by 38
  4. 2020CLIPPER: A Graph-Theoretic Framework for Robust Data Associationcited by 28
  5. 2023LiDAR-Based Place Recognition For Autonomous Driving: A Surveycited by 21
  6. 2021Stein ICP for Uncertainty Estimation in Point Cloud Matchingcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 4; 2026: 3.

7 papers.