Skip navigation
Skip navigation

Iterative Extensions of the Sturm/Triggs Algorithm: Convergence and Nonconvergence

Oliensis, John; Hartley, Richard


We show that SIESTA, the simplest iterative extension of the Sturm/Triggs algorithm, descends an error function. However, we prove that SIESTA does not converge to usable results. The iterative extension of Mahamud et al. has similar problems, and experiments with "balanced" iterations show that they can fail to converge. We present CIESTA, an algorithm which avoids these problems. It is identical to SIESTA except for one extra, simple stage of computation. We prove that CIESTA descends an...[Show more]

CollectionsANU Research Publications
Date published: 2006
Type: Conference paper
Source: Proceedings of the 9th European Conference part IV (ECCV 2006)
DOI: 10.1007/11744085_17


File Description SizeFormat Image
01_Oliensis_Iterative_Extensions_of_the_2006.pdf1.56 MBAdobe PDF    Request a copy
02_Oliensis_Iterative_Extensions_of_the_2006.pdf1.16 MBAdobe PDF    Request a copy
03_Oliensis_Iterative_Extensions_of_the_2006.pdf139.62 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator