Advertisement

Robust Supervised Hashing

  • Tongtong Yuan
  • Weihong Deng
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 662)

Abstract

Hashing methods on large scale image retrieval have been extensively in attention. These methods can be roughly categorized as supervised and unsupervised. Unsupervised hashing methods mainly search for a projection matrix of the original data to preserve the Euclidean distance similarity, while supervised hashing methods aim to preserve the label similarity. However, most hashing methods propose a complicated objective function and search for optimized or relaxed solutions. Some methods will consume much time to train a good binary code. This paper is not focusing on formulating a complex solution like the previous state-of-art methods. Contrarily, we firstly propose a simple objective function on supervised hashing as far as we have learned. And we devise a novel solution which uses a maximum and equal Hamming distance code to construct the label information. This method keeps a comparable accuracy with the state-of-the-art supervised hashing methods.

Keywords

Image retrieval Supervised hashing Hadamard code Hamming distance Robustness 

Notes

Acknowledgments

This work was partially sponsored by supported by the NSFC (National Natural Science Foundation of China) under Grant No. 61375031, No. 61573068, No. 61471048, and No.61273217, the Fundamental Research Funds for the Central Universities under Grant No. 2014ZD03-01, This work was also supported by Beijing Nova Program, CCF-Tencent Open Research Fund, and the Program for New Century Excellent Talents in University.

References

  1. 1.
    Wang, J., Kumar, S., Chang, S.-F.: Semi-supervised hashing for large scale search. IEEE TPAMI 34(12), 2393–2406 (2012)CrossRefGoogle Scholar
  2. 2.
    Kulis, B., Darrell, T.: Learning to hash with binary reconstructive embeddings. In: NIPS, vol. 22 (2009)Google Scholar
  3. 3.
    Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. ACM (2008)Google Scholar
  4. 4.
    Heo, J.-P., Lee, Y., He, J., Chang, S.-F., Eui Yoon, S.: Spherical Hashing. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 2957–2964 (2012)Google Scholar
  5. 5.
    Gong, Y., Lazebnik, S., Gordo, A., Perronnin, F.: Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval. IEEE TPAMI 35(12), 2916–2929 (2013)CrossRefGoogle Scholar
  6. 6.
    Jin, Z., Li, C., Lin, Y., Cai, D.: Density sensitive hashing. IEEE Trans. Cybern. PP(99), 1 (2013)Google Scholar
  7. 7.
    He, K., Wen, F., Sun, J.: K-means hashing: an affinity preserving quantization method for learning binary compact codes. In: CVPR (2013)Google Scholar
  8. 8.
    Shen, F., Shen, C., Liuand, W., Shen, H.: Supervised discrete hashing. In: CVPR (2015)Google Scholar
  9. 9.
    Torralba, A., Fergus, R., Weiss, Y.: Small codes and large databases for recognition. In: Proceedings of CVPR (2008)Google Scholar
  10. 10.
    Liu, W., Wang, J., Ji, R., Jiang, Y.-G., Chang, S.-F.: Supervised hashing with kernels. In: Proceedings of CVPR (2012)Google Scholar
  11. 11.
    Yang, S., Luo, P., Loy, C.C., Shum, K.W., Tang, X.: Deep representation learning with target coding. In: AAAI (2015)Google Scholar
  12. 12.
    Krizhevsky. Learning multiple layers of features from tiny images. Technical report, University of Toronto (2009)Google Scholar
  13. 13.
    Oliva, A., Torralba, A.: Modeling the shape of the scene: a holistic representation of the spatial envelope. IJCV 42, 145–175 (2001)CrossRefzbMATHGoogle Scholar
  14. 14.
    Lin, G., Shen, C., Suter, D., van den Hengel, A.: A general two-step approach to learning-based hashing. In: Proceedings of International Conference on Computer Vision (ICCV) (2013)Google Scholar
  15. 15.
    Shen, F., Shen, C., Shi, Q., van den Hengel, A., Tang, Z., Shen, H.T.: Hashing on nonlinear manifolds. IEEE TIP 24(6), 1839–1851 (2015)MathSciNetGoogle Scholar
  16. 16.
    Hadamard code. https://en.wikipedia.org/wiki/Hadamard_code. Accessed 20 May 2016
  17. 17.
    Hedayat, A., Wallis, W.D.: Hadamard matrices and their applications. Ann. Stat. 6, 1184–1238 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Langford, J., Beygelzimer, A.: Sensitive error correcting output codes. In: COLT (2005)Google Scholar
  19. 19.
    Li, W.J., Zhou, Z.H.: Learning to hash for big data: current status and future trends. Chin. Sci. Bull. 60, 485–490 (2015). doi: 10.1360/N972014-00841. (in Chinese)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2016

Authors and Affiliations

  1. 1.Beijing University of Posts and TelecommunicationsBeijingChina

Personalised recommendations