Fixing the Locally Optimized RANSAC
2012pp. 95.1–95.11
Citations Over TimeTop 10% of 2012 papers
Abstract
The paper revisits the problem of local optimization for RANSAC. Improvements of the LO-RANSAC procedure are proposed: a use of truncated quadratic cost function, an introduction of a limit on the number of inliers used for the least squares computation and several implementation issues are addressed. The implementation is made publicly available. Extensive experiments demonstrate that the novel algorithm called LO + -RANSAC is (1) very stable (almost non-random in nature), (2) very precise in a broad range of con- ditions, (3) less sensitive to the choice of inlier-outlier threshold and (4) it offers a sig- nificantly better starting point for bundle adjustment than the Gold Standard method advocated in the Hartley-Zisserman book.
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