GrowBit: Incremental Hashing for Cross-Modal Retrieval

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cross-modal retrieval using hashing techniques is gaining increasing importance due to its efficient storage, scalability and fast query processing speeds. In this work, we address a related and relatively unexplored problem: given a set of cross-modal data with their already learned hash codes, can we increase the number of bits to better represent the data without relearning everything? This scenario is especially important when the number of tags describing the data increases, necessitating longer hash codes for better representation. To tackle this problem, we propose a novel approach called GrowBit, which incrementally learns the bits in the hash code and thus utilizes all the bits learned so far. We develop a two-stage approach for learning the hash codes and hash functions separately, utilizing a recent formulation which decouples over the bits so that it can incorporate the incremental approach. Experiments on MirFlickr, IAPR-TC-12 and NUS-WIDE datasets show the usefulness of the proposed approach.

Cite

CITATION STYLE

APA

Mandal, D., Annadani, Y., & Biswas, S. (2019). GrowBit: Incremental Hashing for Cross-Modal Retrieval. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11364 LNCS, pp. 305–321). Springer Verlag. https://doi.org/10.1007/978-3-030-20870-7_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free