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

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

2010-09-21

arxiv.org/abs/1009.4739v1

Computer Science

Computer Vision and Pattern Recognition

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Balancing clusters to reduce response time variability in large scale image search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Balancing clusters to reduce response time variability in large scale image search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Balancing clusters to reduce response time variability in large scale image search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-698134