Location of Repository

Relaxed Matching Kernels For Robust Image Comparison

By Andrea Vedaldi and Stefano Soatto

Abstract

The popular bag-of-features representation for object recognition collects signatures of local image patches and discards spatial information. Some have recently attempted to at least partially overcome this limitation, for instance by “spatial pyramids ” and “proximity ” kernels. We introduce the general formalism of “relaxed matching kernels” (RMKs) that includes such approaches as special cases, allow us to derive useful general properties of these kernels, and to introduce new ones. As an example, we introduce a kernel based on matching graphs of features and one based on matching information-compressed features. We show that all RMKs are competitive and outperform in several cases recently published state-of-the-art results on standard datasets. However, we also show that a proper implementation of a baseline bag-of-features algorithm can be extremely competitive, and outperform the other methods in some cases. 1

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.183.8575
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://vision.ucla.edu/papers/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.