Deep Hashing for Compact Binary Codes Learning
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Deep HashingSimilar Papers 제목 키워드 기반
Simultaneous Feature Aggregating and Hashing for Compact Binary Code Learning
Representing images by compact hash codes is an attractive approach for large-scale content-based image retrieval. In most state-of-the-art hashing-based image retrieval systems, for each image, local descriptors are fir…
Content-Based Image RetrievalImage RetrievalRetrievalA Deep Hashing Learning Network
Hashing-based methods seek compact and efficient binary codes that preserve the neighborhood structure in the original data space. For most existing hashing methods, an image is first encoded as a vector of hand-crafted …
Deep HashingQuantizationSupervised Hashing with End-to-End Binary Deep Neural Network
Image hashing is a popular technique applied to large scale content-based visual retrieval due to its compact and efficient binary codes. Our work proposes a new end-to-end deep network architecture for supervised hashin…
Image RetrievalRetrievalPush for Quantization: Deep Fisher Hashing
Current massive datasets demand light-weight access for analysis. Discrete hashing methods are thus beneficial because they map high-dimensional data to compact binary codes that are efficient to store and process, while…
QuantizationSemantic SimilaritySemantic Textual SimilarityK-Means Hashing: An Affinity-Preserving Quantization Method for Learning Binary Compact Codes
In computer vision there has been increasing interest in learning hashing codes whose Hamming distance approximates the data similarity. The hashing functions play roles in both quantizing the vector space and generating…
ClusteringQuantization