中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 自动化研究所
  3. 中国科学院自动化研究所
  4. 数字内容技术与服务研究中心
  5. 远程智能医疗
Double-Bit Quantization and Index Hashing for Nearest Neighbor Search

文献类型：期刊论文

作者Xie, Hongtao1; Mao, Zhendong1; Zhang, Yongdong1; Deng, Han2; Yan, Chenggang3; Chen, Zhineng4
刊名IEEE TRANSACTIONS ON MULTIMEDIA
出版日期2019-05-01
卷号21期号:5页码:1248-1260
关键词Nearest neighbor search double-bit quantization double-bit index hashing weighted distance measurement binary embedding
ISSN号1520-9210
DOI10.1109/TMM.2018.2872898
通讯作者Mao, Zhendong(maozhendong2008@gmail.com)
英文摘要Asbinary code is storage efficient and fast to compute, it has become a trend to compact real-valued data to binary codes for the nearest neighbors (NN) search in a large-scale database. However, the use of binary code for the NN search leads to low retrieval accuracy. To increase the discriminability of the binary codes of existing hash functions, in this paper, we propose a framework of double-bit quantization and index hashing for an effective NN search. The main contributions of our framework are: first, a novel double-bit quantization (DBQ) is designed to assign more bits to each dimension for higher retrieval accuracy; second, a double-bit index hashing (DBIH) is presented to efficiently index binary codes generated by DBQ; and third, a weighted distance measurement for DBQ binary codes is put forward to re-rank the search results from DBIH. The empirical results on three benchmark databases demonstrate the superiority of our framework over existing approaches in terms of both retrieval accuracy and query efficiency. Specifically, we observe an absolute improvement on precision of 10%-25% in most cases and the query speed increases over 30 times compared to traditional binary embedding methods and linear scan, respectively.
WOS关键词ITERATIVE QUANTIZATION ; PROCRUSTEAN APPROACH ; BINARY-CODES ; SPACE
资助项目National Key Research and Development Program of China[2017YFC0820600] ; National Defense Science and Technology Fund for Distinguished Young Scholars[2017JCJQ-ZQ-022] ; National Nature Science Foundation of China[61525206] ; National Nature Science Foundation of China[61771468] ; National Nature Science Foundation of China[61772526] ; National Nature Science Foundation of China[61502477] ; Youth Innovation Promotion Association Chinese Academy of Sciences[2017209]
WOS研究方向Computer Science ; Telecommunications
语种英语
WOS记录号WOS:000466223600014
出版者IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
资助机构National Key Research and Development Program of China ; National Defense Science and Technology Fund for Distinguished Young Scholars ; National Nature Science Foundation of China ; Youth Innovation Promotion Association Chinese Academy of Sciences
源URL[http://ir.ia.ac.cn/handle/173211/24220]  
专题数字内容技术与服务研究中心_远程智能医疗
通讯作者Mao, Zhendong
作者单位1.Univ Sci & Technol China, Sch Informat Sci & Technol, Hefei 230026, Anhui, Peoples R China
2.Chinese Acad Sci, Inst Informat Engn, Beijing 100093, Peoples R China
3.Hangzhou Dianzi Univ, Inst Informat & Control, Hangzhou 310000, Zhejiang, Peoples R China
4.Chinese Acad Sci, Inst Automat, Beijing 100190, Peoples R China
推荐引用方式
GB/T 7714		 Xie, Hongtao,Mao, Zhendong,Zhang, Yongdong,et al. Double-Bit Quantization and Index Hashing for Nearest Neighbor Search[J]. IEEE TRANSACTIONS ON MULTIMEDIA,2019,21(5):1248-1260.
APA Xie, Hongtao,Mao, Zhendong,Zhang, Yongdong,Deng, Han,Yan, Chenggang,&Chen, Zhineng.(2019).Double-Bit Quantization and Index Hashing for Nearest Neighbor Search.IEEE TRANSACTIONS ON MULTIMEDIA,21(5),1248-1260.
MLA Xie, Hongtao,et al."Double-Bit Quantization and Index Hashing for Nearest Neighbor Search".IEEE TRANSACTIONS ON MULTIMEDIA 21.5(2019):1248-1260.

入库方式： OAI收割

来源：自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。