Web-scale image clustering revisited

Abstract : Large scale duplicate detection, clustering and mining of documents or images has been conventionally treated with seed detection via hashing, followed by seed growing heuristics using fast search. Principled clustering methods , especially kernelized and spectral ones, have higher complexity and are difficult to scale above millions. Under the assumption of documents or images embedded in Eu-clidean space, we revisit recent advances in approximate k-means variants, and borrow their best ingredients to introduce a new one, inverted-quantized k-means (IQ-means). Key underlying concepts are quantization of data points and multi-index based inverted search from centroids to cells. Its quantization is a form of hashing and analogous to seed detection, while its updates are analogous to seed growing, yet principled in the sense of distortion minimization. We further design a dynamic variant that is able to determine the number of clusters k in a single run at nearly zero additional cost. Combined with powerful deep learned representations , we achieve clustering of a 100 million image collection on a single machine in less than one hour.
Liste complète des métadonnées

https://hal.inria.fr/hal-01990662
Contributor : Ioannis Emiris <>
Submitted on : Wednesday, January 23, 2019 - 12:21:19 PM
Last modification on : Thursday, February 7, 2019 - 3:40:50 PM

File

Avrithis_Web-Scale_Image_Clust...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01990662, version 1

Citation

Ioannis Z. Emiris, Yannis Avrithis, Yannis Kalantidis, Evangelos Anagnostopoulos. Web-scale image clustering revisited. ICCV 2015 - International Conference on Computer Vision, Dec 2015, Santiago, Chile. 〈hal-01990662〉

Share

Metrics

Record views

32

Files downloads

21