BIM: Ball intersection multi template matching

Abstract

BIM is a multi-template matching algorithm. As opposed to traditional template matching algorithms that match a single template to a single image, BIM attempts to match multiple templates to a single image at once. A naive approach to multi-template matching would be to run a standard template matching algorithm sequentially with each of the templates and report the best result. Instead, each template processed by BIM further restricts the search space of the following templates, thus speeding up the overall process. In particular, we extend a recently introduced method for single template matching under 2D affine transformation to work with multiple templates at once. As a result, given a library of templates we can efficiently find the best 2D affine transformation for each of them in a target image. Experiments on real data sets reveal speedups of between 10 and 17.