151 citations · 366 across the 24 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.CV2021
Learning to Solve Hard Minimal Problems
Petr Hruby, Timothy Duff, Anton Leykin +1
We present an approach to solving hard geometric optimization problems in the RANSAC framework. The hard minimal problems arise from relaxing the original geometric optimization pr…
cs.CV2021
Reconstructing Small 3D Objects in front of a Textured Background
Petr Hruby, Tomas Pajdla
We present a technique for a complete 3D reconstruction of small objects moving in front of a textured background. It is a particular variation of multibody structure from motion,…
math.AG2021★ 1 cited
Galois/monodromy groups for decomposing minimal problems in 3D reconstruction
Timothy Duff, Viktor Korotynskiy, Tomas Pajdla +1
We consider Galois/monodromy groups arising in computer vision applications, with a view towards building more efficient polynomial solvers. The Galois/monodromy group allows us to…