.png){kind=icon}
返回
Adaptive multi-bit quantization for hashing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2014.09.033.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, hashing methods which try to solve similarity-preserving approximate nearest search problem have obtained widely applications in various fields such as content-based image retrieval, object recognition and pose estimation. However, how to learn effective hash codes to describe the similarities in the large-scale database still remains as a NP-hard problem. Besides, a fatal problem lying in the existing hashing methods is that they usually threshold the real values to binary codes using single-bit quantization (SBQ) at the highest point density, which may destroy the data structure seriously. Due to this problem, double-bit quantization (DBQ) is proposed to solve the problem of SBQ by adaptively learning thresholds to quantize the real values to two bits, and achieves impressive results. However, one problem in DBQ is that it neglects the amount of the information contained in different data dimensions. In this paper, we propose a multi-bit quantization method based on bit allocation to quantize each projected dimension with variable bit numbers. Besides, different from existing methods of choosing threshold, we propose an incomplete coding manner by clustering to generate binary codes. Experiments on two large datasets demonstrate the feasibility of our method. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Image retrieval
Multi-bit quantization
Bit allocation
Incomplete coding
K-means clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Mechanical, but not infective, pacemaker erosion may be successfully managed by re-implantation of pacemakers..png)
Heart
OAAI
HeartIF0
OAAI分享收藏Identification of p21 (CIP1/WAF1) as a direct target gene of HIC1 (Hypermethylated In Cancer 1)
PREAI
分享收藏
查看更多内容