Packing Bag-of-features

One of the main limitations of image search based on bag-of-features is the memory usage per image. Only a few million images can be handled on a single machine in reasonable response time. In this paper, we first evaluate how the memory usage is reduced by using lossless index compression. We then propose an approximate representation of bag-of-features obtained by projecting the corresponding histogram onto a set of pre-defined 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.

@InProceedings{JDS09b,
  author       = "Herv\'e J\'egou and Matthijs Douze and Cordelia Schmid",
  title        = "Packing Bag-of-features",
  booktitle    = "International Conference on Computer Vision",
  month        = "sep",
  year         = "2009",
  url          = "http://lear.inrialpes.fr/pubs/2009/JDS09b"
}