Supervised Hashing Using Graph Cuts and Boosted Decision Trees

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 37, Issue 11, 2015, Pages 2317-2331

  Lin, Guosheng ^a,b   Shen, Chunhua ^a,b   Van Den Hengel, Anton ^a,b  

^a UNIVERSITY OF ADELAIDE   (Australia)

^b AUSTRALIAN CENTRE FOR ROBOTIC VISION   (Australia)

Author keywords

binary codes; decision trees; graph cuts; Hashing; image retrieval; nearest neighbour search

Indexed keywords

BINARY CODES; BINS; CLUSTERING ALGORITHMS; CODES (SYMBOLS); DECISION TREES; FORESTRY; GRAPHIC METHODS; HASH FUNCTIONS; IMAGE RETRIEVAL; NEAREST NEIGHBOR SEARCH; OPTIMIZATION; SEARCH ENGINES; TREES (MATHEMATICS);

BOOSTED DECISION TREES; COMPLEX OPTIMIZATION PROBLEMS; GRAPH CUT; HASHING; HIGH DIMENSIONAL DATA; IMAGE RETRIEVAL SYSTEMS; NEAREST NEIGHBOUR SEARCH; STATE-OF-THE-ART METHODS;

BINARY TREES;

EID: 84960485177     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2015.2404776     Document Type: Article

References (48)

1. A. Torralba, R. Fergus, and W. Freeman, "80 million tiny images: A large data set for nonparametric object and scene recognition," IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 11, pp. 1958-1970, Nov. 2008.
2. J. Wang, S. Kumar, and S. Chang, "Semi-supervised hashing for large scale search," IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 12, pp. 2393-2406, Dec. 2012.
3. C. Strecha, A. Bronstein, M. Bronstein, and P. Fua, "LDAhash: Improved matching with smaller descriptors," IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 1, pp. 66-78, Jan. 2012.
4. T. Dean, M. A. Ruzon, M. Segal, J. Shlens, S. Vijayanarasimhan, and J. Yagnik, "Fast, accurate detection of 100,000 object classes on a single machine," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2013, pp. 1814-1821.
5. M. Norouzi and D. Fleet, "Minimal loss hashing for compact binary codes," in Proc. Int. Conf. Mach. Learn., 2011, pp. 353-360.
6. Y. Gong, S. Lazebnik, A. Gordo, and F. Perronnin, "Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval," IEEE Trans. Pattern Anal. Mach. Intell., vol. 35, no. 12, pp. 2916-2929, Dec. 2012.
7. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in Proc. Int. Conf. Very Large Data Bases, 1999, pp. 518-529.
8. W. Liu, J. Wang, R. Ji, Y. Jiang, and S. Chang, "Supervised hashing with kernels," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2012, pp. 2074-2081.
9. Y. Weiss, A. Torralba, and R. Fergus, "Spectral hashing," in Proc. Adv. Neural Info. Process. Syst., 2008, pp. 1753-1760.
10. Y. Weiss, R. Fergus, and A. Torralba, "Multidimensional spectral hashing," in Proc. Eur. Conf. Comput. Vis., 2012, pp. 340-353.
11. B. Kulis and T. Darrell, "Learning to hash with binary reconstructive embeddings," in Proc. Adv. Neural Inf. Process. Syst., 2009, pp. 1042-1050.
12. A. Coates and A. Ng, "The importance of encoding versus training with sparse coding and vector quantization," in Proc. Int. Conf. Mach. Learn., 2011, pp. 921-928.
13. A. Krizhevsky, I. Sutskever, and G. E. Hinton, "Imagenet classification with deep convolutional neural networks," in Proc. Adv. Neural Info. Process. Syst., 2012, pp. 1106-1114.
14. Y. Boykov, O. Veksler, and R. Zabih, "Fast approximate energy minimization via graph cuts," IEEE Trans. Pattern Anal. Mach. Intell., vol. 23, no. 11, pp. 1222-1239, Nov. 2001.
15. K. He, F. Wen, and J. Sun, "K-means hashing: An affinity-preserving quantization method for learning binary compact codes," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2013, pp. 2938-2945.
16. W. Liu, J. Wang, S. Kumar, and S. F. Chang, "Hashing with graphs," in Proc. Int. Conf. Mach. Learn., 2011, pp. 1-8.
17. J.-P. Heo, Y. Lee, J. He, S.-F. Chang, and S.-E. Yoon, "Spherical hashing," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2012, pp. 2957-2964.
18. F. Shen, C. Shen, Q. Shi, A. van den Hengel, and Z. Tang, "Inductive hashing on manifolds," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2013, pp. 1562-1569.
19. R. Salakhutdinov and G. E. Hinton, "Learning a nonlinear embedding by preserving class neighbourhood structure," in Proc. Int. Conf. Artif. Intell. Statist., 2007, pp. 412-419.
20. D. Zhang, J. Wang, D. Cai, and J. Lu, "Extensions to self-taught hashing: Kernelisation and supervision," in Proc. ACM SIGIR Workshop Feature Gener. Select. Inf. Retrieval, 2010, p. 38.
21. X. Li, G. Lin, C. Shen, A. v. d. Hengel, and A. Dick, "Learning hash functions using column generation," in Proc. Int. Conf. Mach. Learn., 2013, pp. 142-150.
22. G. Lin, C. Shen, and J. Wu, "Optimizing ranking measures for compact binary code learning," in Proc. Eur. Conf. Comput. Vis., 2014, pp. 613-627.
23. G. Lin, C. Shen, D. Suter, and A. van den Hengel, "A general twostep approach to learning-based hashing," in Proc. Int. Conf. Comput. Vis., 2013, pp. 2552-2559.
24. G. Lin, C. Shen, Q. Shi, A. van den Hengel, and D. Suter, "Fast supervised hashing with decision trees for high-dimensional data," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2014, pp. 1963-1970.
25. B. Kulis and K. Grauman, "Kernelized locality-sensitive hashing," IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 6, pp. 1092-1104, Jun. 2012.
26. D. Zhang, J. Wang, D. Cai, and J. Lu, "Self-taught hashing for fast similarity search," in Proc. Annu. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2010, pp. 18-25.
27. M. Norouzi, D. M. Blei, and R. Salakhutdinov, "Hamming distance metric learning," in Proc. Adv. Neural Inf. Process. Syst., 2012, pp. 1070-1078.
28. Y. Gong, S. Kumar, V. Verma, and S. Lazebnik, "Angular quantization-based binary codes for fast similarity search," in Proc. Adv. Neural Inf. Process. Syst., 2012, pp. 1205-1213.
29. M. A. and C. Perpinan, "The elastic embedding algorithm for dimensionality reduction," in Proc. Int. Conf. Mach. Learn., 2010, pp. 167-174.
30. Z. Li, H. Ning, L. Cao, T. Zhang, Y. Gong, and T. S. Huang, "Learning to search efficiently in high dimensions," in Proc. Adv. Neural Inf. Process. Syst., 2011, pp. 1710-1718.
31. D. Nister and H. Stewenius, "Scalable recognition with a vocabulary tree," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2006, pp. 2161-2168.
32. J. Philbin, O. Chum, M. Isard, J. Sivic, and A. Zisserman, "Object retrieval with large vocabularies and fast spatial matching," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2007, pp. 1-8.
33. C. Zhu, R. H. Byrd, P. Lu, and J. Nocedal, "Algorithm 778: LBFGS-B: Fortran subroutines for large-scale bound-constrained optimization," ACM Trans. Math. Softw., vol. 23, pp. 550-560, 1997.
34. C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer, "Optimizing binary MRFs via extended roof duality," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2007, pp. 1-8.
35. J. Besag, "On the statistical analysis of dirty pictures," J. Roy. Stat. Soc., vol. 48, pp. 259-302, 1986.
36. M. Schmidt. (2012). UGM: Matlab code for undirected graphical models.
37. Z. Wang, K. Crammer, and S. Vucetic, "Breaking the curse of kernelization: Budgeted stochastic gradient descent for large-scale svm training," J. Mach. Learn. Res., vol. 13, pp. 3103-3131, 2012.
38. R. Appel, T. Fuchs, P. Dollar, and P. Perona, "Quickly boosting decision trees-pruning underachieving features early," in Proc. Int. Conf. Mach. Learn., 2013, pp. 594-602.
39. J. Friedman, T. Hastie, and R. Tibshirani, "Additive logistic regression: A statistical view of boosting (with discussion and a rejoinder by the authors)," Ann. Statist., vol. 28, pp. 337-407, 2000.
40. A. Torralba, R. Fergus, and Y. Weiss, "Small codes and large image databases for recognition," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2008, pp. 1-8.
41. M. Guillaumin, T. Mensink, J. Verbeek, and C. Schmid, "Tagprop: Discriminative metric learning in nearest neighbor models for image auto-annotation," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2009, pp. 309-316.
42. M. J. Huiskes and M. S. Lew, "The MIR-Flickr retrieval evaluation," in Proc. ACM Int. Conf. Multimedia Inf. Retrieval, 2008, pp. 39-43.
43. J. Xiao, J. Hays, K. A. Ehinger, A. Oliva, and A. Torralba, "SUN database: Large-scale scene recognition from abbey to zoo," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2010, pp. 3485-3492.
44. J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei, "ImageNet: A large-scale hierarchical image database," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2009, pp. 248-255.
45. R. Kiros and C. Szepesvari, "Deep representations and codes for image auto-annotation," in Proc. Adv. Neural Inf. Process. Syst., 2012, pp. 908-916.
46. A. Oliva and A. Torralba, "Modeling the shape of the scene: A holistic representation of the spatial envelope," Int. J. Comput. Vis., vol. 42, pp. 145-175, 2001.
47. J. Donahue, Y. Jia, O. Vinyals, J. Hoffman, N. Zhang, E. Tzeng, and T. Darrell, "Decaf: A deep convolutional activation feature for generic visual recognition," in Proc. Int. Conf. Mach. Learn., 2014, pp. 647-655.
48. Y. Jia, "Caffe: An open source convolutional architecture for fast feature embedding," Berkeley Vis. Learn. Center, Berkeley, CA, USA, Tech. Rep. arXiv preprint arXiv:1408.5093, 2013.