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.

Efficient Reduction of L-infinity Geometry Problems

Date

Authors

Li, Hongdong

Publisher

Institute of Electrical and Electronics Engineers (IEEE Inc)

Abstract

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

Keywords

Keywords: Direct approach; Experimental validations; Finite set; Geometry problems; L-infinity; Newton methods; Optimizers; Pseudoconvex; Sub-problems; Computer vision; Newton-Raphson method; Set theory; Technical presentations; Computational methods

URI

http://hdl.handle.net/1885/56396

Collections

ANU Research Publications

Source

Proceeings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2009)

Type

Conference paper

DOI

10.1109/CVPRW.2009.5206653

Restricted until

2037-12-31

Downloads

File

Description

01_Li_Efficient_Reduction_of_2009.pdf (1.24 MB)

abcd