Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Supervised Hashing for Multi-labeled Data with Order-Preserving Feature

  • Conference paper
  • First Online:
Social Media Processing (SMP 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 774))

Included in the following conference series:

  • 1900 Accesses

Abstract

Approximate Nearest Neighbors (ANN) Search has attracted much attention in recent years. Hashing is a promising way for ANN which has been widely used in large-scale image retrieval tasks. However, most of the existing hashing methods are designed for single-labeled data. On multi-labeled data, those hashing methods take two images as similar if they share at least one common label. But this way cannot preserve the order relations in multi-labeled data. Meanwhile, most hashing methods are based on hand-crafted features which are costing. To solve the two problems above, we proposed a novel supervised hashing method to perform hash codes learning for multi-labeled data. In particular, we firstly extract the order-preserving data features through deep convolutional neural network. Secondly, the order-preserving features would be used for learning hash codes. Extensive experiments on two real-world public datasets show that the proposed method outperforms state-of-the-art baselines in the 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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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

Notes

  1. 1.

    http://www.image-net.org/.

  2. 2.

    https://www.cs.toronto.edu/~kriz/cifar.html.

  3. 3.

    http://imageclef.org/SIAPRdata.

  4. 4.

    http://press.liacs.nl/mirflickr/mirdownload.html.

  5. 5.

    http://lms.comp.nus.edu.sg/research/NUS-WIDE.htm.

  6. 6.

    http://www.vlfeat.org/matconvnet/.

  7. 7.

    http://www.vlfeat.org/matconvnet/pretrained/.

References

  1. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: Foundations of Computer Science Annual Symposium, vol. 51, no. 1, pp. 459–468 (2006)

    Google Scholar 

  2. Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM (JACM) 45(6), 891–923 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Beis, J.S., Lowe, D.G.: Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. In: 1997 IEEE Computer Society Conference on Proceedings of Computer Vision and Pattern Recognition, pp. 1000–1006. IEEE (1997)

    Google Scholar 

  4. Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 253–262. ACM (2004)

    Google Scholar 

  5. Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: International Conference on Very Large Data Bases, pp. 518–529 (2000)

    Google Scholar 

  6. 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 

  7. He, K., Wen, F., Sun, J.: K-means hashing: an affinity-preserving quantization method for learning binary compact codes. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2938–2945 (2013)

    Google Scholar 

  8. Heo, J.P., Lee, Y., He, J., Chang, S.F., Yoon, S.E.: Spherical hashing. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2957–2964, June 2012

    Google Scholar 

  9. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 604–613. ACM (1998)

    Google Scholar 

  10. Kang, W.C., Li, W.J., Zhou, Z.H.: Column sampling based discrete supervised hashing. In: AAAI Conference on Artificial Intelligence (2016)

    Google Scholar 

  11. Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing for scalable image search. In: 2009 IEEE 12th International Conference on Computer Vision, pp. 2130–2137. IEEE (2009)

    Google Scholar 

  12. Kulis, B., Jain, P., Grauman, K.: Fast similarity search for learned metrics. IEEE Trans. Pattern Anal. Mach. Intell. 31(12), 2143–2157 (2009)

    Article  Google Scholar 

  13. Lai, H., Yan, P., Shu, X., Wei, Y., Yan, S.: Instance-aware hashing for multi-label image retrieval. IEEE Trans. Image Proces. 25(6), 2469–2479 (2016). https://doi.org/10.1109/TIP.2016.2545300

    Article  MathSciNet  Google Scholar 

  14. Li, W.J., Wang, S., Kang, W.: Feature learning based deep supervised hashing with pairwise labels. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9–15 July 2016, pp. 1711–1717 (2016)

    Google Scholar 

  15. Lin, G., Shen, C., Shi, Q., van den Hengel, A., Suter, D.: Fast supervised hashing with decision trees for high-dimensional data. In: 2014 IEEE Conference on Computer Vision and Pattern Recognition, pp. 1971–1978, June 2014

    Google Scholar 

  16. Liu, W., Mu, C., Kumar, S., Chang, S.F.: Discrete graph hashing. Adv. Neural Inf. Process. Syst. 4, 3419–3427 (2014)

    Google Scholar 

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

    Google Scholar 

  18. Norouzi, M., Blei, D.M.: Minimal loss hashing for compact binary codes. In: Proceedings of the 28th International Conference on Machine Learning (ICML 2011), pp. 353–360 (2011)

    Google Scholar 

  19. Raginsky, M., Lazebnik, S.: Locality-sensitive binary codes from shift-invariant kernels. In: Advances in Neural Information Processing Systems 22: Proceedings of a Meeting Held 7–10 December 2009, Vancouver, British Columbia, Canada, pp. 1509–1517 (2009)

    Google Scholar 

  20. Rvelin, K., Kekäläinen, J.: IR evaluation methods for retrieving highly relevant documents. In: International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 41–48 (2000)

    Google Scholar 

  21. Shen, F., Liu, W., Zhang, S., Yang, Y.: Learning binary codes for maximum inner product search. In: IEEE International Conference on Computer Vision (2015)

    Google Scholar 

  22. Wang, J., Yang, J., Yu, K., Lv, F., Huang, T., Gong, Y.: Locality-constrained linear coding for image classification. In: 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3360–3367. IEEE (2010)

    Google Scholar 

  23. Zhang, P., Zhang, W., Li, W.J., Guo, M.: Supervised hashing with latent factor models. In: International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 173–182 (2014)

    Google Scholar 

  24. Zhao, F., Huang, Y., Wang, L., Tan, T.: Deep semantic ranking based hashing for multi-label image retrieval, pp. 1556–1564 (2015). IEEE Computer Society

    Google Scholar 

  25. Zheng, L., Wang, S., Tian, L., He, F., Liu, Z., Tian, Q.: Query-adaptive late fusion for image search and person re-identification. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1741–1750 (2015)

    Google Scholar 

Download references

Acknowledgement

This work was supported by 863 Program (2015AA015404), 973 Program (2013CB329303), China National Science Foundation (61402036, 60973083, 61273363), Beijing Advanced Innovation Center for Imaging Technology (BAICIT-2016007).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Heyan Huang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Wang, D., Huang, H., Lin, HK., Mao, XL. (2017). Supervised Hashing for Multi-labeled Data with Order-Preserving Feature. In: Cheng, X., Ma, W., Liu, H., Shen, H., Feng, S., Xie, X. (eds) Social Media Processing. SMP 2017. Communications in Computer and Information Science, vol 774. Springer, Singapore. https://doi.org/10.1007/978-981-10-6805-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6805-8_2

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6804-1

  • Online ISBN: 978-981-10-6805-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics