Packing bag-of-features - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Packing bag-of-features


One of the main limitations of image search based on bag-of-features is the memory usage per image, limiting to a few million the size of the dataset that can be handled on a single machine in a reasonable response time. In this paper, we first show that these limitations can be somewhat reduced by using index compression. Then, we propose an image representation obtained by projecting bag-of-features histograms onto a set of predefined sparse projection functions, producing several image descriptors. Coupled with a proper indexing structure, an image is represented by a few hundred bytes. A distance expectation criterion is then used to rank the images. Our method is at least one order of magnitude faster than standard bag-of-features while providing excellent search quality.
Fichier principal
Vignette du fichier
jegou_packingbof.pdf (3.95 Mo) Télécharger le fichier
Vignette du fichier
indexing.png (25.81 Ko) Télécharger le fichier
poster_iccv_raster.pdf (11.76 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Format : Other

Dates and versions

inria-00394213 , version 1 (23-02-2011)



Hervé Jégou, Matthijs Douze, Cordelia Schmid. Packing bag-of-features. ICCV 2009 - 12th International Conference on Computer Vision, Sep 2009, Kyoto, Japan. pp.2357-2364, ⟨10.1109/ICCV.2009.5459419⟩. ⟨inria-00394213⟩
475 View
652 Download



Gmail Facebook X LinkedIn More