.png){kind=icon}
返回
Multi-bit quantization based on neighboring structure preservation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2017.11.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Hashing based approximate nearest neighbor search has become a research hotspot in computer vision. Most existing hashing methods concentrate on projection learning, and few efforts are dedicated to quantization coding. In this paper, we present a multi-bit quantization strategy to improve the quantization quality of projection values by adaptively learning quantization thresholds and quantizing each projection dimension with multiple bits. Our method exploits both the similarity and the local structure of samples in the original feature space and the pair-wise samples coding consistency. Extensive experiments on two canonical image datasets have shown that our method consistently outperforms the state-of-the-art quantization methods in terms of query performance. (c) 2017 Elsevier B.V. All rights reserved.
Keyword:
Approximate nearest neighbor search
Neighboring structure
Hashing
Quantization coding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
Gradient-based learning applied to document recognition基于梯度的学习在文档识别中的应用.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏
分享收藏 没有更多内容
没有更多内容