Generalized Differentiable RANSAC
Tong Wei, Yash Patel, Alexander Shekhovtsov, Jirí Matas, Daniel Barath
Abstract
We propose ∇-RANSAC, a generalized differentiable RANSAC that allows learning the entire randomized robust estimation pipeline. The proposed approach enables the use of relaxation techniques for estimating the gradients in the sampling distribution, which are then propagated through a differentiable solver. The trainable quality function marginalizes over the scores from all the models estimated within ∇-RANSAC to guide the network learning accurate and useful inlier probabilities or to train feature detection and matching networks. Our method directly maximizes the probability of drawing a good hypothesis, allowing us to learn better sampling distributions. We test ∇-RANSAC on various real-world scenarios on fundamental and essential matrix estimation, and 3D point cloud registration, outdoors and indoors, with handcrafted and learning-based features. It is superior to the state-of-the-art in terms of accuracy while running at a similar speed to its less accurate alternatives. The code and trained models are available at https://github.com/weitong8591/ differentiable_ransac .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b8a724fa-9865-4feb-ab71-5ac6d4f352afCited by top-tier papers15
- VGGSfM: Visual Geometry Grounded Deep Structure from MotionJianyuan Wang, Nikita Karaev, Christian Rupprecht, David NovotnýCVPR 2024 · 48 citations
- Emergent Outlier View Rejection in Visual Geometry Grounded TransformersJisang Han, Sunghwan Hong, Jaewoo Jung, Wooseok Jang et al.CVPR 2026 · 19 citations
- TSPO: Temporal Sampling Policy Optimization for Long-form Video Language UnderstandingCanhui Tang, Zifan Han, Hongbo Sun, Sanping Zhou et al.AAAI 2026 · 15 citations
- Turboreg: Turboclique for Robust and Efficient Point Cloud RegistrationShaocheng Yan, Pengcheng Shi, Zhenjun Zhao, Kaixin Wang et al.ICCV 2025 · 11 citations
- ArgMatch: Adaptive Refinement Gathering for Efficient Dense MatchingYuxin Deng, Kaining Zhang, Linfeng Tang, Jiaqi Yang et al.ICCV 2025 · 1 citation
Builds on12
- Geometric Transformer for Fast and Robust Point Cloud RegistrationZheng Qin, Hao Yu, Changjian Wang, Yulan Guo et al.CVPR 2022 · 436 citations
- Learning Two-View Correspondences and Geometry Using Order-Aware NetworkJiahui Zhang, Dawei Sun, Zixin Luo, Anbang Yao et al.ICCV 2019 · 362 citations
- Neural-Guided RANSAC: Learning Where to Sample Model HypothesesEric Brachmann, Carsten RotherICCV 2019 · 282 citations
- Understanding Gradient Clipping in Private SGD: A Geometric PerspectiveXiangyi Chen, Zhiwei Steven Wu, Mingyi HongNeurIPS 2020 · 254 citations
- Progressive Correspondence Pruning by Consensus LearningChen Zhao, Yixiao Ge, Feng Zhu, Rui Zhao et al.ICCV 2021 · 101 citations
Related papers
- SampleNet: Differentiable Point Cloud SamplingItai Lang, Asaf Manor, Shai AvidanCVPR 2020
- (Just) A Spoonful of Refinements Helps the Registration Error Go DownSérgio Agostinho, Aljosa Osep, Alessio Del Bue, Laura Leal-TaixéICCV 2021 · 4 citations
- Monte Carlo Diffusion for Generalizable Learning-Based RANSACJiale Wang, Chen Zhao, Wei Ke, Tong ZhangAAAI 2026
- Scalable and Differentiable Point-Cloud Registration Using Maximum Mean DiscrepancyRixon Crane, Fahira Afzal Maken, Nicholas Lawrance, Stanislav Funiak et al.ICML 2026
- Learning to Find Good Models in RANSACDaniel Barath, Luca Cavalli, Marc PollefeysCVPR 2022 · 41 citations
