Weakly-supervised hashing in kernel space

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

Volumn , Issue , 2010, Pages 3344-3351

  Mu, Yadong ^a   Shen, Jialie ^b   Yan, Shuicheng ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION PROBABILITY; DATA DISTRIBUTION; DATA INTERACTIONS; EMPIRICAL EVALUATIONS; EXPLOSIVE GROWTH; FEATURE REPRESENTATION; HASHING FUNCTIONS; HASHING METHOD; INDEXING METHODS; KERNEL SPACE; KERNEL TRICK; LARGE-SCALE PROBLEM; LINEAR FEATURE; LOCALITY SENSITIVE HASHING; MARKOV RANDOM FIELDS; ONE STEP; SUB-PROBLEMS; VISION DATA; VISION RESEARCH; VISUAL OBJECTS;

COMPUTER VISION; HASH FUNCTIONS; HILBERT SPACES; IMAGE SEGMENTATION; PROBABILITY DISTRIBUTIONS;

COMPUTATIONAL METHODS;

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

References (17)

1. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM, 51(1):117-122, 2008.
2. B. Babenko, S. Branson, and S. Belongie. Similarity functions for categorization: from monolithic to category specific. In ICCV, 2009.
3. J. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, 1975.
4. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, New York, NY, USA, 2004.
5. 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, 2004.
6. Y. Hu, J. Wang, N. Yu, and X. Hua. Maximum margin clustering with pairwise constraints. In ICDM, 2008.
7. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC, 1998.
8. P. Jain, B. Kulis, and K. Grauman. Fast image search for learned metrics. In CVPR, 2008.
9. B. Kulis and K. Grauman. Kernelized locality-sensitive hashing for scalable image search. In ICCV, 2009.
10. B. Schölkopf, R. Herbrich, and A. Smola. A generalized representer theorem. In COLT/EuroCOLT, pages 416-426, 2001.
11. B. Scholkopf and A. Smola. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, Cambridge, MA, USA, 2001.
12. G. Shakhnarovich, P. Viola, and T. Darrell. Fast pose estimation with parameter-sensitive hashing. In ICCV, 2003.
13. A. Torralba, R. Fergus, and Y. Weiss. Small codes and large image databases for recognition. In CVPR, 2008.
14. I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun. Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research, 6:1453-1484, 2005.
15. A. Vishwanathan, A. Smola, and S. Vishwanathan. Kernel methods for missing variables. In AISTAT, 2005.
16. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, 2008.
17. A. Yuille and A. Rangarajan. The concave-convex procedure. Neural Comput., 15(4):915-936, 2003.