Convex Relaxations for Consensus and Non-Minimal Problems in 3D Vision

ICCV 2019 Thomas ProbstDanda Pani PaudelAjad ChhatkuliLuc Van Gool

In this paper, we formulate a generic non-minimal solver using the existing tools of Polynomials Optimization Problems (POP) from computational algebraic geometry. The proposed method exploits the well known Shor's or Lasserre's relaxations, whose theoretical aspects are also discussed... (read more)

PDF Abstract

Code


No code implementations yet. Submit your code now

Tasks


Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.