Nothing Special   »   [go: up one dir, main page]

Skip to main content

Deep Graph Laplacian Hashing for Image Retrieval

  • Conference paper
  • First Online:
Advances in Multimedia Information Processing – PCM 2017 (PCM 2017)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10735))

Included in the following conference series:

Abstract

Due to the storage and retrieval efficiency, hashing has been widely deployed to approximate nearest neighbor search for fast image retrieval on large-scale datasets. It aims to map images to compact binary codes that approximately preserve the data relations in the Hamming space. However, most of existing approaches learn hashing functions using the hand-craft features, which cannot optimally capture the underlying semantic information of images. Inspired by the fast progress of deep learning techniques, in this paper we design a novel Deep Graph Laplacian Hashing (DGLH) method to simultaneously learn robust image features and hash functions in an unsupervised manner. Specifically, we devise a deep network architecture with graph Laplacian regularization to preserve the neighborhood structure in the learned Hamming space. At the top layer of the deep network, we minimize the quantization errors, and enforce the bits to be balanced and uncorrelated, which makes the learned hash codes more efficient. We further utilize back-propagation to optimize the parameters of the networks. It should be noted that our approach does not require labeled training data and is more practical to real-world applications in comparison to supervised hashing methods. Experimental results on three benchmark datasets demonstrate that DGLH can outperform the state-of-the-art unsupervised hashing methods in image retrieval tasks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 155.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117–122 (2008)

    Article  Google Scholar 

  2. Gong, Y., Lazebnik, S.: Iterative quantization: a procrustean approach to learning binary codes. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 817–824 (2011)

    Google Scholar 

  3. Huiskes, M.J., Lew, M.S.: The MIR Flickr retrieval evaluation. In: ACM International Conference on Multimedia Information Retrieval (2008)

    Google Scholar 

  4. Jiang, S., Song, X., Huang, Q.: Relative image similarity learning with contextual information for internet cross-media retrieval. Multimed. Syst. 20(6), 645–657 (2014)

    Article  Google Scholar 

  5. Krizhevsky, A., Hinton, G.: Learning multiple layers of features from tiny images. Technical report, University of Toronto (2009)

    Google Scholar 

  6. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. In: Advances in Neural Information Processing Systems, pp. 1097–1105 (2012)

    Google Scholar 

  7. Kulis, B., Darrell, T.: Learning to hash with binary reconstructive embeddings. In: Advances in Neural Information Processing Systems, pp. 1042–1050. Curran Associates Inc. (2009)

    Google Scholar 

  8. Lai, H., Pan, Y., Liu, Y., Yan, S.: Simultaneous feature learning and hash coding with deep neural networks. CoRR, abs/1504.03410 (2015)

    Google Scholar 

  9. Lee, Y.: Spherical hashing. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2957–2964 (2012)

    Google Scholar 

  10. Li, W., Wang, S., Kang, W.: Feature learning based deep supervised hashing with pairwise labels. CoRR, abs/1511.03855 (2015)

    Google Scholar 

  11. Lin, Y., Cai, D., Li, C.: Density sensitive hashing. CoRR, abs/1205.2930 (2012)

    Google Scholar 

  12. Liu, H., Ji, R., Wu, Y., Liu, W.: Towards optimal binary code learning via ordinal embedding. In: AAAI Conference on Artificial Intelligence, pp. 1258–1265 (2016)

    Google Scholar 

  13. Liu, W., Mu, C., Kumar, S., Chang, S.-F.: Discrete graph hashing. In: Advances in Neural Information Processing Systems, pp. 3419–3427 (2014)

    Google Scholar 

  14. Liu, W., Wang, J., Ji, R., Jiang, Y.-G., Chang, S.-F.: Supervised hashing with kernels. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2074–2081 (2012)

    Google Scholar 

  15. Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91–110 (2004)

    Article  Google Scholar 

  16. Nie, L., Yan, S., Wang, M., Hong, R., Chua, T.-S.: Harvesting visual concepts for image search with complex queries. In: ACM International Conference on Multimedia, pp. 59–68. ACM (2012)

    Google Scholar 

  17. Norouzi, M., Blei, D.M.: Minimal loss hashing for compact binary codes. In: International Conference on Machine Learning, pp. 353–360 (2011)

    Google Scholar 

  18. Oliva, A., Torralba, A.: Modeling the shape of the scene: a holistic representation of the spatial envelope. Int. J. Comput. Vis. 42(3), 145–175 (2001)

    Article  Google Scholar 

  19. Vedaldi, A., Lenc, K.: MatConvNet: Convolutional neural networks for MATLAB. In: ACM International Conference on Multimedia, pp. 689–692 (2015)

    Google Scholar 

  20. Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: a survey. CoRR, abs/1408.2927 (2014)

    Google Scholar 

  21. Wang, S., Jiang, S.: INSTRE: a new benchmark for instance-level object retrieval and recognition. ACM Trans. Multimed. Comput. Commun. Appl. 11(3), 37 (2015)

    Article  Google Scholar 

  22. Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: Advances in Neural Information Processing Systems, pp. 1753–1760 (2009)

    Google Scholar 

  23. Xia, R., Pan, Y., Lai, H., Liu, C., Yan, S.: Supervised hashing for image retrieval via image representation learning. In: AAAI Conference on Artificial Intelligence, pp. 2156–2162 (2014)

    Google Scholar 

  24. Liu, X., Wang, M., Yin, B.-C., Huet, B., Li, X.: Event-based media enrichment using an adaptive probabilistic hypergraph model. IEEE Trans. Cybern. 45(11), 2461–2471 (2015)

    Article  Google Scholar 

  25. Yan, J., Cho, M., Zha, H., Yang, X., Chu, S.M.: Multi-graph matching via affinity optimization with graduated consistency regularization. IEEE Trans. Pattern Anal. Mach. Intell. 38(6), 1228–1242 (2016)

    Article  Google Scholar 

  26. Yan, J., Yin, X.-C., Lin, W., Deng, C., Zha, H., Yang, X.: A short survey of recent advances in graph matching. In: ACM on International Conference on Multimedia Retrieval, pp. 167–174. ACM (2016)

    Google Scholar 

  27. Zhang, H., Shen, F., Liu, W., He, X., Luan, H., Chua, T.-S.: Discrete collaborative filtering. In: International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 325–334 (2016)

    Google Scholar 

  28. Zhu, H., Long, M., Wang, J., Cao, Y.: Deep hashing network for efficient similarity retrieval. In: AAAI Conference on Artificial Intelligence, pp. 2415–2421 (2016)

    Google Scholar 

Download references

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China (NSFC) under grants 61472116 and 61502139, in part by Natural Science Foundation of Anhui Province under grants 1608085MF128, and in part by the Open Projects Program of National Laboratory of Pattern Recognition under grant 201600006.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiancong Ge .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ge, J., Liu, X., Hong, R., Shao, J., Wang, M. (2018). Deep Graph Laplacian Hashing for Image Retrieval. In: Zeng, B., Huang, Q., El Saddik, A., Li, H., Jiang, S., Fan, X. (eds) Advances in Multimedia Information Processing – PCM 2017. PCM 2017. Lecture Notes in Computer Science(), vol 10735. Springer, Cham. https://doi.org/10.1007/978-3-319-77380-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-77380-3_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-77379-7

  • Online ISBN: 978-3-319-77380-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics