Verifying Global Minima for L2 Minimization Problems
We consider the least-squares (L2) triangulation problem and structure-and-motion with known rotatation, or known plane. Although optimal algorithms have been given for these algorithms under an L-infinity cost function, finding optimal least-squares (L2) solutions to these problems is difficult, since the cost functions are not convex, and in the worst case can have multiple minima. Iterative methods can usually be used to find a good solution, but this may be a local minimum. This paper...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of CVPR 2008|
|01_Hartley_Verifying_Global_Minima_for_L2_2008.pdf||335.05 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.