Enhanced RANSAC sampling based on non-repeating combinations

  • Authors:
  • Robert Schattschneider;Richard Green

  • Affiliations:
  • University of Canterbury, Christchurch, New Zealand;University of Canterbury, Christchurch, New Zealand

  • Venue:
  • Proceedings of the 27th Conference on Image and Vision Computing New Zealand
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

RANSAC (RANdom SAmple Consensus) is a popular approach for robust model parameter estimation and data point filtering from noise or outlier contaminated data. In a repeating hypothesize-and-verify procedure, RANSAC selects minimal sets of random data points until a certain confidence level that a good model has been chosen is reached. Like all its descendants however, the reselection of already evaluated hypotheses causes worthless recalculations without any gain in information. Without any prior information and under the assumption that the order of data points in minimal sample sets is irrelevant, this paper proposes a new sampling strategy, which avoids the reselection of already chosen data point combinations at the cost of higher memory consumption. Using P-RANSAC, which is a close relative of RANSAC based on samples without identical data points, as an example for enhanced sampling, the increase in efficiency to be expected is theoretically analysed and confirmed in a stereo camera re-localisation experiment. Results demonstrate that for applications with few model parameters and inliers the proposed NRC-RANSAC (Non-Repeating Combinations RANSAC) is able to perform up to 5 times faster than P-RANSAC.