资源分类
》 资源 》论文》Efficient Solvers for Minimal Problems by Syzygy-based Reduction

Efficient Solvers for Minimal Problems by Syzygy-based Reduction

2019-12-02 | |  58 |   35 |   0
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.

上一篇：Efficient optimization for Hierarchically-structured Interacting Segments (HINTS)

下一篇：Elastic Shape-from-Template with Spatially Sparse Deforming Forces

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...