Non-Minimal Sampling and Consensus for Prohibitively Large Datasets
Not on the map. Why?
Abstract (arXiv)
We introduce NONSAC (Non-Minimal Sampling and Consensus), a general framework for robust and scalable model estimation from arbitrarily large datasets contaminated with noise and outliers. NONSAC repeatedly samples non-minimal subsets of data and generates model hypotheses using a robust estimator, producing multiple candidate models. The final model is selected based on a predefined scoring rule that evaluates hypothesis quality. Our framework is estimator-agnostic and can be integrated with existing geometric fitting algorithms such as RANSAC to improve both scalability and robustness to outliers. We propose and evaluate various scoring rules for NONSAC on relative camera pose estimation, Perspective-n-Point, and point cloud registration. Furthermore, we showcase the applicability of NONSAC to correspondence-free point cloud registration by hypothesizing all-to-all correspondences.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 56 references that are in the map. First posted on arXiv 24 Apr 2026.
Builds on
25 of 56 references.
References · 25
- 2020RAFT: Recurrent All-Pairs Field Transforms for Optical Flowcited by 2,415
- 2021LoFTR: Detector-Free Local Feature Matching with Transformerscited by 984
- 2020TEASER: Fast and Certifiable Point Cloud Registrationcited by 274
- 2020Image Matching across Wide Baselines: From Paper to Practicecited by 225
- 2017Learning to Find Good Correspondencescited by 176
- 2019MAGSAC++, a fast, reliable and accurate robust estimatorcited by 161
- 2021PointDSC: Robust Point Cloud Registration using Deep Spatial Consistencycited by 142
- 2019Graduated Non-Convexity for Robust Spatial Perception: From Non-Minimal Solvers to Global Outlier Rejectioncited by 94
- 20233D Registration with Maximal Cliquescited by 84
- 2023EPro-PnP: Generalized End-to-End Probabilistic Perspective-n-Points for Monocular Object Pose Estimationcited by 79
- 2017Guaranteed Outlier Removal for Point Cloud Registration with Correspondencescited by 62
- 2022SC^2-PCR: A Second Order Spatial Compatibility for Efficient and Robust Point Cloud Registrationcited by 62
13 more
- 2020Solving the Blind Perspective-n-Point Problem End-To-End With Robust Differentiable Geometric Optimizationcited by 38
- 2023Robust Outlier Rejection for 3D Registration with Variational Bayescited by 31
- 2019An Efficient Solution to Non-Minimal Case Essential Matrix Estimationcited by 16
- 2024Scalable 3D Registration via Truncated Entry-wise Absolute Residualscited by 16
- 2023Robust Single Rotation Averaging Revisitedcited by 6
- 2024Revisiting Sampson Approximations for Geometric Estimation Problemscited by 6
- 2021Fast and Robust Certifiable Estimation of the Relative Pose Between Two Calibrated Camerascited by 5
- 2017ANSAC: Adaptive Non-minimal Sample and Consensuscited by 4
- 2023From Correspondences to Pose: Non-minimal Certifiably Optimal Relative Pose without Disambiguationcited by 4
- 2024Linear Relative Pose Estimation Founded on Pose-only Imaging Geometrycited by 2
- 2024PCR-99: A Practical Method for Point Cloud Registration with 99 Percent Outlierscited by 2
- 2024Consensus Learning with Deep Sets for Essential Matrix Estimationcited by 1
- 2025P3P Made Easycited by 1
Built on by
Not cited yet.