GAPS: Generator for Automatic Polynomial Solvers

04/24/2020
by   Bo Li, et al.
0

Minimal problems in computer vision raise the demand of generating efficient automatic solvers for polynomial equation systems. Given a polynomial system repeated with different coefficient instances, the traditional Gröbner basis or normal form based solution is very inefficient. Fortunately the Gröbner basis of a same polynomial system with different coefficients is found to share consistent inner structure. By precomputing such structures offline, Gröbner basis as well as the polynomial system solutions can be solved automatically and efficiently online. In the past decade, several tools have been released to generate automatic solvers for a general minimal problems. The most recent tool autogen from Larsson et al. is a representative of these tools with state-of-the-art performance in solver efficiency. GAPS wraps and improves autogen with more user-friendly interface, more functionality and better stability. We demonstrate in this report the main approach and enhancement features of GAPS. A short tutorial of the software is also included.

READ FULL TEXT
research
12/21/2019

A sparse resultant based method for efficient minimal solvers

Many computer vision applications require robust and efficient estimatio...
research
01/16/2023

Sparse resultant based minimal solvers in computer vision and their connection with the action matrix

Many computer vision applications require robust and efficient estimatio...
research
07/01/2023

Automatic Solver Generator for Systems of Laurent Polynomial Equations

In computer vision applications, the following problem often arises: Giv...
research
03/12/2018

Beyond Gröbner Bases: Basis Selection for Minimal Solvers

Many computer vision applications require robust estimation of the under...
research
09/10/2020

Sparse Polynomial Chaos Expansions: Solvers, Basis Adaptivity and Meta-selection

Sparse polynomial chaos expansions (PCEs) are an efficient and widely us...
research
12/07/2021

GPU-Based Homotopy Continuation for Minimal Problems in Computer Vision

Systems of polynomial equations arise frequently in computer vision, esp...
research
09/28/2016

Solving polynomial systems via homotopy continuation and monodromy

We study methods for finding the solution set of a generic system in a f...

Please sign up or login with your details

Forgot password? Click here to reset