Entropy-Optimized Deep Weighted Product Quantization for Image Retrieval

代码本 代码字 量化(信号处理) 熵(时间箭头) 计算机科学 算法 概率分布 编码器 数学 模式识别(心理学) 矢量量化 解码方法 人工智能 理论计算机科学 物理 操作系统 统计 量子力学
作者
Lingchen Gu,Ju Liu,Xiaoxi Liu,Wenbo Wan,Jiande Sun
出处
期刊:IEEE transactions on image processing [Institute of Electrical and Electronics Engineers]
卷期号:33: 1162-1174 被引量:6
标识
DOI:10.1109/tip.2024.3359066
摘要

Hashing and quantization have greatly succeeded by benefiting from deep learning for large-scale image retrieval. Recently, deep product quantization methods have attracted wide attention. However, representation capability of codewords needs to be further improved. Moreover, since the number of codewords in the codebook depends on experience, representation capability of codewords is usually imbalanced, which leads to redundancy or insufficiency of codewords and reduces retrieval performance. Therefore, in this paper, we propose a novel deep product quantization method, named Entropy Optimized deep Weighted Product Quantization (EOWPQ), which not only encodes samples into the weighted codewords in a new flexible manner but also balances the codeword assignment, improving while balancing representation capability of codewords. Specifically, we encode samples using the linear weighted sum of codewords instead of a single codeword as traditionally. Meanwhile, we establish the linear relationship between the weighted codewords and semantic labels, which effectively maintains semantic information of codewords. Moreover, in order to balance the codeword assignment, that is, avoiding some codewords representing most samples or some codewords representing very few samples, we maximize the entropy of the coding probability distribution and obtain the optimal coding probability distribution of samples by utilizing optimal transport theory, which achieves the optimal assignment of codewords and balances representation capability of codewords. The experimental results on three benchmark datasets show that EOWPQ can achieve better retrieval performance and also show the improvement of representation capability of codewords and the balance of codeword assignment.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
在水一方应助L.M采纳,获得10
1秒前
动听冰淇淋完成签到,获得积分10
1秒前
多情方盒完成签到,获得积分10
1秒前
2秒前
海吉发布了新的文献求助10
3秒前
JamesPei应助无限靖儿采纳,获得10
3秒前
FuHua发布了新的文献求助10
4秒前
研友_惊鸿发布了新的文献求助10
5秒前
啦啦发布了新的文献求助20
6秒前
鱼鱼完成签到,获得积分10
7秒前
9秒前
yuanyuan发布了新的文献求助10
10秒前
10秒前
12秒前
科研通AI6.4应助研友_惊鸿采纳,获得10
12秒前
12秒前
懒洋洋发布了新的文献求助10
14秒前
zerodada126完成签到,获得积分10
15秒前
小蘑菇应助zengwei采纳,获得10
15秒前
曹健应助樱三枫采纳,获得100
15秒前
15秒前
15秒前
loria发布了新的文献求助10
16秒前
17秒前
19秒前
19秒前
所所应助hixkk采纳,获得10
21秒前
懒洋洋完成签到,获得积分10
21秒前
22秒前
ZLZ完成签到,获得积分20
22秒前
Elvaaa完成签到,获得积分10
23秒前
accheart发布了新的文献求助10
23秒前
24秒前
专注黄豆发布了新的文献求助10
24秒前
24秒前
英姑应助优雅的白筠采纳,获得10
25秒前
英姑应助冯邱邱采纳,获得10
25秒前
26秒前
luckily发布了新的文献求助10
26秒前
27秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Discerning Saints: Moralization of Intrinsic Motivation and Selective Prosociality at Work 500
Handbuch Trainingswissenschaft – Trainingslehre 500
Additive Manufacturing Design and Applications (ASM Handbook, Volume 24A) 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7584710
求助须知:如何正确求助?哪些是违规求助? 9163238
关于积分的说明 19610301
捐赠科研通 7166430
什么是DOI,文献DOI怎么找? 3266491
关于科研通互助平台的介绍 2431538
邀请新用户注册赠送积分活动 2258145