A prior-free weighting scheme for binary code ranking

IEEE Transactions on Multimedia

Volumn 16, Issue 4, 2014, Pages 1127-1139

  Zhang, Yongdong ^a   Zhang, Lei ^a   Tian, Qi ^b  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^b UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

Binary hashing; data adaptive and query sensitive weighting; similarity search; weighted Hamming distance

Indexed keywords

CLUSTERING ALGORITHMS;

BINARY HASHING; DATA-ADAPTIVE AND QUERY-SENSITIVE WEIGHTING; HIGH DIMENSIONAL DATA; LARGE-SCALE IMAGE DATASETS; RANKING ALGORITHM; SIMILARITY METRICS; SIMILARITY SEARCH; WEIGHTED HAMMING DISTANCES;

HAMMING DISTANCE;

EID: 84901063974     PISSN: 15209210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMM.2014.2306392     Document Type: Article

References (39)

1. J. L. Bentley and B. Labo, "K-d trees for semidynamic point sets," inProc. SOCG, 1990, pp. 187-197.
2. C. Silpa-anan and R. Hartley, "Optimised kd-trees for fast image descriptormatching," in Proc. CVPR, 2008, pp. 1-8.
3. A. Andoni and P. Indyk, "Near-optimal hashing algorithms for approximatenearest neighbor in high dimensions," in Proc. FOCS, 2006, pp.459-468. (Pubitemid 351175534)
4. X. Gu, L. Zhang, Y. Zhang, D. Zhang, and J. Li, "An improved methodof locality sensitive hashing for indexing large-scale and high-dimensionalfeatures," Signal Process., vol. 93, no. 8, pp. 2244-2255, 2013.
5. X. Wang, L. Zhang, F. Jing, and W. Ma, "AnnoSearch: Image autoannotationby search," in Proc. CVPR, 2006.
6. R. Salakhutdinov and G. E. Hinton, "Semantic hashing," Int. J. Approx.Reason., vol. 50, pp. 969-978, 2009.
7. Y. Weiss, A. B. Torralba, and R. Fergus, "Spectral hashing," in Proc.NIPS, 2008, pp. 1753-1760.
8. B. Kulis and T. Darrell, "Learning to hash with binary reconstructiveembeddings," in Proc. NIPS, 2009, pp. 1042-1050.
9. Y. Gong, S. Lazebnik, A. Gordo, and F. Perronnin, "Iterative quantization:A procrustean approach to learning binary codes for large-scaleimage retrieval," IEEE Trans. Pattern Anal. Mach. Intell, vol. 35, no.12, pp. 2916-2929, Dec. 2012.
10. M. Norouzi and D. J. Fleet, "Minimal loss hashing for compact binarycodes," in Proc. ICML, 2011, pp. 353-360.
11. W. Liu, J.Wang, R. Ji, Y. Jiang, and S.-F. Chang, "Supervised hashingwith kernels," in Proc. CVPR, 2012, pp. 2074-2081.
12. J. Wang, S. Kumar, and S.-F. Chang, "Semi-supervised hashing forlarge-scale search," IEEE Trans. Pattern Anal. Mach. Intell., vol. 34,no. 12, pp. 2393-2406, Dec. 2012.
13. P. Li, M. Wang, J. Cheng, C. Xu, and H. Lu, "Spectral hashing withsemantically consistent graph for image indexing," IEEE Trans. Multimedia,vol. 15, no. 1, pp. 141-152, 2013.
14. L. Zhang, Y. Zhang, J. Tang, K. Lu, and Q. Tian, "Binary coderanking with weighted hamming distance," in Proc. CVPR, 2013, pp.1586-1593.
15. R. Weber, H.-J. Schek, and S. Blott, "A quantitative analysis andperformance study for similarity-search methods in high-dimensionalspaces, " in Proc. VLDB, 1998, pp. 194-205.
16. D. G. Lowe, "Distinctive image features from scale-invariant keypoints,"Int. J. Comput. Vision, vol. 60, pp. 91-110, 2004.
17. A. Oliva and A. B. Torralba, "Modeling the shape of the scene: Aholistic representation of the spatial envelope," Int. J. Comput. Vision,vol. 42, pp. 145-175, 2001. (Pubitemid 32680801)
18. A. Gionis, P. Indyk, and R. Motwani et al., "Similarity search in highdimensions via hashing," in Proc. VLDB, 1999, pp. 518-529.
19. B. Stein, "Principles of hash-based text retrieval," in Proc. ACMSIGIR,2007, pp. 527-534. (Pubitemid 350165001)
20. H. Jégou, M. Douze, and C. Schmid, "Improving bag-of-features forlarge scale image search," Int. J. Comput. Vision, vol. 87, pp. 316-336,2010.
21. W. Zhou, Y. Lu, H. Li, Y. Song, and Q. Tian, "Spatial coding for largescale partial-duplicate web image search," in Proc. ACM Multimedia,2010, pp. 511-520.
22. H. Jégou, M. Douze, and C. Schmid, "Product quantization for nearestneighbor search," IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, pp.117-128, 2011.
23. W. Zhou, Y. Lu, H. Li, and Q. Tian, "Scalar quantization for large scaleimage search," in Proc. ACM Multimedia, 2012, pp. 169-178.
24. L. Qin, W. Josephson, Z. Wang, M. Charikar, and K. Li, "Multiprobelsh: Efficient indexing for high-dimensional similarity search," in Proc.VLDB, 2007, pp. 950-961.
25. J. Ji, J. Li, S. Yan, B. Zhang, and Q. Tian, "Super-bit locality-sensitivehashing," in Proc. NIPS, 2012, pp. 108-116.
26. M. Raginsky and S. Lazebnik, "Locality-sensitive binary codes fromshift-invariant kernels," in Proc. NIPS, 2009, pp. 1509-1517.
27. L. Zhang, Y. Zhang, J. Tang, X. Gu, J. Li, and Q. Tian, "Topologypreserving hashing for similarity search," in Proc. ACM Multimedia,2013, pp. 123-132.
28. Y. Weiss, R. Fergus, and A. Torralba, "Multidimensional spectralhashing," in Proc. ECCV, 2012, pp. 340-353.
29. W. Liu, J. Wang, S. Kumar, and S.-F. Chang, "Hashing with graphs,"in Proc. ICML, 2011, pp. 1-8.
30. B. Kulis and K. Grauman, "Kernelized locality-sensitive hashing,"IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, pp. 1092-1104, 2012.
31. J. Wang, S. Kumar, and S.-F. Chang, "Sequential projection learningfor hashing with compact codes," in Proc. ICML, 2010, pp. 1127-1134.
32. C. Strecha, A. M. Bronstein, M. M. Bronstein, and P. Fua, "LDAHash:Improved matching with smaller descriptors," IEEE Trans. PatternAnal. Mach. Intell., vol. 34, no. 1, pp. 66-78, 2012.
33. J. Song, Y. Yang, Z. Huang, H. T. Shen, and R. Hong, "Multiple featurehashing for real-time large scale near-duplicate video retrieval," inProc. ACM Multimedia, 2011, pp. 423-432.
34. Y. Zhen and D.-Y. Yeung, "A probabilistic model for multimodal hashfunction learning," in Proc. ACM SIGKDD, 2012, pp. 940-948.
35. X. Li, G. Lin, C. Shen, A. van den Hengel, and A. Dick, "Learninghash functions using column generation," in Proc. ICML, 2013.
36. Y. Jiang, J.Wang, and S.-F. Chang, "Lost in binarization: Query-adaptiveranking for similar image search with compact codes," in Proc.Int. Conf. Multimedia Retrieval, 2011.
37. Y. Jiang, J. Wang, X. Xue, and S.-F. Chang, "Query-adaptive imagesearch with hash codes," IEEE Trans. Multimedia, vol. 15, no. 2, pp.442-453, 2013.
38. L. Zhang, X. Zhang, and H.-Y. Shum, "QsRank: Query-sensitive hashcode ranking for efficient-neighbor search," in Proc. CVPR, 2012, pp.2058-2065.
39. Intel Corporation, Intel 64 and IA-32 Architectures Software Developer'sManual, 2009, vol. 1-3, no. 253665-030US.