Matching with PROSAC — Progressive Sample Consensus

Citations Over TimeTop 10% of 2005 papers

Abstract

A new robust matching method is proposed. The progressive sample consensus (PROSAC) algorithm exploits the linear ordering defined on the set of correspondences by a similarity function used in establishing tentative correspondences. Unlike RANSAC, which treats all correspondences equally and draws random samples uniformly from the full set, PROSAC samples are drawn from progressively larger sets of top-ranked correspondences. Under the mild assumption that the similarity measure predicts correctness of a match better than random guessing, we show that PROSAC achieves large computational savings. Experiments demonstrate it is often significantly faster (up to more than hundred times) than RANSAC. For the derived size of the sampled set of correspondences as a function of the number of samples already drawn, PROSAC converges towards RANSAC in the worst case. The power of the method is demonstrated on wide-baseline matching problems.

Related Papers

• → An improved RANSAC algorithm for extracting roof planes from airborne lidar data(2019)48 cited
• → Distributed RANSAC for the robust estimation of three-dimensional reconstruction(2012)30 cited
• → An Efficient User Interest Region Stitching Method using the RANSAC Algorithm(2019)1 cited
• → Design of visual odometer based on RANSAC optical flow method and feature point matching method(2020)1 cited
• → Distributed RANSAC for 3D reconstruction(2008)2 cited