Skip to main content

High-Order Correlation Embedding for Large-Scale Multi-modal Hashing

  • Conference paper
  • First Online:
Web and Big Data (APWeb-WAIM 2022)

Abstract

Benefitting from the superb storage and computational efficiency, hashing has received considerable research attention on large-scale multi-modal retrieval. However, most existing methods are mainly built based upon matrix optimization without high-order correlation and equally treat the training instances, which fail to fuse heterogeneous sources and ignore the heuristic information contained by the sampling order. To this end, we, for the first time, propose a novel tensor-based supervised discrete learning framework named Discrete Multi-modal Correlation Hashing (DMCH) to perform a high-order correlation preserved semantic hash learning. Specifically, DMCH stacks all the modality-private matrices into a third-order tensor to simultaneously exploit the high-order intrinsic correlations across heterogeneous sources, which explicitly enforces the consistent and private properties of different modalities. Moreover, DMCH selects the training samples from reliable to unreliable ones to extract heuristic information contained by the instance learning order, which increases the robustness of the model. Furthermore, the specific semantic labels are utilized as specific prior knowledge to preserve full-scale supervision instead of the widely-used pair-wise similarity. Finally, the jointly learning objective is formulated to concurrently preserve the modality-common information and modality-private semantics in the learned hash codes. Extensive experiments on four public datasets demonstrate the state-of-the-art performance of our proposed method.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

Notes

  1. 1.

    https://huggingface.co/datasets/wikipedia.

  2. 2.

    https://press.liacs.nl/mirflickr/.

  3. 3.

    https://lms.comp.nus.edu.sg/wp-content/uploads/2019/research/nuswide/NUS-WIDE.html.

  4. 4.

    https://cocodataset.org/.

References

  1. An, J., Luo, H., Zhang, Z., Zhu, L., Lu, G.: Cognitive multi-modal consistent hashing with flexible semantic transformation. IPM 59(1), 102743 (2022)

    Google Scholar 

  2. Chang, Y., Yan, L., Zhao, X.L., Fang, H., Zhang, Z., Zhong, S.: Weighted low-rank tensor recovery for hyperspectral image restoration. IEEE TCYB 50(11), 4558–4572 (2020)

    Google Scholar 

  3. Chen, Y., Wang, S., Peng, C., Hua, Z., Zhou, Y.: Generalized nonconvex low-rank tensor approximation for multi-view subspace clustering. IEEE TIP PP(99), 1 (2021)

    Google Scholar 

  4. Liu, L., Yu, M., Shao, L.: Multiview alignment hashing for efficient image search. IEEE TIP 24(3), 956–966 (2015)

    MathSciNet  MATH  Google Scholar 

  5. Lu, X., Zhu, L., Cheng, Z., Nie, L., Zhang, H.: Online multi-modal hashing with dynamic query-adaption. In: Proceedings of ACM SIGIR, pp. 715–724 (2019)

    Google Scholar 

  6. Shen, X., Shen, F., Liu, L., Yuan, Y.H., Liu, W., Sun, Q.S.: Multiview discrete hashing for scalable multimedia search. ACM TIST 9(5), 1–21 (2018)

    Article  Google Scholar 

  7. Shen, X., Shen, F., Sun, Q.S., Yuan, Y.H.: Multi-view latent hashing for efficient multimedia search. In: Proceedings of the 23rd ACM MM, pp. 831–834 (2015)

    Google Scholar 

  8. Song, J., Yang, Y., Huang, Z., Shen, H.T., Luo, J.: Effective multiple feature hashing for large-scale near-duplicate video retrieval. IEEE TMM 15(8), 1997–2008 (2013)

    Google Scholar 

  9. Xie, Y., Tao, D., Zhang, W., Liu, Y., Zhang, L., Qu, Y.: On unifying multi-view self-representations for clustering by tensor multi-rank minimization. IJCV 126(11), 1157–1179 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  10. Yang, R., Shi, Y., Xu, X.S.: Discrete multi-view hashing for effective image retrieval. In: Proceedings of the 2017 ACM ICMR, pp. 175–183 (2017)

    Google Scholar 

  11. Zhang, Z., Liu, L., Shen, F., Shen, H.T., Shao, L.: Binary multi-view clustering. IEEE TPAMI 41(7), 1774–1782 (2018)

    Article  Google Scholar 

  12. Zhang, Z., Luo, H., Zhu, L., Lu, G., Shen, H.T.: Modality-invariant asymmetric networks for cross-modal hashing. IEEE TKDE (2022)

    Google Scholar 

Download references

Acknowledgements

This work was supported in part by Shenzhen Fundamental Research Fund under grants GXWD20201230155427003-20200824103320001 and JCYJ20210324132212030, and also supported by the Guangdong Natural Science Foundation under grant 2022A1515010819.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Zheng Zhang or Yongyong Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

An, J., Li, Y., Zhang, Z., Chen, Y., Lu, G. (2023). High-Order Correlation Embedding for Large-Scale Multi-modal Hashing. In: Li, B., Yue, L., Tao, C., Han, X., Calvanese, D., Amagasa, T. (eds) Web and Big Data. APWeb-WAIM 2022. Lecture Notes in Computer Science, vol 13422. Springer, Cham. https://doi.org/10.1007/978-3-031-25198-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-25198-6_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-25197-9

  • Online ISBN: 978-3-031-25198-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics