A sparse resultant based method for efficient minimal solvers

12/21/2019
by   Snehal Bhayani, et al.
0

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 Gröbner 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 Gröbner 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 Gröbner 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 Gröbner basis methods for minimal problems in computer vision.

READ FULL TEXT

page 1

page 2

page 3

page 4

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/17/2020

Computing stable resultant-based minimal solvers by hiding a variable

Many computer vision applications require robust and efficient estimatio...
research
03/12/2018

Beyond Gröbner Bases: Basis Selection for Minimal Solvers

Many computer vision applications require robust estimation of the under...
research
04/24/2020

GAPS: Generator for Automatic Polynomial Solvers

Minimal problems in computer vision raise the demand of generating effic...
research
02/11/2018

QRkit: Sparse, Composable QR Decompositions for Efficient and Stable Solutions to Problems in Computer Vision

Embedded computer vision applications increasingly require the speed and...
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
07/08/2010

Improved RANSAC performance using simple, iterative minimal-set solvers

RANSAC is a popular technique for estimating model parameters in the pre...

Please sign up or login with your details

Forgot password? Click here to reset