Skip navigation
Skip navigation

A Fast Method to Minimize L! Error Norm for Geometric Vision Problems

Seo, Yongduek; Hartley, Richard


Minimizing L∞ error norm for some geometric vision problems provides global optimization using the well-developed algorithm called SOCP (second order cone programming). Because the error norm belongs to quasi-convex functions, bisection method is utiliz

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
Source: Proceedings of ICCV 2007
DOI: 10.1109/ICCV.2007.4408913


File Description SizeFormat Image
01_Seo_A_Fast_Method_to_Minimize_L!_2007.pdf984.71 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator