.png){kind=icon}
Return
Image Retrieval with Query-Adaptive Hashing
.png){kind=icon}
PRE
AI
DOI：10.1145/2422956.2422958.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Hashing-based approximate nearest-neighbor search may well realize scalable content-based image retrieval. The existing semantic-preserving hashing methods leverage the labeled data to learn a fixed set of semantic-aware hash functions. However, a fixed hash function set is unable to well encode all semantic information simultaneously, and ignores the specific user's search intention conveyed by the query. In this article, we propose a query-adaptive hashing method which is able to generate the most appropriate binary codes for different queries. Specifically, a set of semantic-biased discriminant projection matrices are first learnt for each of the semantic concepts, through which a semantic-adaptable hash function set is learnt via a joint sparsity variable selection model. At query time, we further use the sparsity representation procedure to select the most appropriate hash function subset that is informative to the semantic information conveyed by the query. Extensive experiments over three benchmark image datasets well demonstrate the superiority of our proposed query-adaptive hashing method over the state-of-the-art ones in terms of retrieval accuracy.
Keywords:
Algorithms
Image retrieval
query-adaptive
hashing
joint sparsity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.0K
Citations:
5.4K
Organization
View more organizations
Cited Papers
ShareSaveShareSaveSea Anemone Genome Reveals Ancestral Eumetazoan Gene Repertoire and Genomic Organization.png)
Science
OAAI
ScienceIF0
OAAIShareSaveShareSave no more