Verifying global minima for L2 minimization problems in multiple view geometry
We consider the least-squares (L2) minimization problems in multiple view geometry for triangulation, homography, camera resectioning and structure-and-motion with known rotation, or known plane. Although optimal algorithms have been given for these problems under an L-infinity cost function, finding optimal least-squares solutions to these problems is difficult, since the cost functions are not convex, and in the worst case may have multiple minima. Iterative methods can be used to find a good...[Show more]
|Collections||ANU Research Publications|
|Source:||International Journal of Computer Vision|
|01_Hartley_Verifying_global_minima_for_L2_2013.pdf||813.1 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.