Implementation techniques for geometric branch-and-bound matching methods

DOI10.1016/S1077-3142(03)00026-2zbMath1055.68091MaRDI QIDQ4419487

Thomas M. Breuel

Publication date: 13 August 2003

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

zbMATH Keywords

Global optimizationMaximum likelihoodBranch and boundGeometric matchingGaussian errorBounded errorVisual object recognition

Mathematics Subject Classification ID

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

Related Items (6)

Global optimization through rotation space search ⋮ Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments ⋮ Robust and optimal registration of image sets and structured scenes via sum-of-squares polynomials ⋮ 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

Uses Software

• ANN

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