scispace - formally typeset
Open AccessPosted Content

A sparse resultant based method for efficient minimal solvers

Reads0
Chats0
TLDR
In this paper, the sparse resultant-based method is proposed to convert the resultant constraint to an eigenvalue problem, which can significantly improve the efficiency and stability of existing Grobner-based solvers.
Abstract
Many computer vision applications require robust and efficient estimation of camera geometry. The robust estimation is usually based on solving camera geometry problems from a minimal number of input data measurements, i.e. solving minimal problems in a RANSAC framework. Minimal problems often result in complex systems of polynomial equations. Many state-of-the-art efficient polynomial solvers to these problems are based on Grobner bases and the action-matrix method that has been automatized and highly optimized in recent years. In this paper we study an alternative algebraic method for solving systems of polynomial equations, i.e., the sparse resultant-based method and propose a novel approach to convert the resultant constraint to an eigenvalue problem. This technique can significantly improve the efficiency and stability of existing resultant-based solvers. We applied our new resultant-based method to a large variety of computer vision problems and show that for most of the considered problems, the new method leads to solvers that are the same size as the the best available Grobner basis solvers and of similar accuracy. For some problems the new sparse-resultant based method leads to even smaller and more stable solvers than the state-of-the-art Grobner basis solvers. Our new method can be fully automatized and incorporated into existing tools for automatic generation of efficient polynomial solvers and as such it represents a competitive alternative to popular Grobner basis methods for minimal problems in computer vision.

read more

Citations
More filters

Using Algebraic Geometry

Marina Weber
TL;DR: The using algebraic geometry is universally compatible with any devices to read, and is available in the book collection an online access to it is set as public so you can download it instantly.
Posted Content

Computing stable resultant-based minimal solvers by hiding a variable

TL;DR: This paper studies an interesting alternative resultant-based method for solving sparse systems of polynomial equations by hiding one variable, which results in a larger eigenvalue problem than the action matrix and extra variable resultant- based methods; however, it does not need to compute an inverse or elimination of large matrices that may be numerically unstable.
Posted Content

Efficient Real-Time Radial Distortion Correction for UAVs.

TL;DR: A fast and robust minimal solver for simultaneously estimating the focal length, radial distortion profile and motion parameters from homographies, and perform better or on par with state-of-the-art methods relying on pre-calibration procedures.
Journal ArticleDOI

Application of Groebner Bases to Study a Communication System

TL;DR: In this paper, the authors discuss the importance of the use of Arabic language in the context of Arabic-to-Arabic communication and discuss the benefits of using Arabic language to communicate with each other.
Journal ArticleDOI

Application of Groebner Bases to Study a Communication System

TL;DR: In this paper , the independence of polynomials associated with the links of the network and the Jacobian determinant of these polynomial determinants are introduced. And the authors present a way to simplify a given communication network through an algorithm that splits the network into subnets and reintegrates them into a network that is a general representation or model of the studied network.
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.

Multiple View Geometry in Computer Vision.

TL;DR: This book is referred to read because it is an inspiring book to give you more chance to get experiences and also thoughts and it will show the best book collections and completed collections.
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.
Journal ArticleDOI

An efficient solution to the five-point relative pose problem

TL;DR: The algorithm is used in a robust hypothesize-and-test framework to estimate structure and motion in real-time with low delay and is the first algorithm well-suited for numerical implementation that also corresponds to the inherent complexity of the problem.
Journal ArticleDOI

Visual Odometry [Tutorial]

TL;DR: Visual odometry is the process of estimating the egomotion of an agent (e.g., vehicle, human, and robot) using only the input of a single or If multiple cameras attached to it, and application domains include robotics, wearable computing, augmented reality, and automotive.
Related Papers (5)