Balancing clusters to reduce response time variability in large scale image search

Romain Tavenard 1 Hervé Jégou 1 Laurent Amsaleg 1
1 TEXMEX - Multimedia content-based indexing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Many algorithms for approximate nearest neighbor search in high-dimensional spaces partition the data into clusters. At query time, for efficiency, an index selects the few (or a single) clusters nearest to the query point. Clusters are often produced by the well-known k-means approach since it has several desirable properties. On the downside, it tends to produce clusters having quite different cardinalities. Imbalanced clusters negatively impact both the variance and the expectation of query response times. This paper proposes to modify k-means centroids to produce clusters with more comparable sizes without sacrificing the desirable properties. Experiments with a large scale collection of image descriptors show that our algorithm significantly reduces the variance of response times without severely impacting the search quality.
Complete list of metadatas

Cited literature [1 references]  Display  Hide  Download


https://hal.inria.fr/inria-00576886
Contributor : Hervé Jégou <>
Submitted on : Friday, June 17, 2011 - 10:36:05 AM
Last modification on : Friday, November 16, 2018 - 1:30:42 AM
Long-term archiving on : Monday, December 5, 2016 - 4:23:40 AM

Identifiers

  • HAL Id : inria-00576886, version 2

Citation

Romain Tavenard, Hervé Jégou, Laurent Amsaleg. Balancing clusters to reduce response time variability in large scale image search. International Workshop on Content-Based Multimedia Indexing (CBMI 2011), Jun 2011, Madrid, Spain. ⟨inria-00576886v2⟩

Share

Metrics

Record views

696

Files downloads

375