Space-Partitioning RANSAC
Not on the map. Why?
Abstract (arXiv)
A new algorithm is proposed to accelerate RANSAC model quality calculations. The method is based on partitioning the joint correspondence space, e.g., 2D-2D point correspondences, into a pair of regular grids. The grid cells are mapped by minimal sample models, estimated within RANSAC, to reject correspondences that are inconsistent with the model parameters early. The proposed technique is general. It works with arbitrary transformations even if a point is mapped to a point set, e.g., as a fundamental matrix maps to epipolar lines. The method is tested on thousands of image pairs from publicly available datasets on fundamental and essential matrix, homography and radially distorted homography estimation. On average, it reduces the RANSAC run-time by 41% with provably no deterioration in the accuracy. It can be straightforwardly plugged into state-of-the-art RANSAC frameworks, e.g. VSAC.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 17 of its 60 references that are in the map. First posted on arXiv 24 Nov 2021.
Builds on
17 of 60 references.
References · 17
- 2020ORB-SLAM3: An Accurate Open-Source Library for Visual, Visual-Inertial and Multi-Map SLAMcited by 862
- 2016ORB-SLAM2: an Open-Source SLAM System for Monocular, Stereo and RGB-D Camerascited by 801
- 2020Image Matching across Wide Baselines: From Paper to Practicecited by 224
- 2017Learning to Find Good Correspondencescited by 176
- 2019MAGSAC++, a fast, reliable and accurate robust estimatorcited by 160
- 2019Learning Two-View Correspondences and Geometry Using Order-Aware Networkcited by 148
- 2017Graph-Cut RANSACcited by 133
- 2019Neural-Guided RANSAC: Learning Where to Sample Model Hypothesescited by 129
- 2018MAGSAC: marginalizing sample consensuscited by 122
- 2021Progressive Correspondence Pruning by Consensus Learningcited by 46
- 2019Progressive-X: Efficient, Anytime, Multi-Model Fitting Algorithmcited by 43
- 2015MODS: Fast and Robust Method for Two-View Matchingcited by 26
5 more
- 2021VSAC: Efficient and Accurate Estimator for H and Fcited by 17
- 2020Efficient Initial Pose-graph Generation for Global SfMcited by 14
- 2017Deterministic Approximate Methods for Maximum Consensus Robust Fittingcited by 11
- 2019Consensus Maximization Tree Search Revisitedcited by 10
- 2020Minimal Solutions for Panoramic Stitching Given Gravity Priorcited by 6
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 4.
6 papers.
- 2024Obfuscation Based Privacy Preserving Representations are Recoverable Using Neighborhood Informationcited by 6
- 2025SupeRANSAC: One RANSAC to Rule Them Allcited by 6
- 2023AffineGlue: Joint Matching and Robust Estimationcited by 5
- 2025Progressive Correspondence Regenerator for Robust 3D Registrationcited by 5
- 2025Dense Match Summarization for Faster Two-view Estimationcited by 2
- 2025Fixing the RANSAC Stopping Criterioncited by 1
- 2025SupeRANSAC: One RANSAC to Rule Them All5 Jun 2025
- 2025Dense Match Summarization for Faster Two-view Estimation3 Jun 2025
- 2025Fixing the RANSAC Stopping Criterion10 Mar 2025
- 2025Progressive Correspondence Regenerator for Robust 3D Registration4 Feb 2025
- 2024Obfuscation Based Privacy Preserving Representations are Recoverable Using Neighborhood Information17 Sep 2024
- 2023AffineGlue: Joint Matching and Robust Estimation28 Jul 2023