Translator Disclaimer
Paper
1 June 1991 Iterative algorithms with fast-convergence rates in nonlinear image restoration
Author Affiliations +
Proceedings Volume 1452, Image Processing Algorithms and Techniques II; (1991) https://doi.org/10.1117/12.45374
Event: Electronic Imaging '91, 1991, San Jose, CA, United States
Abstract
In this paper, the applications of the iterative Gauss-Newton (GN) approach in nonlinear image restoration are considered. The convergence properties of a general class of nonlinear iterative algorithm are studied through the Global Convergence Theorem (GCT). The iterative GN algorithm for the solution of the least-squares optimization problem is presented. The computational complexity of this algorithm is enormous, making its implementation very difficult in practical applications. Structural modifications are introduced, which drastically reduce the computational complexity while preserving the convergence rate of the GN algorithm. With the structural modifications, the GN algorithm becomes particularly useful in nonlinear optimization problems. The convergence properties of the algorithms introduced are readily derived, on the basis of the generalized analysis and the GCT. The applications of these algorithms on practical problems, is demonstrated through an example.
© (1991) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Michael E. Zervakis and Anastasios N. Venetsanopoulos "Iterative algorithms with fast-convergence rates in nonlinear image restoration", Proc. SPIE 1452, Image Processing Algorithms and Techniques II, (1 June 1991); https://doi.org/10.1117/12.45374
PROCEEDINGS
14 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top