Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lee, Seong Hun, Vandewalle, Patrick, Civera, Javier
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2604.22518
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866915955214385152
author Lee, Seong Hun
Vandewalle, Patrick
Civera, Javier
author_facet Lee, Seong Hun
Vandewalle, Patrick
Civera, Javier
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2604_22518
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Non-Minimal Sampling and Consensus for Prohibitively Large Datasets
Lee, Seong Hun
Vandewalle, Patrick
Civera, Javier
Computer Vision and Pattern Recognition
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.
title Non-Minimal Sampling and Consensus for Prohibitively Large Datasets
topic Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2604.22518