Results 131 to 140 of about 3,994 (183)
Optimal Randomized RANSAC [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008 A randomized model verification strategy for RANSAC is presented. The proposed method finds, like RANSAC, a solution that is optimal with user-specified probability. The solution is found in time that is (i) close to the shortest possible and (ii) superior to any deterministic verification strategy.
Ondřej Chum, Jiří Matas
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the AAAI Conference on Artificial Intelligence, 2015
A homography matrix is used in computer vision field to solve the correspondence problem between a pair of stereo images. RANSAC algorithm is often used to calculate the homography matrix by randomly selecting a set of features iteratively. CS-RANSAC algorithm in this paper converts RANSAC algorithm into two-layers.
GeunSik Jo +4 more
openaire +1 more source
A homography matrix is used in computer vision field to solve the correspondence problem between a pair of stereo images. RANSAC algorithm is often used to calculate the homography matrix by randomly selecting a set of features iteratively. CS-RANSAC algorithm in this paper converts RANSAC algorithm into two-layers.
GeunSik Jo +4 more
openaire +1 more source
SC-RANSAC: Spatial consistency on RANSAC
Multimedia Tools and Applications, 2018The goal of robust parameter estimation is developing a model which can properly fit to data. Parameter estimation of a geometric model, in presence of noise and error, is an important step in many image processing and computer vision applications. As the random sample consensus (RANSAC) algorithm is one of the most well-known algorithms in this field,
Mehran Fotouhi +3 more
openaire +1 more source
SPIE Proceedings, 2006
In this paper, the classical RANSAC approach is considered for robust matching to remove mismatches (outliers) in a list of putative correspondences. We will examine the justification for using the minimal size of sample set in a RANSAC trial and propose that the size of the sample set should be varied dynamically depending on the noise and data set ...
Hung, YS, Sze, WF, Tang, WK
openaire +2 more sources
In this paper, the classical RANSAC approach is considered for robust matching to remove mismatches (outliers) in a list of putative correspondences. We will examine the justification for using the minimal size of sample set in a RANSAC trial and propose that the size of the sample set should be varied dynamically depending on the noise and data set ...
Hung, YS, Sze, WF, Tang, WK
openaire +2 more sources
Distributed RANSAC for 3D reconstruction
SPIE Proceedings, 2008Many low or middle level 3D reconstruction algorithms involve a robust estimation and selection step by which parameters of the best model are estimated and inliers fitting this model are selected. The RANSAC algorithm is the most widely used robust algorithm for this step. However, this robust algorithm is computationally demanding.
Mai Xu, Maria Petrou
openaire +1 more source
Radar odometry with recursive-RANSAC
IEEE Transactions on Aerospace and Electronic Systems, 2016This paper explores the use of radar odometry for Global Positioning System–denied navigation. The range progression from arbitrary ground-based point scatterers is used to estimate an unmanned aerial vehicle’s relative motion. In high clutter environments, the recursive-RANSAC algorithm provides robust and efficient feature identification, data ...
Eric B. Quist +2 more
openaire +1 more source
2003
A new enhancement of ransac, the locally optimized ransac (lo-ransac), is introduced. It has been observed that, to find an optimal solution (with a given probability), the number of samples drawn in ransac is significantly higher than predicted from the mathematical model.
Ondrej Chum, Jiri Matas, Josef Kittler
openaire +1 more source
A new enhancement of ransac, the locally optimized ransac (lo-ransac), is introduced. It has been observed that, to find an optimal solution (with a given probability), the number of samples drawn in ransac is significantly higher than predicted from the mathematical model.
Ondrej Chum, Jiri Matas, Josef Kittler
openaire +1 more source