Approximate Gaussian Mixtures for Large Scale Vocabularies

Oct 10, 2012
[Work published prior to Yahoo]

We introduce a clustering method that combines the flexibility of Gaussian mixtures with the scaling properties needed to construct visual vocabularies for image retrieval. It is a variant of expectation-maximization that can converge rapidly while dynamically estimating the number of components. We employ approximate nearest neighbor search to speed-up the E-step and exploit its iterative nature to make search incremental, boosting both speed and precision. We achieve superior performance in large scale retrieval, being as fast as the best known approximate k-means.

  • European Conference on Computer Vision (ECCV), Florence, Italy, October 2012.
  • Conference/Workshop Paper