Yannis Kalantidis, Philippe Weinzaepfel, Diane Larlus, Thomas Lucas
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Methods that combine local and global features have recently shown excellent performance on multiple challenging deep image retrieval benchmarks, but their use of local features raises at least two issues. First, these local features simply boil down to the localized map activations of a neural network, and hence can be extremely redundant. Second, they are typically trained with a global loss that only acts on top of an aggregation of local features; by contrast, testing is based on local feature matching, which creates a discrepancy between training and testing. In this paper, we propose a novel architecture for deep image retrieval, based solely on mid-level features that we call Super-features. These Super-features are constructed by an iterative attention module and constitute an ordered set in which each element focuses on a localized and discriminant image pattern. For training, they require only image labels. A contrastive loss operates directly at the level of Super-features and focuses on those that match across images. A second complementary loss encourages diversity. Experiments on common landmark retrieval benchmarks validate that Super-features substantially outperform state-of-the-art methods when using the same number of features, and only require a significantly smaller memory footprint to match their performance.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.13182")
get_code_for_paper("2201.13182")
have("2201.13182")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2201.13182.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2201.13182)
Connect an agent — have() is free.