Supervised binary hash code learning with jensen shannon divergence

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2013, Pages 2616-2623

  Fan, Lixin ^a  

^a NOKIA RESEARCH CENTER   (United States)

Author keywords

approximate nearest neighbor search; binary code; indexing; Jensen Shannon Divergence; matching; randomized tree

Indexed keywords

BINARY CODES; COMPUTER SCIENCE; COMPUTERS; ELECTRICAL ENGINEERING; INDEXING (OF INFORMATION);

APPROXIMATE NEAREST NEIGHBOR SEARCH; CONSISTENT PERFORMANCE; JENSEN-SHANNON DIVERGENCE; MATCHING; ORDERS OF MAGNITUDE; ORIGINAL ALGORITHMS; RANDOMIZED TREES; STATISTICAL LEARNING;

HASH FUNCTIONS;

EID: 84898806327     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2013.325     Document Type: Conference Paper

References (26)

1. A. Bosch, A. Zisserman, and X. Munoz. Image classification using random forests and ferns. In ICCV, 2007.
2. M. Calonder, V. Lepetit, C. Strecha, and P. Fua. Brief: binary robust independent elementary features. ECCV'10, 2010.
3. Y. Gong and S. Lazebnik. Iterative quantization: A procrustean approach to learning binary codes. CVPR '11, 2011.
4. Y. Gong, S. Lazebnik, A. Gordo, and F. Perronnin. Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence, 99:1, 2012.
5. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. STOC '98, 1998.
6. H. J́egou, M. Douze, C. Schmid, and P. Ṕerez. Aggregating local descriptors into a compact image representation. In IEEE Transactions on Pattern Analysis and Machine Intelligence.
7. B. Kulis and T. Darrell. Learning to hash with binary reconstructive embeddings. In NIPS, pages 1042-1050. 2009.
8. V. Lepetit, P. Lagger, and P. Fua. Randomized Trees for Real-Time Keypoint Recognition. In CVPR, 2005.
9. S. Leutenegger, M. Chli, and R. Siegwart. Brisk: Binary robust invariant scalable keypoints. In ICCV'11, pages 2548-2555, 2011.
10. X. Li, G. Lin, C. Shen, A. van den Hengel, and A. Dick. Learning hash functions using column generation. In International Conference on Machine Learning (ICML'13), Atlanta, USA, 2013.
11. J. Lin. Divergence measures based on the shannon entropy. IEEE Transactions on Information theory, 37:145-151, 1991.
12. W. Liu, J. Wang, R. Ji, Y.-G. Jiang, and S.-F. Chang. Supervised hashing with kernels. In CVPR, 2012.
13. M. Norouzi and D. J. Fleet. Minimal loss hashing for compact binary codes. In ICML, pages 353-360, 2011.
14. M. Norouzi, D. J. Fleet, and R. Salakhutdinov. Hamming distance metric learning. In NIPS, 2012.
15. A. Oliva and A. Torralba. Modeling the shape of the scene: A holistic representation of the spatial envelope. Int. J. Comput. Vision, 42(3):145-175, May 2001.
16. M. Ö zuysal,M. Calonder, V. Lepetit, and P. Fua. Fast keypoint recognition using random ferns. IEEE Trans. Pattern Anal. Mach. Intell., 32(3):448-461, 2010.
17. E. Rublee, V. Rabaud, K. Konolige, and G. Bradski. Orb: An efficient alternative to sift or surf. In ICCV, 2011.
18. T. Sattler, B. Leibe, and L. Kobbelt. Fast image-based localization using direct 2d-to-3d matching. In ICCV, pages 667-674, 2011.
19. C. Strecha, A. M. Bronstein, M. M. Bronstein, and P. Fua. LDAHash: Improved Matching with Smaller Descriptors. IEEE Transactions on Pattern Analysis and Machine Intelligence, 34(1), 2012.
20. A. Torralba, R. Fergus, and Y. Weiss. Small codes and large image databases for recognition. In CVPR, 2008.
21. T. Trzcinski and V. Lepetit. Efficient Discriminative Projections for Compact Binary Descriptors. In ECCV, 2012.
22. P. A. Viola and M. J. Jones. Rapid object detection using a boosted cascade of simple features. In CVPR (1), pages 511-518, 2001.
23. J. Wang, S. Kumar, and S.-F. Chang. Semi-supervised hashing for scalable image retrieval. In CVPR, 2010.
24. J. Wang, S. Kumar, and S.-F. Chang. Sequential projection learning for hashing with compact codes. In ICML, 2010.
25. J. Wang, J. Wang, N. Yu, and S. Li. Order preserving hashing for approximate nearest neighbor search. In ACM, 2013.
26. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, pages 1753-1760, 2008.