Abstract
In this paper, we propose new multilevel optimization methods for minimizing continuously differentiable functions obtained by discretizing models for image registration problems. These multilevel schemes rely on a novel two-step Gauss-Newton method, in which a second step is computed within each iteration by minimizing a quadratic approximation of the objective function over a certain two-dimensional subspace. Numerical results on image registration problems show that the proposed methods can outperform the standard multilevel Gauss-Newton method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
