| G. Tolias and Y. Avrithis |
| Speeded-up Relaxed Spatial Matching |
| International Conference on Computer Vision (ICCV), Barcelona, Spain, November 2011. |
|
ABSTRACT
|
| A wide range of properties and assumptions determine the most appropriate spatial matching model for an application, e.g. recognition, detection, registration, or large scale visual search. Most notably, these include discriminative power, geometric invariance, rigidity constraints, mapping constraints, assumptions made on the underlying features or descriptors and, of course, computational complexity. Having image retrieval in mind, we present a very simple model inspired by Hough voting in the transformation space, where votes arise from single feature correspondences. A relaxed matching process allows for multiple matching surfaces or non-rigid objects under one-to-one mapping, yet is linear in the number of correspondences. We apply it to geometry re-ranking in a search engine, yielding superior performance with the same space requirements but a dramatic speed-up compared to the state of the art.
|
| 08 November , 2011 |
| G. Tolias and Y. Avrithis, "Speeded-up Relaxed Spatial Matching", International Conference on Computer Vision (ICCV), Barcelona, Spain, November 2011. |
[
BibTex] [
Print] [
 Back] |
