arrow
返回

Optimized projection for hashing

delete2019-01-01
delete5
delete
OA
AI
C
Chaoqun Chu
D
Dahan Gong
K
Kai Chen
Y
Yuchen Guo
韩
韩军功 (Jungong Han)
丁贵广 封面图
丁贵广 (Guiguang Ding) *
DOI:10.1016/j.patrec.2018.04.027delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Hashing, which seeks for binary codes to represent data, has drawn increasing research interest in recent years. Most existing Hashing methods follow a projection-quantization framework which first projects high-dimensional data into compact low-dimensional space and then quantifies the compact data into binary codes. The projection step plays a key role in Hashing and academia has paid considerable attention to it. Previous works have proven that a good projection should simultaneously 1) preserve important information in original data, and 2) lead to compact representation with low quantization error. However, they adopted a greedy two-step strategy to consider the above two properties separately. In this paper, we empirically show that such a two-step strategy will result in a sub-optimal solution because the optimal solution to 1) limits the feasible set for the solution to 2). We put forward a novel projection learning method for Hashing, dubbed Optimized Projection (OPH). Specifically, we propose to learn the projection in a unified formulation which can find a good trade-off such that the overall performance can be optimized. A general framework is given such that OPH can be incorporated with different Hashing methods for different situations. We also introduce an effective gradient-based optimization algorithm for OPH. We carried out extensive experiments for Hashing-based Approximate Nearest Neighbor search and Content-based Data Retrieval on six benchmark datasets. The results show that OPH significantly outperforms several state-of-the-art related Hashing methods. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Hashing
Quantization
Algorithm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition Letters 封面图
Pattern Recognition Letters
IF:
3.3
论文数:
8.0K
被引数:
1.6W

机构

T
tsinghua university
学者数:
11.9W
论文数: 10.0W
被引数: 137
L
Lancaster University
学者数:
9.5K
论文数: 1.1W
被引数: 1.7W
引用论文

引用论文

err
IF0
err
err0
PREAI
err
err分享
err收藏
Robust Quantization for General Similarity Search
err2018-02-01
err55
errOAAI
errGuo, Yuchen; Ding, Guiguang; Han, Jungong
err分享
err收藏
Learning to Hash With Optimized Anchor Embedding for Scalable Retrieval
err2017-03-01
err91
errOAAI
errGuo, Yuchen; Ding, Guiguang; Liu, Li; Han, Jungong; Shao, Ling
err分享
err收藏
Evolution of structural and optical properties of photocatalytic Fe doped TiO2 thin films prepared by RF magnetron sputtering
err2014-01-01
err0
PREAI
errPrabitha B. Nair; L. V. Maneeshya; V. B. Justinvictor; Georgi P. Daniel; K. Joy; P. V. Thomas
err分享
err收藏
err分享
err收藏
Zero-Shot Learning With Transferred Samples
err2017-07-01
err84
PREAI
errGuo, Yuchen; Ding, Guiguang; Han, Jungong; Gao, Yue
err分享
err收藏
err分享
err收藏
Latent Structure Preserving Hashing
err2016-07-20
err31
errOAAI
errLiu, Li; Yu, Mengyang; Shao, Ling
err分享
err收藏
学者 查看更多内容