DocumentCode
949801
Title
Balanced Exploration and Exploitation Model Search for Efficient Epipolar Geometry Estimation
Author
Goshen, Liran ; Shimshoni, Ilan
Author_Institution
Technion-lsrael Inst. of Technol., Haifa
Volume
30
Issue
7
fYear
2008
fDate
7/1/2008 12:00:00 AM
Firstpage
1230
Lastpage
1242
Abstract
The estimation of the epipolar geometry is especially difficult when the putative correspondences include a low percentage of inlier correspondences and/or a large subset of the inliers is consistent with a degenerate configuration of the epipolar geometry that is totally incorrect. This work presents the balanced exploration and exploitation model (BEEM) search algorithm, which works very well especially for these difficult scenes. The algorithm handles these two problems in a unified manner. It includes the following main features: 1) balanced use of three search techniques: global random exploration, local exploration near the current best solution, and local exploitation to improve the quality of the model, 2) exploitation of available prior information to accelerate the search process, 3) use of the best found model to guide the search process, escape from degenerate models, and define an efficient stopping criterion, 4) presentation of a simple and efficient method to estimate the epipolar geometry from two scale-invariant feature transform (SIFT) correspondences, and 5) use of the locality-sensitive hashing (LSH) approximate nearest neighbor algorithm for fast putative correspondence generation. The resulting algorithm when tested on real images with or without degenerate configurations gives quality estimations and achieves significant speedups compared to the state-of-the-art algorithms.
Keywords
cryptography; file organisation; geometry; search problems; transforms; balanced exploration model search; best found model; efficient epipolar geometry estimation; exploitation model search; fast putative correspondence generation; global random exploration; inlier correspondences; local exploitation; local exploration; locality-sensitive hashing; nearest neighbor algorithm; putative correspondences; scale-invariant feature transform; search process; stopping criterion; 3D/stereo scene analysis; Computer vision; Motion; Vision and Scene Understanding; Algorithms; Artificial Intelligence; Computer Simulation; Image Enhancement; Image Interpretation, Computer-Assisted; Imaging, Three-Dimensional; Models, Statistical; Pattern Recognition, Automated; Reproducibility of Results; Sensitivity and Specificity;
fLanguage
English
Journal_Title
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher
ieee
ISSN
0162-8828
Type
jour
DOI
10.1109/TPAMI.2007.70768
Filename
4359368
Link To Document