Skip to Main content Skip to Navigation

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

Romain Tavenard 1 Laurent Amsaleg 1 Hervé Jégou 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, in order to avoid exhaustive search, 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 seriously impacting the search quality.
Document type :
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Romain Tavenard Connect in order to contact the contributor
Submitted on : Tuesday, September 21, 2010 - 9:48:31 AM
Last modification on : Thursday, January 20, 2022 - 4:18:38 PM
Long-term archiving on: : Thursday, June 30, 2011 - 1:29:19 PM


Files produced by the author(s)


  • HAL Id : inria-00519490, version 1
  • ARXIV : 1009.4739


Romain Tavenard, Laurent Amsaleg, Hervé Jégou. Balancing clusters to reduce response time variability in large scale image search. [Research Report] RR-7387, INRIA. 2010. ⟨inria-00519490⟩



Record views


Files downloads