arrow
Return

Deep Discrete Supervised Hashing

delete2018-12-01
delete98
delete
OA
AI
J
Jiang, Qing-Yuan
C
Cui, Xue
W
Wu-Jun Li *
DOI:10.1109/TIP.2018.2864894delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Hashing has been widely used for large-scale search due to its low storage cost and fast query speed. By using supervised information, supervised hashing can significantly outperform unsupervised hashing. Recently, discrete supervised hashing and feature learning based deep hashing are two representative progresses in supervised hashing. On one hand, hashing is essentially a discrete optimization problem. Hence, utilizing supervised information to directly guide discrete (binary) coding procedure can avoid sub-optimal solution and improve the accuracy. On the other hand, feature learning based deep hashing, which integrates deep feature learning and hash-code learning into an end-to-end architecture, can enhance the feedback between feature learning and hash-code learning. The key in discrete supervised hashing is to adopt supervised information to directly guide the discrete coding procedure in hashing. The key in deep hashing is to adopt the supervised information to directly guide the deep feature learning procedure. However, most deep supervised hashing methods cannot use the supervised information to directly guide both discrete (binary) coding procedure and deep feature learning procedure in the same framework. In this paper, we propose a novel deep hashing method, called deep discrete supervised hashing (DDSH). DDSH is the first deep hashing method which can utilize pairwise supervised information to directly guide both discrete coding procedure and deep feature learning procedure and thus enhance the feedback between these two important procedures. Experiments on four real datasets show that DDSH can outperform other state-of-the-art baselines, including both discrete hashing and deep hashing baselines, for image retrieval.
Keywords:
Image retrieval
deep learning
deep supervised hashing
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Image Processing cover
IEEE Transactions on Image Processing
IF:
13.7
Papers:
1.0W
Citations:
8.4W

Organization

N
nanjing university
Scholars:
7.8W
Papers: 5.6W
Citations: 87
Cited Papers

Cited Papers

The 1965 Eruption of Taal Volcano
err1966-02-25
err0
PREAI
errJames G. Moore; Kazuaki Nakamura; Arturo Alcaraz
errShare
errSave
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
errShare
errSave
Semantic hashing
err2009-07-01
err939
errOAAI
errSalakhutdinov, Ruslan; Hinton, Geoffrey
errShare
errSave
Contests with rank-order spillovers
err2009-08-28
err0
errOAAI
errMichael R. Baye; Dan Kovenock; Casper G. de Vries
errShare
errSave
Learning to Hash for Indexing Big Data-A Survey
err2016-01-01
err399
errOAAI
errWang, Jun; Liu, Wei; Kumar, Sanjiv; Chang, Shih-Fu
errShare
errSave
A Fast Optimization Method for General Binary Code Learning
err2016-12-01
err135
PREAI
errShen, Fumin; Zhou, Xiang; Yang, Yang; Song, Jingkuan; Shen, Heng Tao; Tao, Dacheng
errShare
errSave
researcher View more