inria-00633013, version 1
Aggregating local image descriptors into compact codes
Hervé Jégou
1Florent Perronnin a, 2Matthijs Douze
c, 3, 4Jorge Sánchez 2Patrick Pérez b, 5Cordelia Schmid
c, 3
IEEE Transactions on Pattern Analysis and Machine Intelligence (2011)
Abstract: This paper addresses the problem of large-scale image search. Three constraints have to be taken into account: search accuracy, efficiency, and memory usage. We first present and evaluate different ways of aggregating local image descriptors into a vector and show that the Fisher kernel achieves better performance than the reference bag-of-visual words approach for any given vector dimension. We then jointly optimize dimensionality reduction and indexing in order to obtain a precise vector comparison as well as a compact representation. The evaluation shows that the image representation can be reduced to a few dozen bytes while preserving high accuracy. Searching a 100 million image dataset takes about 250 ms on one processor core.
- a – Xerox
- b – Technicolor
- c – INRIA
- 1: TEXMEX (INRIA - IRISA)
- CNRS : UMR6074 – INRIA – INSA Rennes – Université de Rennes 1
- 2: Xerox Research Centre Europe (XRCE)
- Xerox
- 3: LEAR (INRIA Grenoble Rhône-Alpes / LJK Laboratoire Jean Kuntzmann)
- CNRS : FR71 – CNRS : UMR5527 – INRIA – Laboratoire Jean Kuntzmann – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG)
- 4: Service Expérimentation et Développement (SED)
- INRIA
- 5: Technicolor R & I
- Technicolor
- Domain : Computer Science/Computer Vision and Pattern Recognition
- Keywords : image search – image retrieval – indexing
- inria-00633013, version 1
- http://hal.inria.fr/inria-00633013
- oai:hal.inria.fr:inria-00633013
- From: Hervé Jégou
- Submitted on: Monday, 17 October 2011 14:18:08
- Updated on: Friday, 18 November 2011 10:07:51







Associated documents
Export