Similar image search with a tiny bag-of-delegates representation

MM 2012 - Proceedings of the 20th ACM International Conference on Multimedia

Volumn , Issue , 2012, Pages 885-888

  Tu, Weiwen ^a   Pan, Rong ^a   Wang, Jingdong ^b  

^a SUN YAT SEN UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

adaptive forward selection; bag of delegates; similar image search; spatial partition trees

Indexed keywords

BAG-OF-DELEGATES; FORWARD SELECTION; IMAGE DATABASE; INDEX IMAGE; INVERTED INDICES; LARGE IMAGE DATABASE; SEARCH ACCURACY; SEARCH PERFORMANCE; SIMILAR IMAGE; SPATIAL PARTITION TREE;

FORESTRY;

IMAGE RETRIEVAL;

ACCURACY; ADAPTIVE SYSTEMS; DATA BASES; EXPERIMENTATION; IMAGE ANALYSIS;

EID: 84871400243     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2393347.2396338     Document Type: Conference Paper

References (17)

1. J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, 1975.
2. S. Dasgupta and Y. Freund. Random projection trees and low dimensional manifolds. In STOC, pages 537-546, 2008.
3. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In Symposium on Computational Geometry, pages 253-262, 2004.
4. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci., 55(1):119-139, 1997.
5. B. Kulis, P. Jain, and K. Grauman. Fast similarity search for learned metrics. IEEE Trans. Pattern Anal. Mach. Intell., 31(12):2143-2157, 2009.
6. C. Lanczos. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. Journal of Research of the National Bureau of Standards, 45(4):255-282, 1950.
7. M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In VISAPP (1), pages 331-340, 2009.
8. D. Nistér and H. Stewénius. Scalable recognition with a vocabulary tree. In CVPR (2), pages 2161-2168, 2006.
9. J. Philbin, O. Chum, M. Isard, J. Sivic, and A. Zisserman. Object retrieval with large vocabularies and fast spatial matching. In CVPR, 2007.
10. R. F. Sproull. Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica, 6(4):579-589, 1991.
11. A. Torralba, R. Fergus, and W. T. Freeman. 80 million tiny images: A large data set for nonparametric object and scene recognition. IEEE Trans. Pattern Anal. Mach. Intell., 30(11):1958-1970, 2008.
12. N. Verma, S. Kpotufe, and S. Dasgupta. Which spatial partition trees are adaptive to intrinsic dimension? In UAI, pages 565-574, 2009.
13. J. Wang and S. Li. Query-driven iterated neighborhood graph search for large scale indexing. In ACM Multimedia, 2012.
14. J. Wang, J. Wang, X.-S. Hua, and S. Li. Scalable similar image search by joint indices. In ACM Multimedia, 2012.
15. J. Wang, J. Wang, G. Zeng, Z. Tu, R. Gan, and S. Li. Scalable k-nn graph construction for visual descriptors. In CVPR, pages 1106-1113, 2012.
16. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, pages 1753-1760, 2008.
17. H. Xu, J. Wang, Z. Li, G. Zeng, S. Li, and N. Yu. Complementary hashing for approximate nearest neighbor search. In ICCV, pages 1631-1638, 2011.