Fast approximate k-means via cluster closures

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2012, Pages 3037-3044

  Wang, Jing ^a   Wang, Jingdong ^b   Ke, Qifa ^c   Zeng, Gang ^a   Li, Shipeng ^b  

^a PEKING UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ASSIGNMENT; CLUSTER BOUNDARIES; CLUSTER CENTERS; CLUSTERING QUALITY; COMPLEXITY ANALYSIS; DATA CLUSTERING; DATA POINTS; ITERATIVE ALGORITHM; K-MEANS; K-MEANS ALGORITHM; NEIGHBORHOOD INFORMATION; NEIGHBORING POINT; NUMBER OF CLUSTERS; NUMBER OF DATUM; SPATIAL PARTITION TREE; VISION COMMUNITIES;

CLUSTERING ALGORITHMS; ITERATIVE METHODS; TREES (MATHEMATICS);

COMPUTER VISION;

EID: 84866640887     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2012.6248034     Document Type: Conference Paper

References (25)

1. C. Boutsidis, A. Zouzias, and P. Drineas. Random projections for k-means clustering. CoRR, abs/1011.4632, 2010. 2
2. O. Chum and J.Matas. Large-scale discovery of spatially related images. IEEE PAMI, 32(2):371-377, 2010. 2
3. C. Elkan. Using the triangle inequality to accelerate k-means. In ICML, 2003. 2
4. L. Fei-Fei, R. Fergus, and P. Perona. Learning generative visual models from few training examples: an incremental bayesian approach tested on 101 object categories. In CVPR Workshop on Generative-Model Based Vision, 2004. 5
5. X. Z. Fern and C. E. Brodley. Random projection for high dimensional data clustering: A cluster ensemble approach. In ICML, pages 186-193, 2003. 2
6. E. W. Forgy. Cluster analysis of multivariate data: Efficiency versus interpretability of classifications. Biometrics, 21:768-780, 1965. 1, 3
7. G. Frahling and C. Sohler. A fast k-means implementation using coresets. Int. J. Comput. Geometry Appl., 18(6):605-625, 2008. 2
8. H. Jégou, M. Douze, and C. Schmid. Product quantization for nearest neighbor search. IEEE PAMI, 33(1):117-128, 2011. 2
9. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu. An efficient k-means clustering algorithm: Analysis and implementation. IEEE PAMI, 24(7):881-892, 2002. 2
10. X. Li, C.Wu, C. Zach, S. Lazebnik, and J.-M. Frahm. Modeling and recognition of landmark image collections using iconic scene graphs. In ECCV, 2008. 2
11. S. P. Lloyd. Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2):129-137, March 1982. 1, 3
12. J. B. MacQueen. Some methods for classification and analysis of multivariate observations. In Proc. of 5th Berkeley Symposium on Mathematical Statistics and Probability, volume 1, pages 281-297, 1967. 1, 3
13. M. Mahajan, P. Nimbhorkar, and K. R. Varadarajan. The planar k-means problem is np-hard. In WALCOM, pages 274-285, 2009. 3
14. A. McCallum, K. Nigam, and L. H. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In KDD, 2000. 2
15. M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In VISSAPP (1), pages 331-340, 2009. 6
16. D. Nistér and H. Stewénius. Scalable recognition with a vocabulary tree. In CVPR, 2006. 1, 5, 7
17. J. Philbin. Scalable Object Retrieval in Very Large Image Collections. PhD thesis, University of Oxford, 2010. 1, 7
18. J. Philbin, O. Chum, M. Isard, J. Sivic, and A. Zisserman. Object retrieval with large vocabularies and fast spatial matching. In CVPR, 2007. 1, 2, 3, 5, 6, 7, 8
19. J. Philbin and A. Zisserman. Object mining using a matching graph on very large image collections. In ICVGIP, pages 738-745, 2008. 2
20. R. Raguram, C. Wu, J.-M. Frahm, and S. Lazebnik. Modeling and recognition of landmark image collections using iconic scene graphs. IJCV, 95(3):213-239, 2011. 2
21. D. Sculley. Web-scale k-means clustering. In WWW, 2010. 2
22. I. Simon, N. Snavely, and S. M. Seitz. Scene summarization for online image collections. In ICCV, pages 1-8, 2007. 2
23. J. Sivic and A. Zisserman. Video google: A text retrieval approach to object matching in videos. In ICCV, pages 1470-1477, 2003. 1
24. A. B. Torralba, R. Fergus, and W. T. Freeman. 80 million tiny images: A large data set for nonparametric object and scene recognition. IEEE PAMI, 30(11):1958-1970, 2008. 5
25. N. Verma, S. Kpotufe, and S. Dasgupta. Which spatial partition trees are adaptive to intrinsic dimension? In Proc. 25th Conf. on Uncertainty in Artificial Intelligence, 2009. 2, 4