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.

Using Galois Theory to Prove Structure from Motion Algorithms are Optimal

Date

Authors

Nister, David

Hartley, Richard

Stewenius, Henrik

Publisher

Institute of Electrical and Electronics Engineers (IEEE Inc)

Abstract

This paper presents a general method, based on Galois Theory, for establishing that a problem can not be solved by a ′machine ′ that is capable of the standard arithmetic operations, extraction of radicals (that is, m-th roots for any m), as well as e

Keywords

Keywords: Numerical methods; Polynomials; Problem solving; Arithmetic operations; Galois Theory; Motion algorithms; Motion compensation

URI

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

Collections

ANU Research Publications

Source

Proceedings of the Computer Vision and Pattern Recognition Conference (CVPR 2007)

Type

Conference paper

DOI

10.1109/CVPR.2007.383089

Restricted until

2037-12-31

Downloads

File

Description

01_Nister_Using_Galois_Theory_to_Prove_2007.pdf (213.37 KB)

abcd