Unsupervised Deep Hashing via Binary Latent Factor Models for Large-scale Cross-modal Retrieval

Author:

Wu Gengshen1,Lin Zijia2,Han Jungong1,Liu Li3,Ding Guiguang4,Zhang Baochang5,Shen Jialie6

Affiliation:

1. Lancaster University, Lancaster, LA1 4YW, UK

2. Microsoft Research, Beijing, 100080, China

3. Inception Institute of Artificial Intelligence, Abu Dhabi, UAE

4. Tsinghua University, Beijing, 100084, China

5. Beihang University, Beijing, 100083, China

6. Northumbria University, Newcastle Upon Tyne, NE1 8ST, UK

Abstract

Despite its great success, matrix factorization based cross-modality hashing suffers from two problems: 1) there is no engagement between feature learning and binarization; and 2) most existing methods impose the relaxation strategy by discarding the discrete constraints when learning the hash function, which usually yields suboptimal solutions. In this paper, we propose a novel multimodal hashing framework, referred as Unsupervised Deep Cross-Modal Hashing (UDCMH), for multimodal data search in a self-taught manner via integrating deep learning and matrix factorization with binary latent factor models. On one hand, our unsupervised deep learning framework enables the feature learning to be jointly optimized with the binarization. On the other hand, the hashing system based on the binary latent factor models can generate unified binary codes by solving a discrete-constrained objective function directly with no need for a relaxation step. Moreover, novel Laplacian constraints are incorporated into the objective function, which allow to preserve not only the nearest neighbors that are commonly considered in the literature but also the farthest neighbors of data, even if the semantic labels are not available. Extensive experiments on multiple datasets highlight the superiority of the proposed framework over several state-of-the-art baselines.

Publisher

International Joint Conferences on Artificial Intelligence Organization

Cited by 65 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Joint-Modal Graph Convolutional Hashing for unsupervised cross-modal retrieval;Neurocomputing;2024-08

2. Cross-Modal Semantic Embedding Hashing for Unsupervised Retrieval;2024 International Joint Conference on Neural Networks (IJCNN);2024-06-30

3. Global Similarity Relocation Hashing for Unsupervised Cross-modal Retrieval;2024 International Joint Conference on Neural Networks (IJCNN);2024-06-30

4. Semantic Reconstruction Guided Missing Cross-modal Hashing;2024 International Joint Conference on Neural Networks (IJCNN);2024-06-30

5. Deep supervised fused similarity hashing for cross-modal retrieval;Multimedia Tools and Applications;2024-06-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3