A Fast Optimal Algorithm for L2 Triangulation
This paper presents a practical method for obtaining the global minimum to the least-squares (L2) triangulation problem. Although optimal algorithms for the triangulation problem under L∞-norm have been given, finding an optimal solution to the L2 trian
|Collections||ANU Research Publications|
|Source:||Computer Vision - Proceedings of the 8th Asian Conference on Computer Vision (ACCV 2007)|
|01_Lu_A_Fast_Optimal_Algorithm_for_2007.pdf||134.26 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.