Online Multi-modal Hashing with Dynamic Query-adaption

计算机科学 散列函数 特征哈希 二进制代码 理论计算机科学 动态完美哈希 数据挖掘 双重哈希 哈希表 算法 人工智能 二进制数 数学 计算机安全 算术
作者
Xu Lu,Lei Zhu,Zhiyong Cheng,Liqiang Nie,Huaxiang Zhang
标识
DOI:10.1145/3331184.3331217
摘要

Multi-modal hashing is an effective technique to support large-scale multimedia retrieval, due to its capability of encoding heterogeneous multi-modal features into compact and similarity-preserving binary codes. Although great progress has been achieved so far, existing methods still suffer from several problems, including: 1) All existing methods simply adopt fixed modality combination weights in online hashing process to generate the query hash codes. This strategy cannot adaptively capture the variations of different queries. 2) They either suffer from insufficient semantics (for unsupervised methods) or require high computation and storage cost (for the supervised methods, which rely on pair-wise semantic matrix). 3) They solve the hash codes with relaxed optimization strategy or bit-by-bit discrete optimization, which results in significant quantization loss or consumes considerable computation time. To address the above limitations, in this paper, we propose an Online Multi-modal Hashing with Dynamic Query-adaption (OMH-DQ) method in a novel fashion. Specifically, a self-weighted fusion strategy is designed to adaptively preserve the multi-modal feature information into hash codes by exploiting their complementarity. The hash codes are learned with the supervision of pair-wise semantic labels to enhance their discriminative capability, while avoiding the challenging symmetric similarity matrix factorization. Under such learning framework, the binary hash codes can be directly obtained with efficient operations and without quantization errors. Accordingly, our method can benefit from the semantic labels, and simultaneously, avoid the high computation complexity. Moreover, to accurately capture the query variations, at the online retrieval stage, we design a parameter-free online hashing module which can adaptively learn the query hash codes according to the dynamic query contents. Extensive experiments demonstrate the state-of-the-art performance of the proposed approach from various aspects.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
afatinib完成签到,获得积分10
刚刚
刚刚
刚刚
MAZOUR发布了新的文献求助10
1秒前
田培栋发布了新的文献求助10
1秒前
冰可乐完成签到 ,获得积分10
2秒前
2秒前
4秒前
4秒前
hu完成签到 ,获得积分10
5秒前
Milder完成签到,获得积分10
5秒前
孙宏发布了新的文献求助10
5秒前
英姑应助呼呼呼采纳,获得10
6秒前
whitepiece发布了新的文献求助200
8秒前
陈维凤完成签到 ,获得积分10
8秒前
科研通AI2S应助扎心采纳,获得10
9秒前
莫小乖发布了新的文献求助10
9秒前
李健的小迷弟应助田培栋采纳,获得10
9秒前
糜佳诚发布了新的文献求助10
10秒前
Trace2023完成签到,获得积分10
10秒前
张必雨完成签到,获得积分10
10秒前
孙宏完成签到,获得积分10
13秒前
靓仔完成签到,获得积分20
14秒前
脑洞疼应助西门向卉采纳,获得10
15秒前
王津丹完成签到,获得积分10
17秒前
田様应助无聊的天抒采纳,获得10
19秒前
佳佳完成签到 ,获得积分10
22秒前
离言完成签到,获得积分10
22秒前
含糊的寻雪应助阔达听寒采纳,获得10
22秒前
健壮的小鸽子完成签到,获得积分10
23秒前
Jorna完成签到,获得积分10
23秒前
科研通AI6.2应助jessicaw采纳,获得10
23秒前
25秒前
852应助娃娃采纳,获得10
26秒前
27秒前
EgbertW完成签到,获得积分10
28秒前
木子发布了新的文献求助10
29秒前
30秒前
31秒前
科研通AI6.2应助爱德福采纳,获得10
31秒前
高分求助中
GL 2 A method for assessing the in-place cleanability of food processing equipment, Fourth Edition, December 2023 3000
Annie Ernaux: De la perte au corps glorieux 600
Microvascular Surgery in Head and Neck Reconstruction 500
Petrology and Plate Tectonics 500
Writing Systems 500
Media Today Mass Communication in a Converging World 9th Edition 400
Understanding Modeling and Simulation of Polymerization Reactions 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6836644
求助须知:如何正确求助?哪些是违规求助? 8545869
关于积分的说明 18182111
捐赠科研通 6183007
什么是DOI,文献DOI怎么找? 3038550
关于科研通互助平台的介绍 2026445
邀请新用户注册赠送积分活动 2015827