CLUSAC: Clustering Sample Consensus for Fundamental Matrix Estimation

In the process of model fitting for fundamental matrix estimation, RANSAC and its variants disregard and fail to reduce the interference of outliers. These methods select correspondences and calculate the model scores from the original dataset. In this work, we propose an inlier filtering method that can filter inliers from the original dataset. Using the filtered inliers can substantially reduce the interference of outliers. Based on the filtered inliers, we propose a new algorithm called CLUSAC, which calculates model quality scores on all filtered inliers. Our approach is evaluated through estimating the fundamental matrix in the dataset kusvod2, and it shows superior performance to other compared RANSAC variants in terms of precision

Purposive sample consensus: A paradigm for model fitting with application to visual odometry

© Springer International Publishing Switzerland 2015. ANSAC (random sample consensus) is a robust algorithm for model fitting and outliers' removal, however, it is neither efficient nor reliable enough to meet the requirement of many applications where time and precision is critical. Various algorithms have been developed to improve its performance for model fitting. A new algorithm named PURSAC (purposive sample consensus) is introduced in this paper, which has three major steps to address the limitations of RANSAC and its variants. Firstly, instead of assuming all the samples have a same probability to be inliers, PURSAC seeks their differences and purposively selects sample sets. Secondly, as sampling noise always exists; the selection is also according to the sensitivity analysis of a model against the noise. The final step is to apply a local optimization for further improving its model fitting performance. Tests show that PURSAC can achieve very high model fitting certainty with a small number of iterations. Two cases are investigated for PURSAC implementation. It is applied to line fitting to explain its principles, and then to feature based visual odometry, which requires efficient, robust and precise model fitting. Experimental results demonstrate that PURSAC improves the accuracy and efficiency of fundamental matrix estimation dramatically, resulting in a precise and fast visual odometry

Improving RANSAC for Efficient and Precise Model Fitting with Statistical Analysis

RANSAC (random sample consensus) has been widely used as a benchmark algorithm for model fitting in the presence of outliers for more than thirty years. It is robust for outlier removal and rough model fitting, but neither reliable nor efficient enough for many applications where precision and time is critical. Many other algorithms have been proposed for the improvement of RANSAC. However, no much effort has been done to systematically tackle its limitations on model fitting repeatability, quality indication, iteration termination, and multi-model fitting.A new paradigm, named as SASAC (statistical analysis for sample consensus), is introduced in this paper to relinquish the limitations of RANSAC above. Unlike RANSAC that does not consider sampling noise, which is true in most sampling cases, a term named as ? rate is defined in SASAC. It is used both as an indicator for the quality of model fitting and as a criterion for terminating iterative model searching. Iterative least square is advisably integrated in SASAC for optimal model estimation, and a strategy is proposed to handle a multi-model situation.Experiment results for linear and quadratic function model fitting demonstrate that SASAC can significantly improve the quality and reliability of model fitting and largely reduce the number of iterations for model searching. Using the ? rate as an indicator for the quality of model fitting can effectively avoid wrongly estimated model. In addition, SASAC works very well to a multi-model dataset and can provide reliable estimations to all the models. SASAC can be combined with RANSAC and its variants to dramatically improve their performance.</jats:p

RANSAC for Robotic Applications: A Survey

Random Sample Consensus, most commonly abbreviated as RANSAC, is a robust estimation method for the parameters of a model contaminated by a sizable percentage of outliers. In its simplest form, the process starts with a sampling of the minimum data needed to perform an estimation, followed by an evaluation of its adequacy, and further repetitions of this process until some stopping criterion is met. Multiple variants have been proposed in which this workflow is modified, typically tweaking one or several of these steps for improvements in computing time or the quality of the estimation of the parameters. RANSAC is widely applied in the field of robotics, for example, for finding geometric shapes (planes, cylinders, spheres, etc.) in cloud points or for estimating the best transformation between different camera views. In this paper, we present a review of the current state of the art of RANSAC family methods with a special interest in applications in robotics.This work has been partially funded by the Basque Government, Spain, under Research Teams Grant number IT1427-22 and under ELKARTEK LANVERSO Grant number KK-2022/00065; the Spanish Ministry of Science (MCIU), the State Research Agency (AEI), the European Regional Development Fund (FEDER), under Grant number PID2021-122402OB-C21 (MCIU/AEI/FEDER, UE); and the Spanish Ministry of Science, Innovation and Universities, under Grant FPU18/04737

BANSAC: A dynamic BAyesian Network for adaptive SAmple Consensus

RANSAC-based algorithms are the standard techniques for robust estimation in computer vision. These algorithms are iterative and computationally expensive; they alternate between random sampling of data, computing hypotheses, and running inlier counting. Many authors tried different approaches to improve efficiency. One of the major improvements is having a guided sampling, letting the RANSAC cycle stop sooner. This paper presents a new adaptive sampling process for RANSAC. Previous methods either assume no prior information about the inlier/outlier classification of data points or use some previously computed scores in the sampling. In this paper, we derive a dynamic Bayesian network that updates individual data points' inlier scores while iterating RANSAC. At each iteration, we apply weighted sampling using the updated scores. Our method works with or without prior data point scorings. In addition, we use the updated inlier/outlier scoring for deriving a new stopping criterion for the RANSAC loop. We test our method in multiple real-world datasets for several applications and obtain state-of-the-art results. Our method outperforms the baselines in accuracy while needing less computational time.Comment: ICCV 2023 pape

Space-Partitioning RANSAC

A new algorithm is proposed to accelerate RANSAC model quality calculations. The method is based on partitioning the joint correspondence space, e.g., 2D-2D point correspondences, into a pair of regular grids. The grid cells are mapped by minimal sample models, estimated within RANSAC, to reject correspondences that are inconsistent with the model parameters early. The proposed technique is general. It works with arbitrary transformations even if a point is mapped to a point set, e.g., as a fundamental matrix maps to epipolar lines. The method is tested on thousands of image pairs from publicly available datasets on fundamental and essential matrix, homography and radially distorted homography estimation. On average, it reduces the RANSAC run-time by 41% with provably no deterioration in the accuracy. It can be straightforwardly plugged into state-of-the-art RANSAC frameworks, e.g. VSAC