Improved optimization methods for image registration problems

DOI10.1007/s11075-018-0486-2zbMath1415.65135OpenAlexW2791313368MaRDI QIDQ1717565

Geovani Nunes Grapiglia, Daoping Zhang, Ke Chen, Jin Yun Yuan

Publication date: 7 February 2019

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-018-0486-2

zbMATH Keywords

subspace methodsimage registrationGauss-Newton methodmultilevel strategy

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computing methodologies for image processing (68U10)

Related Items (2)

3D Orientation-Preserving Variational Models for Accurate Image Registration ⋮ Topology-preserving 3D image segmentation based on hyperelastic regularization

Uses Software

• L-BFGS
• minpack
• FAIR.m

Cites Work

• Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
• On the limited memory BFGS method for large scale optimization
• Introductory lectures on convex optimization. A basic course.
• Optimization theory and methods. Nonlinear programming
• On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
• FAIR
• Testing Unconstrained Optimization Software
• Updating Quasi-Newton Matrices with Limited Storage
• A Hyperelastic Regularization Energy for Image Registration
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved optimization methods for image registration problems