A Comparison of Search Strategies for Geometric Branch and Bound Algorithms

Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transformation space and bounding the quality of match over each subdivision. No direct comparison of the major implementation strategies has been made so far, so it has been unclear what the relative performance of the different approaches is. This paper examines experimentally the relative performance of different implementation choices in the implementation of branch-and-bound algorithms for geometric matching: alternatives for the computation of upper bounds across a collection of features, and alternatives the order in which search nodes are expanded. Two major approaches to computing the bounds have been proposed: the matchlist based approach, and approaches based on point location data structures. A second issue that is addressed in the paper is the question of search strategy; branch-and-bound algorithms tradit...

• Type: Conference
• Year: 2002
• Where: ECCV
• Authors: Thomas M. Breuel
• Keywords: Approaches Outperform Point, Branch-and-bound Algorithms, Branch-and-bound Based Methods, Computer Vision, ECCV 2002, Geometric Matching, Location Based Approaches