Iterative Extensions of the Sturm/Triggs Algorithm: Convergence and Nonconvergence
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]
|Collections||ANU Research Publications|
|Source:||Proceedings of the 9th European Conference part IV (ECCV 2006)|
|01_Oliensis_Iterative_Extensions_of_the_2006.pdf||1.56 MB||Adobe PDF||Request a copy|
|02_Oliensis_Iterative_Extensions_of_the_2006.pdf||1.16 MB||Adobe PDF||Request a copy|
|03_Oliensis_Iterative_Extensions_of_the_2006.pdf||139.62 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.