Supervised Discrete Hashing With Relaxation

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

Stats

• citations76
• S2 citations—
• github stars0
• HF likes0
• heat score14.15
• arxiv keygui2019supervised

Related papers

• Deep Supervised Discrete Hashing (2017)0.00
• Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
• Deep Discrete Supervised Hashing (2017)15.06
• Scalable Discrete Supervised Hash Learning With Asymmetric Matrix Factorization (2016)4.52
• Supervised Hashing Based On Energy Minimization (2017)0.00
• SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
• Discriminative Supervised Hashing For Cross-modal Similarity Search (2018)7.81
• Deep Residual Hashing (2016)0.00