Balancing clusters to reduce response time variability in large scale image search - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2010

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

Romain Tavenard
Laurent Amsaleg
Hervé Jégou
  • Function : Author
  • PersonId : 833473

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.
Fichier principal
Vignette du fichier
RR-7387.pdf (187.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00519490 , version 1 (21-09-2010)

Identifiers

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

Cite

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⟩
260 View
151 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More