Proceedings of the 2018 ACM on International Conference on Multimedia Retrieval 2018
DOI: 10.1145/3206025.3206026
|View full text |Cite
|
Sign up to set email alerts
|

Transductive Zero-Shot Hashing via Coarse-to-Fine Similarity Mining

Abstract: Zero-shot Hashing (ZSH) is to learn hashing models for novel/target classes without training data, which is an important and challenging problem. Most existing ZSH approaches exploit transfer learning via an intermediate shared semantic representations between the seen/source classes and novel/target classes. However, due to having disjoint, the hash functions learned from the source dataset are biased when applied directly to the target classes. In this paper, we study the transductive ZSH, i.e., we have unla… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 30 publications
0
4
0
Order By: Relevance
“…Specifically, they leverage the hash codes to capture the semantic similarity relationship in a transferable semantic embedding space and propose a center regularization loss to preserve both intraconcept similarity and inter-concept distance. In addition, under the transductive setting [25], [26], Lai et al [27] propose a transductive zero-shot hashing method via coarse-to-fine similarity mining. In this way, a greedy binary classification network is first used to detect the most informative images from unseen category images.…”
Section: B Zero-shot Hashingmentioning
confidence: 99%
“…Specifically, they leverage the hash codes to capture the semantic similarity relationship in a transferable semantic embedding space and propose a center regularization loss to preserve both intraconcept similarity and inter-concept distance. In addition, under the transductive setting [25], [26], Lai et al [27] propose a transductive zero-shot hashing method via coarse-to-fine similarity mining. In this way, a greedy binary classification network is first used to detect the most informative images from unseen category images.…”
Section: B Zero-shot Hashingmentioning
confidence: 99%
“…To narrow the domain gap between seen data and unseen data, ZSH-DA [25] first learns a zero-shot hashing model on seen data, and then learns the final hashing model with a domain-adaptation algorithm. In [26], a transductive zeroshot hashing network (TZSH) was proposed, which contains a coarse-to-fine similarity mining to find most presentative target examples of each unseen labels, and adds these presentative examples and its corresponding predicted labels to the process of supervised hashing learning.…”
Section: Related Workmentioning
confidence: 99%
“…We compare our method (T-MLZSH) with several stateof-the-art hashing methods, including KSH [2], SDH [4], IMH [3], DHN [18], ZSH-DA [25], ZSH [23], TZSH [26]. Among these comparison methods, KSH and SDH are two typical supervised methods, IMH is one of the most representative unsupervised hashing methods, DHN is a deep learningbased supervised methods, ZSH-DA and ZSH are two zeroshot hashing methods, and TZSH is a transductive zero-shot hashing method.…”
Section: B Implementation Detailsmentioning
confidence: 99%
“…ZSH aims to encode samples of unseen categories with the hash functions trained using only samples of seen categories, and by leveraging the techniques of supervised hashing and ZSL. Although ZSH methods [15], [18], [19], [20] achieve an impressive performance, they still have some limitations. They only focus on data with one modality, where both the query and the retrieval sets are in the same modality.…”
Section: Introductionmentioning
confidence: 99%