Skip navigation
Skip navigation

Using Galois Theory to Prove Structure from Motion Algorithms are Optimal

Nister, David; Hartley, Richard; Stewenius, Henrik

Description

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

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
URI: http://hdl.handle.net/1885/39252
Source: Proceedings of the Computer Vision and Pattern Recognition Conference (CVPR 2007)
DOI: 10.1109/CVPR.2007.383089

Download

File Description SizeFormat Image
01_Nister_Using_Galois_Theory_to_Prove_2007.pdf213.37 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