Sampling of images for efficient model-based vision

The problem of matching two planar sets of points in the presence of geometric uncertainty has important applications in pattern recognition, image understanding, and robotics. The first set of points corresponds to the “template.” The other set corresponds to the “image” that-possibly-contains one or more deformed versions of the “template” embedded in a cluttered image. Significant progress has been made on this problem and various polynomial-time algorithms have been proposed. We show how to sample the “image” in linear time, reducing the number of foreground points n by a factor of two-six (for commonly occurring images) without degrading the quality of the matching results. The direct consequence is a time-saving by a factor of 2^p-6^p for an O(n^p) matching algorithm. Our result applies to a fairly large class of available matching algorithms