Semi-supervised hashing for scalable image retrieval

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

Volumn , Issue , 2010, Pages 3424-3431

  Wang, Jun ^a   Kumar, Sanjiv ^b   Chang, Shih Fu ^a  

^a Columbia University ^*  (United States)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL ERRORS; HASHING METHOD; IMAGE SEARCH; LABELED AND UNLABELED DATA; LABELED DATA; LARGE DATASETS; METRIC DISTANCES; OVERFITTING; SEMANTIC SIMILARITY; SEMI-SUPERVISED; UNSUPERVISED METHOD;

COMPUTER VISION; IMAGE RETRIEVAL; OPTIMIZATION; SEMANTICS;

COMPUTATIONAL METHODS;

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

References (17)

1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of ACM, 45(6):891-923, 1998.
2. M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the twentieth annual Symposium on Computational Geometry, pages 253-262. ACM, 2004.
3. J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw., 3(3):209-226, 1977.
4. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In Proc. of 25th VLDB, 1999.
5. J. Goldberger, S. Roweis, G. Hinton, and R. Salakhutdinov. Neighbourhood components analysis. In Proc. of NIPS, volume 17, pages 513-520. 2005.
6. G. Hinton and R. Salakhutdinov. Reducing the dimensionality of data with neural networks. Science, 313(5786):504, 2006.
7. P. Jain, B. Kulis, and K. Grauman. Fast image search for learned metrics. In Proc. of the CVPR, pages 1-8, 2008.
8. B. Kulis and T. Darrell. Learning to Hash with Binary Reconstructive Embeddings. In Proc. of NIPS, volume 20, pages 1042-1050. 2009.
9. B. Kulis and K. Grauman. Kernelized locality-sensitive hashing for scalable image search. Proc. of ICCV, 2009.
10. N. Kumar, L. Zhang, and S. Nayar. What is a good nearest neighbors algorithm for finding similar patches in images? In ECCV, pages 364-378, 2008.
11. M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In VISAPP, 2009.
12. G. Shakhnarovich, T. Darrell, and P. Indyk. Nearest- Neighbor Methods in Learning and Vision: Theory and Practice (Neural Information Processing). The MIT Press, 2006.
13. G. Shakhnarovich, P. Viola, and T. Darrell. Fast pose estimation with parameter-sensitive hashing. In Proc. of the ICCV, 2003.
14. C. Silpa-Anan and R. Hartley. Optimised kd-trees for fast image descriptor matching. In CVPR, pages 1-8, 2008.
15. A. Torralba, R. Fergus, W. Freeman, and C. MIT. 80 million tiny images: A large data set for nonparametric object and scene recognition. IEEE Trans. on PAMI, 30(11):1958- 1970, 2008.
16. A. Torralba, R. Fergus, and Y. Weiss. Small codes and large image databases for recognition. In Proc. of CVPR, pages 1-8, 2008.
17. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In Proc. of NIPS, volume 21, pages 1753-1760. 2008.