Deep Hashing with Hash-Consistent Large Margin Proxy Embeddings
Image hash codes are produced by binarizing the embeddings of convolutional neural networks (CNN) trained for either classification or retrieval. While proxy embeddings achieve good performance on both tasks, they are non-trivial to binarize, due to a rotational ambiguity that encourages non-binary embeddings. The use of a fixed set of proxies (weights of the CNN classification layer) is proposed to eliminate this ambiguity, and a procedure to design proxy sets that are nearly optimal for both classification and hashing is introduced. The resulting hash-consistent large margin (HCLM) proxies are shown to encourage saturation of hashing units, thus guaranteeing a small binarization error, while producing highly discriminative hash-codes. A semantic extension (sHCLM), aimed to improve hashing performance in a transfer scenario, is also proposed. Extensive experiments show that sHCLM embeddings achieve significant improvements over state-of-the-art hashing procedures on several small and large datasets, both within and beyond the set of training classes.
Code (0)
등록된 구현이 없습니다.
Tasks
BinarizationClassificationDeep HashingGeneral ClassificationRetrievalSimilar Papers 제목 키워드 기반
Deep Cross-modal Hashing via Margin-dynamic-softmax Loss
Due to their high retrieval efficiency and low storage cost for cross-modal search task, cross-modal hashing methods have attracted considerable attention. For the supervised cross-modal hashing methods, how to make the …
Cross-Modal RetrievalRetrievalDocument Hashing with Mixture-Prior Generative Models
Hashing is promising for large-scale information retrieval tasks thanks to the efficiency of distance evaluation between binary codes. Generative hashing is often used to generate hashing codes in an unsupervised way. Ho…
Information RetrievalRetrievalVariable-Length Hashing
Hashing has emerged as a popular technique for large-scale similarity search. Most learning-based hashing methods generate compact yet correlated hash codes. However, this redundancy is storage-inefficient. Hence we prop…
Code SearchRetrievalError-Corrected Margin-Based Deep Cross-Modal Hashing for Facial Image Retrieval
Cross-modal hashing facilitates mapping of heterogeneous multimedia data into a common Hamming space, which can beutilized for fast and flexible retrieval across different modalities. In this paper, we propose a novel cr…
AttributeDecoderFace Image RetrievalImage Retrieval+1Unsupervised Deep Generative Adversarial Hashing Network
Unsupervised deep hash functions have not shown satisfactory improvements against the shallow alternatives, and usually, require supervised pretraining to avoid getting stuck in bad local minima. In this paper, we propos…
ClusteringImage ClusteringImage RetrievalRetrieval+1