Learning reconfigurable hashing for diverse semantics

Proceedings of the 1st ACM International Conference on Multimedia Retrieval, ICMR'11

Volumn , Issue , 2011, Pages

  Mu, Yadong ^a   Chen, Xiangyu ^a,b   Chua, Tat Seng ^a   Yan, Shuicheng ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

locality sensitive hashing; random anchor; reconfigurable hashing; Shannon entropy

Indexed keywords

COSINE SIMILARITY; DATA SETS; FEATURE SPACE; GENERIC METRICS; HASHING FUNCTIONS; INDEXING AND RETRIEVAL; JACCARD INDEX; LARGE-SCALE DATASETS; LOCAL CONSISTENCY; LOCALITY SENSITIVE HASHING; METRIC ADAPTATION; OVER-COMPLETE; RANDOM ANCHOR; RE-CONFIGURABLE; RECONFIGURABLE HASHING; RUNTIMES; SHANNON ENTROPY; VISION COMMUNITIES;

ALGORITHMS; COMPUTER VISION; CONTENT BASED RETRIEVAL; INDEXING (OF INFORMATION); LAKES; REUSABILITY;

SEMANTICS;

EID: 79959685512     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1991996.1992003     Document Type: Conference Paper

References (22)

1. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In FOCS, 2006.
2. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise independent permutations. Journal of Computer and System Sciences, pages 327-336, 1998.
3. M. Charikar. Similarity estimation techniques from rounding algorithms. In STOC, 2002.
4. M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In SCG, 2004.
5. W. Dong, Z. Wang, M. Charikar, and K. Li. Efficiently matching sets of features with random histograms. In ACM Multimedia, 2008.
6. K. Grauman and T. Darrell. The pyramid match kernel: Discriminative classification with sets of image features. In ICCV, 2005.
7. J. He, W. Liu, and S.-F. Chang. Scalable similarity search with optimized kernel hashing. In SIGKDD, 2010.
8. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC, 1998.
9. B. Kulis and K. Grauman. Kernelized locality-sensitive hashing for scalable image search. In ICCV, 2009.
10. F. Moosmann, E. Nowak, and F. Jurie. Randomized clustering forests for image classification. IEEE Transactions on PAMI, 30(9):1632-1646, 2008.
11. Y. Mu, J. Shen, and S. Yan. Weakly-supervised hashing in kernel space. In CVPR, 2010.
12. Y. Mu, J. Sun, T. X. Han, L. F. Cheong, and S. Yan. Randomized locality sensitive vocabularies for bag-of-features model. In ECCV, 2010.
13. E. Nowak, F. Jurie, and B. Triggs. Sampling strategies for bag-of-features image classification. In ECCV, 2006.
14. L. Paulevé, H. Jégou, and L. Amsaleg. Locality sensitive hashing: A comparison of hash function types and querying mechanisms. Pattern Recognition Letters, 31(11):1348-1358, 2010.
15. R. Salakhutdinov and G. Hinton. Semantic hashing. Int. J. Approx. Reasoning, 50(7):969-978, 2009.
16. B. Scholkopf and A. J. Smola. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, Cambridge, MA, USA, 2001.
17. F. Wang and C. Zhang. Feature extraction by maximizing the average neighborhood margin. In CVPR, 2007.
18. J. Wang, S. Kumar, and S.-F. Chang. Semi-supervised hashing for scalable image retrieval. In CVPR, 2010.
19. J. Wang, S. Kumar, and S.-F. Chang. Sequential projection learning for hashing with compact codes. In ICML, 2010.
20. M. Wang, Y. Song, and X.-S. Hua. Concept representation based video indexing. In SIGIR, 2009.
21. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, 2008.
22. E. P. Xing, A. Y. Ng, M. I. Jordan, and S. J. Russell. Distance metric learning with application to clustering with side-information. In NIPS, 2002.