Double-Bit Quantization and Index Hashing for Nearest Neighbor Search

doi:10.1109/TMM.2018.2872898

	Double-Bit Quantization and Index Hashing for Nearest Neighbor Search
	Xie, Hongtao 1; Mao, Zhendong 1; Zhang, Yongdong 1; Deng, Han 2; Yan, Chenggang 3; 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
DOI	10.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.
资助项目	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关键词	ITERATIVE QUANTIZATION ; PROCRUSTEAN APPROACH ; BINARY-CODES ; SPACE
WOS研究方向	Computer Science ; Telecommunications
语种	英语
出版者	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
WOS记录号	WOS:000466223600014
资助机构	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.