Name
Abstract | ||
|---|---|---|
RANSAC is a popular model estimation algorithm in various of computer vision applications. However, it easily gets slow as the inlier rate of the measurements declines. In this paper, a novel Adaptively Ranked Sample Consensus (ARSAC) algorithm is presented to boost the speed and robustness of RANSAC. Our algorithm adopts non-uniform sampling based on the ranked measurements. We propose an adaptive scheme which updates the ranking of the measurements on each trial, to incorporate high quality measurement into sample at high priority. We also design a geometric constraint during sampling process, which could alleviate degenerate cases caused by non-uniform sampling in epipolar geometry. Experiments on real-world data demonstrate the effectiveness and robustness of the proposed method compared to the state-of-the-art methods. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-981-10-7302-1_49 | Communications in Computer and Information Science |
Keywords | DocType | Volume |
Model estimation,Efficiency,Adaptively ranked measurements,Non-uniform sampling,Geometric constraint | Conference | 772 |
ISSN | Citations | PageRank |
1865-0929 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rui Li | 1 | 6 | 2.08 |
| Jinqiu Sun | 2 | 33 | 8.27 |
| Yu Zhu | 3 | 88 | 12.65 |
| Haisen Li | 4 | 49 | 5.47 |
| Yanning Zhang | 5 | 1613 | 176.32 |