Adaptive Reordering Sampler with Neurally Guided MAGSAC
Tong Wei, Jirí Matas, Daniel Barath
Abstract
We propose a new sampler for robust estimators that always selects the sample with the highest probability of consisting only of inliers. After every unsuccessful iteration, the inlier probabilities are updated in a principled way via a Bayesian approach. The probabilities obtained by the deep network are used as prior (so-called neural guidance) inside the sampler. Moreover, we introduce a new loss that exploits, in a geometrically justifiable manner, the orientation and scale that can be estimated for any type of feature, e.g., SIFT or SuperPoint, to estimate two-view geometry. The new loss helps to learn higher-order information about the underlying scene geometry. Benefiting from the new sampler and the proposed loss, we combine the neural guidance with the state-of-the-art MAGSAC++. Adaptive Reordering Sampler with Neurally Guided MAGSAC (ARS-MAGSAC) is superior to the state-of-the-art in terms of accuracy and run-time on the PhotoTourism and KITTI datasets for essential and fundamental matrix estimation. The code and trained models are available at https: //github.com/weitong8591/ars_magsac .
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 278b7567-14e9-4ce8-8fd4-10e4122cb2cfCited by top-tier papers3
- SAC-GNC: Sample Consensus for Adaptive Graduated Non-ConvexityValter Piedade, Chitturi Sidhartha, Joseé Gaspar, Venu Madhav Govindu et al.ICCV 2025
- Dense Match Summarization for Faster Two-view EstimationJonathan Astermark, Anders Heyden, Viktor LarssonCVPR 2025
- Gaussian Uncertainty-Driven Multi-Model Fitting with Graph Neural NetworkLigang Zhang, Jun Li, Qiming LiAAAI 2026
Builds on9
- 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
- Progressive Correspondence Pruning by Consensus LearningChen Zhao, Yixiao Ge, Feng Zhu, Rui Zhao et al.ICCV 2021 · 101 citations
- Learning to Find Good Models in RANSACDaniel Barath, Luca Cavalli, Marc PollefeysCVPR 2022 · 41 citations
- Self-Supervised Equivariant Learning for Oriented Keypoint DetectionJongmin Lee, Byungjin Kim, Minsu ChoCVPR 2022 · 39 citations
Related papers
- MAGSAC++, a Fast, Reliable and Accurate Robust EstimatorDániel Baráth, Jana Noskova, Maksym Ivashechkin, Jiri MatasCVPR 2020
- Two-View Geometry Scoring Without CorrespondencesAxel Barroso-Laguna, Eric Brachmann, Victor Adrian Prisacariu, Gabriel J. Brostow et al.CVPR 2023
- VSAC: Efficient and Accurate Estimator for H and FMaksym Ivashechkin, Daniel Barath, Jirí MatasICCV 2021 · 37 citations
- Consensus Learning with Deep Sets for Essential Matrix EstimationDror Moran, Yuval Margalit, Guy Trostianetsky, Fadi Khatib et al.NeurIPS 2024 · 4 citations
- Can Scale-Consistent Monocular Depth Be Learned in a Self-Supervised Scale-Invariant Manner?Lijun Wang, Yifan Wang, Linzhao Wang, Yunlong Zhan et al.ICCV 2021 · 48 citations
