| Large-Scale Unsupervised Hashing with Shared Structure Learning | |
Liu, Xianglong1; Mu, Yadong2; Zhang, Danchen1; Lang, Bo1; Li, Xuelong3
| |
| 2015-09-01 | |
| 发表期刊 | IEEE TRANSACTIONS ON CYBERNETICS
 |
| 卷号 | 45期号:9页码:1811-1822 |
| 摘要 | Hashing methods are effective in generating compact binary signatures for images and videos. This paper addresses an important open issue in the literature, i.e., how to learn compact hash codes by enhancing the complementarity among different hash functions. Most of prior studies solve this problem either by adopting time-consuming sequential learning algorithms or by generating the hash functions which are subject to some deliberately-designed constraints (e.g., enforcing hash functions orthogonal to one another). We analyze the drawbacks of past works and propose a new solution to this problem. Our idea is to decompose the feature space into a subspace shared by all hash functions and its complementary subspace. On one hand, the shared subspace, corresponding to the common structure across different hash functions, conveys most relevant information for the hashing task. Similar to data de-noising, irrelevant information is explicitly suppressed during hash function generation. On the other hand, in case that the complementary subspace also contains useful information for specific hash functions, the final form of our proposed hashing scheme is a compromise between these two kinds of subspaces. To make hash functions not only preserve the local neighborhood structure but also capture the global cluster distribution of the whole data, an objective function incorporating spectral embedding loss, binary quantization loss, and shared subspace contribution is introduced to guide the hash function learning. We propose an efficient alternating optimization method to simultaneously learn both the shared structure and the hash functions. Experimental results on three well-known benchmarks CIFAR-10, NUS-WIDE, and a-TRECVID demonstrate that our approach significantly outperforms state-of-the-art hashing methods. |
| 文章类型 | Article |
| 关键词 | Locality Sensitive Hashing (Lsh) Nearest Neighbor Search Shared Structure Learning Unsupervised Hashing |
| WOS标题词 | Science & Technology ; Technology |
| DOI | 10.1109/TCYB.2014.2360856 |
| 收录类别 | SCI ; EI |
| 关键词[WOS] | IMAGE RETRIEVAL ; ITERATIVE QUANTIZATION ; PROCRUSTEAN APPROACH ; BINARY-CODES ; SEARCH ; RERANKING |
| 语种 | 英语 |
| WOS研究方向 | Computer Science |
| WOS类目 | Computer Science, Artificial Intelligence ; Computer Science, Cybernetics |
| WOS记录号 | WOS:000360019000009 |
| 引用统计 | |
| 文献类型 | 期刊论文 |
| 条目标识符 | http://ir.opt.ac.cn/handle/181661/25358 |
| 专题 | 光谱成像技术研究室 |
| 作者单位 | 1.Beihang Univ, State Key Lab Software Dev Environm, Beijing 100191, Peoples R China 2.AT&T Labs Res, Middletown, NJ 07748 USA 3.Chinese Acad Sci, Xian Inst Opt & Precis Mech, State Key Lab Transient Opt & Photon, Ctr Opt Imagery Anal & Learning, Xian 710119, Peoples R China |
| 推荐引用方式 GB/T 7714 | Liu, Xianglong,Mu, Yadong,Zhang, Danchen,et al. Large-Scale Unsupervised Hashing with Shared Structure Learning[J]. IEEE TRANSACTIONS ON CYBERNETICS,2015,45(9):1811-1822. |
| APA | Liu, Xianglong,Mu, Yadong,Zhang, Danchen,Lang, Bo,&Li, Xuelong.(2015).Large-Scale Unsupervised Hashing with Shared Structure Learning.IEEE TRANSACTIONS ON CYBERNETICS,45(9),1811-1822. |
| MLA | Liu, Xianglong,et al."Large-Scale Unsupervised Hashing with Shared Structure Learning".IEEE TRANSACTIONS ON CYBERNETICS 45.9(2015):1811-1822. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| Large-Scale Unsuperv（1268KB） | 期刊论文 | 出版稿 | 限制开放 | CC BY-NC-SA | 请求全文 | |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论