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

Seo, Yongduek; Hartley, Richard

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

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

Date

2007

Authors

Seo, Yongduek

Hartley, Richard

Publisher

Institute of Electrical and Electronics Engineers (IEEE Inc)

Abstract

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