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 Optimal Algorithm for L2 Triangulation

Thumbnail Image

Date

2007

Authors

Lu, Fangfang
Hartley, Richard

Journal Title

Journal ISSN

Volume Title

Publisher

Springer

Abstract

This paper presents a practical method for obtaining the global minimum to the least-squares (L2) triangulation problem. Although optimal algorithms for the triangulation problem under L∞-norm have been given, finding an optimal solution to the L2 trian

Description

Keywords

Keywords: Global estimate; Global optimality; Algorithms; Branch and bound method; Cost functions; Iterative methods; Linear programming; Problem solving; Triangulation

Citation

URI

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

Collections

ANU Research Publications

Source

Computer Vision - Proceedings of the 8th Asian Conference on Computer Vision (ACCV 2007)

Type

Conference paper

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

2037-12-31

Downloads

File
Description
01_Lu_A_Fast_Optimal_Algorithm_for_2007.pdf (134.26 KB)

DSpace software copyright © 2002-2026 LYRASIS

abcd