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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
ZZ完成签到,获得积分10
刚刚
蘑菇蘑菇发布了新的文献求助10
1秒前
lllttt发布了新的文献求助10
2秒前
Rockbook完成签到 ,获得积分10
3秒前
飘逸的又蓝完成签到,获得积分10
3秒前
3秒前
3秒前
华仔应助徐小赞采纳,获得10
4秒前
ccc发布了新的文献求助10
4秒前
4秒前
5秒前
有且仅有发布了新的文献求助10
6秒前
6秒前
nihaoaaaa发布了新的文献求助10
6秒前
meimei完成签到 ,获得积分10
6秒前
王哈哈完成签到,获得积分10
7秒前
7秒前
隐形曼青应助jyz采纳,获得10
7秒前
无花果应助安渝采纳,获得10
8秒前
雪白冷荷完成签到,获得积分10
8秒前
8秒前
8秒前
隐形曼青应助陈志强采纳,获得10
8秒前
soda发布了新的文献求助10
8秒前
打打应助科研通管家采纳,获得10
9秒前
传奇3应助科研通管家采纳,获得10
9秒前
大个应助科研通管家采纳,获得10
9秒前
超帅孱应助科研通管家采纳,获得10
9秒前
小蘑菇应助科研通管家采纳,获得10
9秒前
川泽完成签到,获得积分10
9秒前
FashionBoy应助科研通管家采纳,获得10
9秒前
大模型应助科研通管家采纳,获得10
9秒前
所所应助科研通管家采纳,获得10
10秒前
大个应助科研通管家采纳,获得10
10秒前
大个应助科研通管家采纳,获得10
10秒前
10秒前
星野完成签到,获得积分10
10秒前
dd发布了新的文献求助10
10秒前
10秒前
天天快乐应助科研通管家采纳,获得10
10秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Modern Epidemiology, Fourth Edition 5000
Handbook of pharmaceutical excipients, Ninth edition 5000
Kinesiophobia : a new view of chronic pain behavior 5000
Molecular Biology of Cancer: Mechanisms, Targets, and Therapeutics 3000
Digital Twins of Advanced Materials Processing 2000
Weaponeering, Fourth Edition – Two Volume SET 2000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 纳米技术 化学工程 生物化学 物理 计算机科学 内科学 复合材料 催化作用 物理化学 光电子学 电极 冶金 细胞生物学 基因
热门帖子
关注 科研通微信公众号,转发送积分 6019284
求助须知:如何正确求助?哪些是违规求助? 7612630
关于积分的说明 16161700
捐赠科研通 5166992
什么是DOI,文献DOI怎么找? 2765538
邀请新用户注册赠送积分活动 1747327
关于科研通互助平台的介绍 1635555