2016 International Conference on Robots &Amp; Intelligent System (ICRIS) 2016
DOI: 10.1109/icris.2016.19
|View full text |Cite
|
Sign up to set email alerts
|

An Improved RANSAC Algorithm Based on Similar Structure Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…It sampled a minimal subset iteratively, estimated the fundamental matrix model, and obtained the consistent inliers by verifying the quality of the set's number. Many approaches have been developed to improve RANSAC [18][19][20][21]. The shortcomings of these resampling methods are the runtime will exponentially increase when the outlier percentage in the putative set is high, and the estimated parametric model is less-efficient undergoing non-rigid transformations which are more complex.…”
Section: Related Workmentioning
confidence: 99%
“…It sampled a minimal subset iteratively, estimated the fundamental matrix model, and obtained the consistent inliers by verifying the quality of the set's number. Many approaches have been developed to improve RANSAC [18][19][20][21]. The shortcomings of these resampling methods are the runtime will exponentially increase when the outlier percentage in the putative set is high, and the estimated parametric model is less-efficient undergoing non-rigid transformations which are more complex.…”
Section: Related Workmentioning
confidence: 99%
“…In our previous work [11], a robust method was proposed, which is based on comparing the triangular topologies of the feature points. Zhu et al put forward the method, based on the similar structure constraints of the feature points [12]. Luo et al analyze the relationship of the Euclidean distance between the feature points and then corrects the mismatch on the basis of the angular cosine [13].…”
Section: Geometry-based Mismatching Removalmentioning
confidence: 99%
“…If the amount of calculation per iteration is 50, then l is 1000. In [41], the RANSAC algorithm is used for image matching. The upper limit of the number of iterations is 400.…”
Section: Comparative Analysismentioning
confidence: 99%