Proceedings ArticleDOI
Optimizing Elimination Templates by Greedy Parameter Search
Evgeniy V. Martyushev,Jana Vrablikova,Tomas Pajdla +2 more
- pp 15733-15743
Reads0
Chats0
TLDR
A new method is proposed for constructing elimination templates for efficient polynomial system solving of minimal problems in structure from motion, image matching, and camera tracking using a heuristic greedy optimization strategy over the space of parameters to get a template with a small size.Abstract:
We propose a new method for constructing elimination templates for efficient polynomial system solving of minimal problems in structure from motion, image matching, and camera tracking. We first construct a particular affine parameterization of the elimination templates for systems with a finite number of distinct solutions. Then, we use a heuristic greedy optimization strategy over the space of parameters to get a template with a small size. We test our method on 34 minimal problems in computer vision. For all of them, we found the templates either of the same or smaller size compared to the state-of-the-art. For some difficult examples, our templates are, e.g., 2.1, 2.5, 3.8, 6.6 times smaller. For the problem of refractive absolute pose estimation with unknown focal length, we have found a template that is 20 times smaller. Our experiments on synthetic data also show that the new solvers are fast and numerically accurate. We also present a fast and numerically accurate solver for the problem of relative pose estimation with unknown common focal length and radial distortion.read more
Citations
More filters
Journal ArticleDOI
Sparse resultant based minimal solvers in computer vision and their connection with the action matrix
TL;DR: In this article , the authors explore the theory of sparse resultants for generating minimal solvers and propose a novel approach based on a using an extra polynomial with a special form, which leads to smaller and more stable solvers than the state of the art Gr¨obner basis-based solvers.
Journal ArticleDOI
Automatic Solver Generator for Systems of Laurent Polynomial Equations
TL;DR: In this article , the authors propose an automatic solver generator for systems of Laurent polynomial equations, which is simple and fast; it applies to ideals with positive-dimensional components; it allows one to uncover partial $p$-fold symmetries automatically.
References
More filters
Journal ArticleDOI
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.
Book
Matrix Analysis and Applied Linear Algebra
TL;DR: The author presents Perron-Frobenius theory of nonnegative matrices Index, a theory of matrices that combines linear equations, vector spaces, and matrix algebra with insights into eigenvalues and Eigenvectors.
Proceedings ArticleDOI
Structure-from-Motion Revisited
TL;DR: This work proposes a new SfM technique that improves upon the state of the art to make a further step towards building a truly general-purpose pipeline.
Journal ArticleDOI
A computer algorithm for reconstructing a scene from two projections
TL;DR: A simple algorithm for computing the three-dimensional structure of a scene from a correlated pair of perspective projections is described here, when the spatial relationship between the two projections is unknown.
Journal ArticleDOI
Modeling the World from Internet Photo Collections
TL;DR: This paper presents structure-from-motion and image-based rendering algorithms that operate on hundreds of images downloaded as a result of keyword-based image search queries like “Notre Dame” or “Trevi Fountain,” and presents these algorithms and results as a first step towards 3D modeled sites, cities, and landscapes from Internet imagery.