The Community for Technology Leaders
Green Image
Issue No. 02 - February (2010 vol. 32)
ISSN: 0162-8828
pp: 371-377
Ondř;ej Chum , Czech Technical University, Prague
Jiř;í Matas , Czech Technical University, Prague
We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of pairs of images with spatial overlap, the so-called cluster seeds. The seeds are then used as visual queries to obtain clusters which are formed as transitive closures of sets of partially overlapping images that include the seed. We show that the probability of finding a seed for an image cluster rapidly increases with the size of the cluster. The properties and performance of the algorithm are demonstrated on data sets with 10^4, 10^5, and 5 \times 10^6 images. The speed of the method depends on the size of the database and the number of clusters. The first stage of seed generation is close to linear for databases sizes up to approximately 2^{34} \approx 10^{10} images. On a single 2.4 GHz PC, the clustering process took only 24 minutes for a standard database of more than 100,000 images, i.e., only 0.014 seconds per image.
minHash, image clustering, image retrieval, bag of words.

J. Matas and O. Chum, "Large-Scale Discovery of Spatially Related Images," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 32, no. , pp. 371-377, 2009.
90 ms
(Ver 3.3 (11022016))