Early burst detection for memory-efficient image retrieval - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Early burst detection for memory-efficient image retrieval


Recent works show that image comparison based on local descriptors is corrupted by visual bursts, which tend to dominate the image similarity. The existing strategies, like power-law normalization, improve the results by discounting the contribution of visual bursts to the image similarity. In this paper, we propose to explicitly detect the visual bursts in an image at an early stage. We compare several detection strategies jointly taking into account feature similarity and geometrical quantities. The bursty groups are merged into meta-features, which are used as input to state-of-the-art image search systems such as VLAD or the selective match kernel. Then, we show the interest of using this strategy in an asymmetrical manner, with only the database features being aggregated but not those of the query. Extensive experiments performed on public benchmarks for visual retrieval show the benefits of our method, which achieves performance on par with the state of the art but with a significantly reduced complexity, thanks to the lower number of features fed to the indexing system.
Fichier principal
Vignette du fichier
burst.pdf (3.71 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01146533 , version 1 (28-04-2015)


  • HAL Id : hal-01146533 , version 1


Miaojing Shi, Yannis Avrithis, Hervé Jégou. Early burst detection for memory-efficient image retrieval. Computer Vision and Pattern Recognition, Jun 2015, Boston, United States. ⟨hal-01146533⟩
359 View
375 Download


Gmail Facebook X LinkedIn More