Error matching elimination based on a local affine algorithm

Aiming at the shortcomings of orb algorithm using the traditional RANSAC (random sampling consistency) algorithm to eliminate mismatches, such as the high number of iterations when the sample size is large, and the proportion of error points also affects the fitting accuracy of the traditional algor...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of physics. Conference series Ročník 2216; číslo 1; s. 12075 - 12084
Hlavní autori: Hu, Zhifeng, Xu, Gang, Chen, Ling, Fu, Nana, Zhen, Shuzhan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Bristol IOP Publishing 01.03.2022
Predmet:
Algorithms
Error correction
Matching
Physics
Random sampling
ISSN:1742-6588, 1742-6596
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Aiming at the shortcomings of orb algorithm using the traditional RANSAC (random sampling consistency) algorithm to eliminate mismatches, such as the high number of iterations when the sample size is large, and the proportion of error points also affects the fitting accuracy of the traditional algorithm, a rough and fine method to eliminate mismatches is proposed; The threshold screening method is used to select the optimal threshold and preliminarily eliminate a large number of wrong matching pairs to achieve the effect of rough elimination; Then the sub-window method is used to calculate the local affine matching under all windows, reduce the number of error points, and increase the correctness of the fitting model of RANSAC algorithm. The experimental results are compared with the traditional algorithm, and the matching accuracy is improved by 6% and combined with orb-slam2.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/2216/1/012075