Efficient Reduction of L-infinity Geometry Problems
This paper presents a new method for computing optimal L∞ solutions for vision geometry problems, particularly for those problems of fixed-dimension and of large-scale. Our strategy for solving a large L∞ problem is to reduce it to a finite set of sma
|Collections||ANU Research Publications|
|Source:||Proceeings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2009)|
|01_Li_Efficient_Reduction_of_2009.pdf||1.27 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.