.png){kind=icon}
.png){kind=icon}
Return
Two-View Geometry Estimation Using RANSAC With Locality Preserving Constraint
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2964425.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The random sample consensus (RANSAC) based algorithm is widely used in estimating the two-view geometry from image point correspondences. However, it often becomes extremely slow when the data is contaminated by a large percentage of incorrect matches. To address this problem, the paper proposes a new modification of RANSAC called LP-RANSAC that is robust to varying inlier ratios and achieves large computational savings without deterioration in accuracy. LP-RANSAC integrates the locality preserving constraint into the universal RANSAC framework, which prunes most of the unreliable correspondences before the hypothesize-and-verify loop and guides non-uniform sampling to generate and verify promising models earlier. Unlike other guided sampling strategies, the proposed method is simple to implement and does not require any prior information. Extensive experiments performed on the publicly available datasets reveal that LP-RANSAC can achieve more accurate and stable solutions at much lower computational cost (in milliseconds on standard CPU) than state-of-the-art methods, particularly when handling problems with low inlier ratios.
Keywords:
Robust estimation
RANSAC
outlier removal
image matching
two-view geometry
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W