Optimal Geometric Matching for Patch-Based Object Detection
AbstractWe present an efficient method to determine the optimal matching of two patch-based image object representations under rotation, scaling, and translation (RST). This use of patches is equivalent to a fullyconnected part-based model, for which the presented approach offers an efficient procedure to determine the best fit. While other approaches that use fully connected models have a high complexity in the number of parts used, we achieve linear complexity in that variable, because we only allow RST-matchings. The presented approach is used for object recognition in images: by matching images that contain certain objects to a test image, we can detect whether the test image contains an object of that class or not. We evaluate this approach on the Caltech data and obtain very competitive results.
Keywordsobject recognition, registration and matching
Copyright (c) 2007 Daniel Keysers, Thomas Deselaers, Thomas M. Breuel
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.