Iterative extensions of the Sturm/Triggs algorithm : convergence and nonconvergence
We give the first complete theoretical convergence analysis for the iterative extensions of the Sturm/Triggs algorithm. We show that the simplest extension, SIESTA, converges to nonsense results. Another proposed extension has similar problems, and experiments with "balanced" iterations sh...
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1998. - 29(2007), 12 vom: 14. Dez., Seite 2217-33 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | |
| Format: | Article |
| Langue: | English |
| Publié: |
2007
|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
| Sujets: | Journal Article Research Support, Non-U.S. Gov't |