Efficient Solvers for Minimal Problems by Syzygy-based Reduction

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

Abstract

In this paper we study the problem of automatically generating
polynomial solvers for minimal problems. The main
contribution is a new method for finding small elimination
templates by making use of the syzygies (i.e. the polynomial
relations) that exist between the original equations. Using
these syzygies we can essentially parameterize the set
of possible elimination templates.
We evaluate our method on a wide variety of problems
from geometric computer vision and show improvement
compared to both handcrafted and automatically generated
solvers. Furthermore we apply our method on two previously
unsolved relative orientation problems.
Original languageEnglish
Title of host publicationIEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
Pages2383 - 2392
Number of pages10
ISBN (Electronic)978-1-5386-0457-1
ISBN (Print)978-1-5386-0458-8
DOIs
Publication statusPublished - 2017 Jul
EventIEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017 - e Hawaii Convention Center Honolulu, Hawaii., Honolulu, United States
Duration: 2017 Jul 212017 Jul 26
http://cvpr2017.thecvf.com

Conference

ConferenceIEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017
Abbreviated titleCVPR
Country/TerritoryUnited States
CityHonolulu
Period2017/07/212017/07/26
Internet address

Subject classification (UKÄ)

  • Computer graphics and computer vision

Fingerprint

Dive into the research topics of 'Efficient Solvers for Minimal Problems by Syzygy-based Reduction'. Together they form a unique fingerprint.

Cite this