Open AccessDissertation
Random sampling methods for two-view geometry estimation
R.J.M. den Hollander
- 01 Jan 2007
TL;DR: This thesis treats efficient estimation algorithms for the epipolar geometry, the model underlying two views of the same scene or object, by investigating techniques for faster fundamental matrix estimation using RANSAC.
read more
Abstract: This thesis treats efficient estimation algorithms for the epipolar geometry, the model underlying two views of the same scene or object. The epipolar geometry is computed from image correspondences that are found by local feature matching. These correspondences are used to calculate the fundamental matrix, which is the mathematical representation of the epipolar geometry. Since there are outliers among the correspondences, the fundamental matrix is usually calculated by the robust RANSAC (RANdom SAmple Consensus) algorithm which is very well suited for this purpose. A disadvantage of the algorithm, however, is that it shows a considerable complexity for higher outlier ratios. This hampers its application in vision algorithms dealing with many views. In this thesis we investigate techniques for faster fundamental matrix estimation using RANSAC. The first approach that is taken is the computation of inlier probabilities for the correspondences, that are used during sampling in the RANSAC algorithm to stimulate the selection of inliers. The second approach is the reduction of the required number of RANSAC samples by the selection of fewer correspondences per sample. The fundamental matrix hypotheses are then completed using the remaining correspondences.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Trend analysis in content identification based on fingerprinting
Wenyu Jiang,Tianshi Gao +1 more
- 10 Jun 2010
TL;DR: In this article, a ranking-based approach is proposed to identify duplicate or multiple reference content items that all match the same query content item, based on a set of query fingerprints.
53
Patent
Method of determining reference features for use in an optical object initialization tracking process and object initialization tracking method
Selim Benhimane,Daniel Ulbricht +1 more
- 23 Dec 2009
TL;DR: In this paper, a method of determining reference features for use in an optical object initialization tracking process is disclosed, which consists of capturing at least one current image of a real environment or synthetically generated by rendering a virtual model of real object to be tracked with at least 1 camera and extracting current features from the at least current image, matching a plurality of the current features with the plurality of reference features, estimating a parameter associated with the current image based on a number of current and reference features which were matched, and determining for each of the reference features whether they were correctly or incorrectly
23
Hierarchical Filtering Strategy for Registration of Remote Sensing Images of Coral Reefs
Liang Cheng,Yuzhe Pian,Zhenjie Chen,Penghui Jiang,Yongxue Liu,Gang Chen,Peijun Du,Manchun Li +7 more
TL;DR: A hierarchical filtering strategy for image registration is proposed, which is composed of two stages, and it is demonstrated that the approach with hierarchical filtering performs much better than the other approaches.
8
Patent
Method of determining reference features for use in an optical object initialization tracking process and object initialization tracking method
TL;DR: In this paper, a method was proposed to estimate the number of matches between a target and a reference in a target tracking process, where the target is tracked by a single camera.
References
Distinctive Image Features from Scale-Invariant Keypoints
TL;DR: This paper presents a method for extracting distinctive invariant features from images that can be used to perform reliable matching between different views of an object or scene and can robustly identify objects among clutter and occlusion while achieving near real-time performance.
Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography
TL;DR: New results are derived on the minimum number of landmarks needed to obtain a solution, and algorithms are presented for computing these minimum-landmark solutions in closed form that provide the basis for an automatic system that can solve the Location Determination Problem under difficult viewing.
Numerical recipes in C
William H. Press,Saul A. Teukolsky,William T. Vetterling,Brian P. Flannery +3 more
- 01 Jan 1994
TL;DR: The Diskette v 2.06, 3.5''[1.44M] for IBM PC, PS/2 and compatibles [DOS] Reference Record created on 2004-09-07, modified on 2016-08-08.
•Book
Multiple view geometry in computer vision
Richard Hartley,Andrew Zisserman +1 more
- 01 Jan 2000
TL;DR: In this article, the authors provide comprehensive background material and explain how to apply the methods and implement the algorithms directly in a unified framework, including geometric principles and how to represent objects algebraically so they can be computed and applied.
20.1K
Object recognition from local scale-invariant features
David G. Lowe
- 20 Sep 1999
TL;DR: Experimental results show that robust object recognition can be achieved in cluttered partially occluded images with a computation time of under 2 seconds.
Related Papers (5)
Derek Hoiem,Alexei A. Efros,Martial Hebert +2 more
- 17 Jun 2006
Eva Stergarsek Kuzmic,Ales Ude +1 more
- 01 Dec 2010