|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM180185497 |
| 003 |
DE-627 |
| 005 |
20231223155040.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231223s2008 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2007.70768
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0601.xml
|
| 035 |
|
|
|a (DE-627)NLM180185497
|
| 035 |
|
|
|a (NLM)18550905
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Goshen, Liran
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Balanced Exploration and Exploitation Model search for efficient epipolar geometry estimation
|
| 264 |
|
1 |
|c 2008
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 10.07.2008
|
| 500 |
|
|
|a Date Revised 13.06.2008
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status MEDLINE
|
| 520 |
|
|
|a 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 Search (BEEM) algorithm that 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) Exploits available prior information to accelerate the search process. (3) Uses the best found model to guide the search process, escape from degenerate models and to define an efficient stopping criterion. (4) Presents a simple and efficient method to estimate the epipolar geometry from two SIFT correspondences. (5) Uses the locality-sensitive hashing (LSH) approximate nearest neighbor algorithm for fast putative correspondences 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
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 700 |
1 |
|
|a Shimshoni, Ilan
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 30(2008), 7 vom: 12. Juli, Seite 1230-42
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:30
|g year:2008
|g number:7
|g day:12
|g month:07
|g pages:1230-42
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2007.70768
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 30
|j 2008
|e 7
|b 12
|c 07
|h 1230-42
|