Critical Points for Two-view Triangulation
arXiv:1608.05512v11 citations
Originality Synthesis-oriented
AI Analysis
This work provides a more straightforward derivation for a known solution in computer vision, making it incremental in nature.
The paper tackles the problem of two-view triangulation by deriving a polynomial that encodes local minimizers using Lagrange multipliers, offering a simpler derivation of critical points previously presented by Hartley-Sturm.
Two-view triangulation is a problem of minimizing a quadratic polynomial under an equality constraint. We derive a polynomial that encodes the local minimizers of this problem using the theory of Lagrange multipliers. This offers a simpler derivation of the critical points that are given in Hartley-Sturm [6].