| Robust Hashing with Local Models for Approximate Similarity Search | |
Song, Jingkuan1; Yang, Yi1; Li, Xuelong2 ; Huang, Zi1; Yang, Yang3
| |
| 作者部门 | 光学影像学习与分析中心 |
| 2014-07-01 | |
| 发表期刊 | IEEE TRANSACTIONS ON CYBERNETICS
 |
| ISSN | 2168-2267 |
| 卷号 | 44期号:7页码:1225-1236 |
| 摘要 | Similarity search plays an important role in many applications involving high-dimensional data. Due to the known dimensionality curse, the performance of most existing indexing structures degrades quickly as the feature dimensionality increases. Hashing methods, such as locality sensitive hashing (LSH) and its variants, have been widely used to achieve fast approximate similarity search by trading search quality for efficiency. However, most existing hashing methods make use of randomized algorithms to generate hash codes without considering the specific structural information in the data. In this paper, we propose a novel hashing method, namely, robust hashing with local models (RHLM), which learns a set of robust hash functions to map the high-dimensional data points into binary hash codes by effectively utilizing local structural information. In RHLM, for each individual data point in the training dataset, a local hashing model is learned and used to predict the hash codes of its neighboring data points. The local models from all the data points are globally aligned so that an optimal hash code can be assigned to each data point. After obtaining the hash codes of all the training data points, we design a robust method by employing l(2),(1)-norm minimization on the loss function to learn effective hash functions, which are then used to map each database point into its hash code. Given a query data point, the search process first maps it into the query hash code by the hash functions and then explores the buckets, which have similar hash codes to the query hash code. Extensive experimental results conducted on real-life datasets show that the proposed RHLM outperforms the state-of-the-art methods in terms of search quality and efficiency. |
| 文章类型 | Article |
| 关键词 | Approximate Similarity Search Indexing Robust Hashing |
| WOS标题词 | Science & Technology ; Technology |
| DOI | 10.1109/TCYB.2013.2289351 |
| 收录类别 | SCI ; EI |
| 关键词[WOS] | DIMENSIONALITY REDUCTION |
| 语种 | 英语 |
| WOS研究方向 | Computer Science |
| WOS类目 | Computer Science, Artificial Intelligence ; Computer Science, Cybernetics |
| WOS记录号 | WOS:000342225800019 |
| 引用统计 | |
| 文献类型 | 期刊论文 |
| 条目标识符 | http://ir.opt.ac.cn/handle/181661/22366 |
| 专题 | 光谱成像技术研究室 |
| 作者单位 | 1.Univ Queensland, Sch Informat Technol & Elect Engn, Brisbane, Qld 4072, Australia 2.Chinese Acad Sci, Ctr Opt Imagery Anal & Learning OPTIMAL, Xian Inst Opt & Precis Mech, State Key Lab Transient Opt & Photon, Xian 710119, Shaanxi, Peoples R China 3.Natl Univ Singapore, Sch Comp, Singapore 119077, Singapore |
| 推荐引用方式 GB/T 7714 | Song, Jingkuan,Yang, Yi,Li, Xuelong,et al. Robust Hashing with Local Models for Approximate Similarity Search[J]. IEEE TRANSACTIONS ON CYBERNETICS,2014,44(7):1225-1236. |
| APA | Song, Jingkuan,Yang, Yi,Li, Xuelong,Huang, Zi,&Yang, Yang.(2014).Robust Hashing with Local Models for Approximate Similarity Search.IEEE TRANSACTIONS ON CYBERNETICS,44(7),1225-1236. |
| MLA | Song, Jingkuan,et al."Robust Hashing with Local Models for Approximate Similarity Search".IEEE TRANSACTIONS ON CYBERNETICS 44.7(2014):1225-1236. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| Robust Hashing with （9226KB） | 期刊论文 | 出版稿 | 限制开放 | CC BY | 请求全文 | |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论