Rank-Constrained Fundamental Matrix Estimation by Polynomial Global Optimization Versus the Eight-Point Algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00230532" target="_blank" >RIV/68407700:21230/15:00230532 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10851-014-0545-9" target="_blank" >http://dx.doi.org/10.1007/s10851-014-0545-9</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10851-014-0545-9" target="_blank" >10.1007/s10851-014-0545-9</a>
Alternative languages
Result language
angličtina
Original language name
Rank-Constrained Fundamental Matrix Estimation by Polynomial Global Optimization Versus the Eight-Point Algorithm
Original language description
The fundamental matrix can be estimated from point matches. The current gold standard is to bootstrap the eight-point algorithm and two-viewprojective bundle adjustment. The eight-point algorithm first computes a simple linear least squares solution by minimizing an algebraic cost and then projects the result to the closest rank-deficient matrix. We propose a single-step method that solves both steps of the eight-point algorithm. Using recent results from polynomial global optimization, our method findsthe rank-deficient matrix that exactly minimizes the algebraic cost. In this special case, the optimizationmethod is reduced to the resolution of very short sequences of convex linear problems which are computationally efficient and numerically stable.The current gold standard is known to be extremely effective but is nonetheless outperformed by our rank-constrained method for bootstrapping bundle adjustment. This is here demonstrated on simulated and standard real datasets.With our in
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Mathematical Imaging and Vision
ISSN
0924-9907
e-ISSN
—
Volume of the periodical
53
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
19
Pages from-to
42-60
UT code for WoS article
000357289700004
EID of the result in the Scopus database
2-s2.0-84934439848