Semantic Consistency based Dual-Asymmetric Discrete Online Hashing for Multi-View Streaming Data Retrieval
Multi-view online hashing has received much at-tention due to its huge potential in the area of large-scale multimedia retrieval. However, there are still some issues, e.g., how to alleviate the catastrophic forgetting, how to adequately extract high-level semantic information of multi-view streaming data and improve the discrimination of hash models, and how to effectively optimize the binary constraint problem. In this paper, we propose a novel Semantic Consistency based Dual-asymmetric Discrete Online Hashing method, SC-DDOH for short. It adopts a dual-asymmetric distance-based similarity supervision to retain similarities of new data chunk and database. To extract efficient high-level semantic information, an online semantic consistent supervision to mine the semantic related information from word embedding labels. Moreover, an efficient discrete iterative optimization algorithm is introduced to directly learn hash code in the Hamming space. Experiment results on three large-scale multi-view datasets demonstrate the superiority of SC-DDOH over the state-of-the-art baselines.
Authors
- Yunxiao Zu (ORCID: https://orcid.org/0000-0002-9227-1574)
- Jing Chen (ORCID: https://orcid.org/0000-0002-2726-5530)
- Bin Hou (ORCID: https://orcid.org/0000-0003-2100-0520)
- Xinzhu Sang (ORCID: https://orcid.org/0000-0002-1894-7230)
- Meiru Liu (ORCID: https://orcid.org/0000-0002-1050-8356)
Institutions
- Beijing University of Posts and Telecommunications (CN)
Publication Details
- Published
- 2024-10-06
- DOI
- https://doi.org/10.1109/smc54092.2024.10831656
- Primary Topic
- Caching and Content Delivery
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- National Key Research and Development Program of China
- Beijing Key Laboratory of Work Safety Intelligent Monitoring, Beijing University of Posts and Telecommunications