Discrete and geometric branch and bound algorithms for~medical image registration

DOI10.1007/s10479-010-0760-8zbMath1251.90287OpenAlexW2046079078MaRDI QIDQ1761852

Michael Stiglmayr, Kathrin Klamroth, Frank Pfeuffer

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0760-8

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

A new approach for face detection using the maximum function of probability density functions ⋮ A geometric branch-and-bound algorithm for the service bundle design problem ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ Discrete and geometric branch and bound algorithms for~medical image registration ⋮ Multi-criteria decision analysis for emergency medical service assessment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric pattern matching under Euclidean motion
• Selected topics on assignment problems
• A survey for the quadratic assignment problem
• Landmark-based image analysis. Using geometric and intensity models.
• Improving ICP with easy implementation for free-form surface matching.
• Discrete and geometric branch and bound algorithms for~medical image registration
• Biconvex sets and optimization with biconvex functions: a survey and extensions
• Simple algorithms for partial point set pattern matching under rigid motion
• Implementation techniques for geometric branch-and-bound matching methods
• On the use of interval arithmetic in geometric branch and bound algorithms
• A new point matching algorithm for non-rigid registration