DS-SAC: Density Search for Sample Consensus

• URL: http://arxiv.org/abs/2607.03972v1
• Date: Sat, 04 Jul 2026 18:06:20 GMT
• Title: DS-SAC: Density Search for Sample Consensus
• Abstract summary: Density Search Sample Consensus (DS-SAC) is a robust estimation framework that avoids repeated random sampling by searching dense regions.<n>To facilitate global exploration, DS-SAC partitions the point set using signed residuals and searches each valid partition for high-consensus models.<n> Experiments show that DS-SAC achieves complexity with respect to the number of points, making it an efficient alternative to consensus-based methods.
• Score: 0.8626879748879773
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Robust geometric model estimation is a fundamental problem in computer vision. RANSAC and its variants remain widely used for this task; however, they rely on stochastic minimal sampling. In this article, we propose Density Search Sample Consensus (DS-SAC), a deterministic robust estimation framework, that avoids repeated random sampling by searching dense regions. Starting from an initial model estimated from the available points, the method performs local exploration via forward and backward search. To facilitate global exploration, DS-SAC recursively partitions the point set using signed residuals and searches each valid partition for high-consensus models. We show that DS-SAC has polynomial complexity with respect to the number of points, making it an efficient alternative to stochastic consensus-based methods. Experiments on large-scale real-world datasets for homography, fundamental matrix, and essential matrix estimation show that DS-SAC achieves higher AUC scores, competitive or lower median pose errors, and faster runtime compared with widely used robust estimators, including RANSAC, MAGSAC, LO-RANSAC, and GC-RANSAC.

Related papers

• DiffSAC: Diffusion-guided Sampling for Consensus-based Robust Estimation [25.779514721115742]
  We propose a Diffusion-guided Sampling for Consensus-based Robust Estimation framework.<n>DiffSAC learns the distribution of effective minimum sets and refines confidence for each data point.<n>It outputs a small number of high-quality minimum sets, enabling identification of the best hypothesis via consensus evaluation.
  arXiv  Detail & Related papers  (2026-08-31T11:15:11Z)
• SupeRANSAC: One RANSAC to Rule Them All [40.60228747873885]
  SupeRANSAC is a novel unified RANSAC pipeline.<n>We provide a detailed analysis of the techniques that make RANSAC effective for specific vision tasks.<n>We demonstrate significant performance improvements over the state-of-the-art on multiple problems and datasets.
  arXiv  Detail & Related papers  (2025-06-05T09:30:27Z)
• Chain-of-Retrieval Augmented Generation [91.02950964802454]
  This paper introduces an approach for training o1-like RAG models that retrieve and reason over relevant information step by step before generating the final answer.<n>Our proposed method, CoRAG, allows the model to dynamically reformulate the query based on the evolving state.
  arXiv  Detail & Related papers  (2025-01-24T09:12:52Z)
• Intelligent Sampling Consensus for Homography Estimation in Football Videos Using Featureless Unpaired Points [2.1372565495068616]
  H-RANSAC is an algorithm for homography estimation that eliminates the need for feature vectors or explicit point pairing.<n>A post-hoc criterion at the end of each iteration improves accuracy further.<n>Results show that H-RANSAC significantly outperforms state-of-the-art classical methods.
  arXiv  Detail & Related papers  (2023-10-07T20:56:39Z)
• RLSAC: Reinforcement Learning enhanced Sample Consensus for End-to-End Robust Estimation [74.47709320443998]
  We propose RLSAC, a novel Reinforcement Learning enhanced SAmple Consensus framework for end-to-end robust estimation. RLSAC employs a graph neural network to utilize both data and memory features to guide exploring directions for sampling the next minimum set. Our experimental results demonstrate that RLSAC can learn from features to gradually explore a better hypothesis.
  arXiv  Detail & Related papers  (2023-08-10T03:14:19Z)
• Generalized Differentiable RANSAC [95.95627475224231]
  $nabla$-RANSAC is a differentiable RANSAC that allows learning the entire randomized robust estimation pipeline. $nabla$-RANSAC is superior to the state-of-the-art in terms of accuracy while running at a similar speed to its less accurate alternatives.
  arXiv  Detail & Related papers  (2022-12-26T15:13:13Z)
• Boosting RANSAC via Dual Principal Component Pursuit [24.942079487458624]
  We introduce Dual Principal Component Pursuit (DPCP) as a robust subspace learning method with strong theoretical support and efficient algorithms. Experiments on estimating two-view homographies, fundamental and essential matrices, and three-view homographic tensors show that our approach consistently has higher accuracy than state-of-the-art alternatives.
  arXiv  Detail & Related papers  (2021-10-06T17:04:45Z)
• Beyond Farthest Point Sampling in Point-Wise Analysis [52.218037492342546]
  We propose a novel data-driven sampler learning strategy for point-wise analysis tasks. We learn sampling and downstream applications jointly. Our experiments show that jointly learning of the sampler and task brings remarkable improvement over previous baseline methods.
  arXiv  Detail & Related papers  (2021-07-09T08:08:44Z)
• Finding Geometric Models by Clustering in the Consensus Space [61.65661010039768]
  We propose a new algorithm for finding an unknown number of geometric models, e.g., homographies. We present a number of applications where the use of multiple geometric models improves accuracy. These include pose estimation from multiple generalized homographies; trajectory estimation of fast-moving objects.
  arXiv  Detail & Related papers  (2021-03-25T14:35:07Z)
• Making Affine Correspondences Work in Camera Geometry Computation [62.7633180470428]
  Local features provide region-to-region rather than point-to-point correspondences. We propose guidelines for effective use of region-to-region matches in the course of a full model estimation pipeline. Experiments show that affine solvers can achieve accuracy comparable to point-based solvers at faster run-times.
  arXiv  Detail & Related papers  (2020-07-20T12:07:48Z)
• DGSAC: Density Guided Sampling and Consensus [4.808421423598809]
  Kernel Residual Density is a key differentiator between inliers and outliers. We propose two model selection algorithms, an optimal quadratic program based, and a greedy. We evaluate our method on a wide variety of tasks like planar segmentation, motion segmentation, vanishing point estimation, plane fitting to 3D point cloud, line, and circle fitting.
  arXiv  Detail & Related papers  (2020-06-03T17:42:53Z)
• CONSAC: Robust Multi-Model Fitting by Conditional Sample Consensus [62.86856923633923]
  We present a robust estimator for fitting multiple parametric models of the same form to noisy measurements. In contrast to previous works, which resorted to hand-crafted search strategies for multiple model detection, we learn the search strategy from data. For self-supervised learning of the search, we evaluate the proposed algorithm on multi-homography estimation and demonstrate an accuracy that is superior to state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-01-08T17:37:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.