Implementation techniques for geometric branch-and-bound matching methods

DOI10.1016/S1077-3142(03)00026-2MaRDI QIDQ4419487zbMATH OpenFDO

Authors Thomas M. Breuel

Publication date 13 August 2003

Published in Computer Vision and Image Understanding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1077-3142(03)00026-2

zbMATH Keywords

Bounded errorBranch and boundGaussian errorGeometric matchingGlobal optimizationMaximum likelihoodVisual object recognition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 1895618
• scientific article; zbMATH DE number 2062654
• Geometric branch-and-bound methods for constrained global optimization problems
• Branch-reduction-bound algorithm for generalized geometric programming
• On the use of interval arithmetic in geometric branch and bound algorithms
• Geometric constraint satisfaction using optimization methods.
• Deterministic global optimization. Geometric branch-and-bound methods and their applications
• Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
• A Geometric Buchberger Algorithm for Integer Programming
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods

Cited in

(10)

• Attributed point matching for automatic groundtruth generation
• Two-view orthographic epipolar geometry: minimal and optimal solvers
• Discrete and geometric branch and bound algorithms for~medical image registration
• Tractable algorithms for robust model estimation
• Robust and optimal registration of image sets and structured scenes via sum-of-squares polynomials
• On the use of interval arithmetic in geometric branch and bound algorithms
• scientific article; zbMATH DE number 2062654 (Why is no real title available?)
• A practical, globally optimal algorithm for geometric matching under uncertainty
• Global optimization through rotation space search
• Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments

Describes a project that uses

Uses Software

• ANN

This page was built for publication: Implementation techniques for geometric branch-and-bound matching methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419487)