logo
banner

Journals & Publications

Publications Papers

Papers

Supervised Discrete Hashing With Relaxation
Mar 19, 2018Author:
PrintText Size A A

Title: Supervised Discrete Hashing With Relaxation

 Authors: Gui, J; Liu, TL; Sun, ZN; Tao, DC; Tan, TN

 Author Full Names: Gui, Jie; Liu, Tongliang; Sun, Zhenan; Tao, Dacheng; Tan, Tieniu

 Source: IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 29 (3):608-617; 10.1109/TNNLS.2016.2636870 MAR 2018

 Language: English

 Abstract: Data-dependent hashing has recently attracted attention due to being able to support efficient retrieval and storage of high-dimensional data, such as documents, images, and videos. In this paper, we propose a novel learning-based hashing method called "supervised discrete hashing with relaxation" (SDHR) based on "supervised discrete hashing" (SDH). SDH uses ordinary least squares regression and traditional zero-one matrix encoding of class label information as the regression target (code words), thus fixing the regression target. In SDHR, the regression target is instead optimized. The optimized regression target matrix satisfies a large margin constraint for correct classification of each example. Compared with SDH, which uses the traditional zero-one matrix, SDHR utilizes the learned regression target matrix and, therefore, more accurately measures the classification error of the regression model and is more flexible. As expected, SDHR generally outperforms SDH. Experimental results on two large-scale image data sets (CIFAR-10 and MNIST) and a large-scale and challenging face data set (FRGC) demonstrate the effectiveness and efficiency of SDHR.

 ISSN: 2162-237X

 eISSN: 2162-2388

 IDS Number: FX8LD

 Unique ID: WOS:000426344600009

 PubMed ID: 28055923

*Click Here to View Full Record