Optimal Projection Guided Transfer Hashing for Image Retrieval

03/01/2019
by   Ji Liu, et al.
0

Recently, learning to hash has been widely studied for image retrieval thanks to the computation and storage efficiency of binary codes. For most existing learning to hash methods, sufficient training images are required and used to learn precise hashing codes. However, in some real-world applications, there are not always sufficient training images in the domain of interest. In addition, some existing supervised approaches need a amount of labeled data, which is an expensive process in term of time, label and human expertise. To handle such problems, inspired by transfer learning, we propose a simple yet effective unsupervised hashing method named Optimal Projection Guided Transfer Hashing (GTH) where we borrow the images of other different but related domain i.e., source domain to help learn precise hashing codes for the domain of interest i.e., target domain. Besides, we propose to seek for the maximum likelihood estimation (MLE) solution of the hashing functions of target and source domains due to the domain gap. Furthermore,an alternating optimization method is adopted to obtain the two projections of target and source domains such that the domain hashing disparity is reduced gradually. Extensive experiments on various benchmark databases verify that our method outperforms many state-of-the-art learning to hash methods. The implementation details are available at https://github.com/liuji93/GTH.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/13/2016

Transfer Hashing with Privileged Information

Most existing learning to hash methods assume that there are sufficient ...
research
12/13/2017

Transfer Adversarial Hashing for Hamming Space Retrieval

Hashing is widely applied to large-scale image retrieval due to the stor...
research
07/01/2019

One Network for Multi-Domains: Domain Adaptive Hashing with Intersectant Generative Adversarial Network

With the recent explosive increase of digital data, image recognition an...
research
06/10/2020

Dual-level Semantic Transfer Deep Hashing for Efficient Social Image Retrieval

Social network stores and disseminates a tremendous amount of user share...
research
06/25/2022

Asymmetric Transfer Hashing with Adaptive Bipartite Graph Learning

Thanks to the efficient retrieval speed and low storage consumption, lea...
research
02/29/2020

Image Hashing by Minimizing Independent Relaxed Wasserstein Distance

Image hashing is a fundamental problem in the computer vision domain wit...
research
06/10/2017

On Hash-Based Work Distribution Methods for Parallel Best-First Search

Parallel best-first search algorithms such as Hash Distributed A* (HDA*)...

Please sign up or login with your details

Forgot password? Click here to reset