Deep hashing for compact binary codes learning
Citations Over TimeTop 1% of 2015 papers
Abstract
In this paper, we propose a new deep hashing (DH) approach to learn compact binary codes for large scale visual search. Unlike most existing binary codes learning methods which seek a single linear projection to map each sample into a binary vector, we develop a deep neural network to seek multiple hierarchical non-linear transformations to learn these binary codes, so that the nonlinear relationship of samples can be well exploited. Our model is learned under three constraints at the top layer of the deep network: 1) the loss between the original real-valued feature descriptor and the learned binary vector is minimized, 2) the binary codes distribute evenly on each bit, and 3) different bits are as independent as possible. To further improve the discriminative power of the learned binary codes, we extend DH into supervised DH (SDH) by including one discriminative term into the objective function of DH which simultaneously maximizes the inter-class variations and minimizes the intra-class variations of the learned binary codes. Experimental results show the superiority of the proposed approach over the state-of-the-arts.
Related Papers
- Optimizing affinity-based binary hashing using auxiliary coordinates(2016)
- → Optimal Binary Linear Complementary Pairs of Codes(2022)5 cited
- → A Two-step Approach to Cross-modal Hashing(2015)4 cited
- → Two-dimensional perfect binary arrays with 64 elements(1990)29 cited
- → A novel coding method for genetic algorithms based on redundant binary numbers(2010)3 cited