Computer Vision and Image Understanding
Bundle Adjustment - A Modern Synthesis
ICCV '99 Proceedings of the International Workshop on Vision Algorithms: Theory and Practice
Multiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision
Convex Optimization
How Hard is 3-View Triangulation Really?
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Quasiconvex Optimization for Robust Geometric Reconstruction
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Practical Global Optimization for Multiview Geometry
International Journal of Computer Vision
Multiple-View Geometry Under the {$L_\infty$}-Norm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hi-index | 0.00 |
Triangulation is an important part of numerous computer vision systems. The multiview triangulation problem is often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show how to recast multiview triangulation as quasi-convex optimization under the L-infinity norm. It is shown that the L-infinity norm cost function is significantly simpler than the L2 cost. In particular L-infinity norm minimization involves finding the minimum of a cost function with a single global minimum on a convex parameter domain. These problems can be efficiently solved using second-order cone programming. We carried out experiment with real data to show that L-infinity norm minimization provides a more accurate estimate and superior to previous approaches.