Hashing In The Zero Shot Framework With Domain Adaptation

Abstract

Techniques to learn hash codes which can store and retrieve large dimensional multimedia data efficiently have attracted broad research interests in the recent years. With rapid explosion of newly emerged concepts and online data, existing supervised hashing algorithms suffer from the problem of scarcity of ground truth annotations due to the high cost of obtaining manual annotations. Therefore, we propose an algorithm to learn a hash function from training images belonging to `seen' classes which can efficiently encode images of `unseen' classes to binary codes. Specifically, we project the image features from visual space and semantic features from semantic space into a common Hamming subspace. Earlier works to generate hash codes have tried to relax the discrete constraints on hash codes and solve the continuous optimization problem. However, it often leads to quantization errors. In this work, we use the max-margin classifier to learn an efficient hash function. To address the conc

Stats

• citations22
• S2 citations—
• github stars0
• HF likes0
• heat score10.21
• arxiv keypachori2017hashing

Related papers

• Zero-shot Hashing Via Transferring Supervised Knowledge (2016)15.48
• Transductive Zero-shot Hashing For Multilabel Image Retrieval (2019)8.82
• Deep Supervised Discrete Hashing (2017)0.00
• Discriminative Supervised Hashing For Cross-modal Similarity Search (2018)7.81
• Transductive Zero-shot Hashing Via Coarse-to-fine Similarity Mining (2017)5.84
• Cross-modal Zero-shot Hashing (2019)8.09
• One Network For Multi-domains: Domain Adaptive Hashing With Intersectant Generative Adversarial Network (2019)7.81
• Unsupervised Deep Hashing For Large-scale Visual Search (2016)9.59