Large-scale robust visual codebook construction

MM'10 - Proceedings of the ACM Multimedia 2010 International Conference

Volumn , Issue , 2010, Pages 1183-1186

  Li, Darui ^a,b   Yang, Linjun ^b   Hua, Xian Sheng ^b   Zhang, Hong Jiang ^c  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b MICROSOFT RESEARCH ASIA   (China)

^c Microsoft Adv Tech Center   (China)

Author keywords

clustering; image retrieval; visual codebook

Indexed keywords

ADDITIONAL COSTS; APPROXIMATE NEAREST NEIGHBOR SEARCH; CLUSTERING; CODEBOOK CONSTRUCTIONS; CODEBOOKS; HIGH-PRECISION; IMAGE RETRIEVAL SYSTEMS; K-D TREE; K-MEANS; SCALE-UP;

ALGORITHMS; SCALABILITY; TREES (MATHEMATICS); VECTOR QUANTIZATION;

IMAGE RETRIEVAL;

EID: 78650967191     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1873951.1874182     Document Type: Conference Paper

References (9)

1. A. Jain. Data clustering: 50 years beyond K-means. PRL, 31(8):651-666, 2010.
2. D. Judd, P. McKinley, and A. Jain. Large-scale parallel data clustering. TPAMI, 20(8):871-876, 1998.
3. G. Kollios, D. Gunopulos, N. Koudas, and S. Berchtold. Efficient biased sampling for approximate clustering and outlier detection in large data sets. TKDE, pages 1170-1187, 2003.
4. S. P. Lloyd. Least squares quantization in pcm. TIT, 28:129-137, 1982.
5. D. G. Lowe. Object recognition from local scale-invariant features. In ICCV, 1999.
6. M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In VISAPP, 2009.
7. D. Nister and H. Stewenius. Scalable recognition with a vocabulary tree. In CVPR, 2006.
8. J. Philbin, M. Isard, J. Sivic, and A. Zisserman. Object retrieval with large vocabularies and fast spatial matching. In CVPR, 2007.
9. C. Silpa-Anan and R. Hartley. Optimised kd-trees for fast image descriptor matching. In CVPR, 2008.