Linear Subspace Ranking Hashing For Cross-Modal Retrieval

Keywords

Cross-modal hashing; image and text retrieval; large-scale similarity search; max-order-statistics; rank correlation measures; ranking subspace learning

Abstract

Hashing has attracted a great deal of research in recent years due to its effectiveness for the retrieval and indexing of large-scale high-dimensional multimedia data. In this paper, we propose a novel ranking-based hashing framework that maps data from different modalities into a common Hamming space where the cross-modal similarity can be measured using Hamming distance. Unlike existing cross-modal hashing algorithms where the learned hash functions are binary space partitioning functions, such as the sign and threshold function, the proposed hashing scheme takes advantage of a new class of hash functions closely related to rank correlation measures which are known to be scale-invariant, numerically stable, and highly nonlinear. Specifically, we jointly learn two groups of linear subspaces, one for each modality, so that features' ranking orders in different linear subspaces maximally preserve the cross-modal similarities. We show that the ranking-based hash function has a natural probabilistic approximation which transforms the original highly discontinuous optimization problem into one that can be efficiently solved using simple gradient descent algorithms. The proposed hashing framework is also flexible in the sense that the optimization procedures are not tied up to any specific form of loss function, which is typical for existing cross-modal hashing methods, but rather we can flexibly accommodate different loss functions with minimal changes to the learning steps. We demonstrate through extensive experiments on four widely-used real-world multimodal datasets that the proposed cross-modal hashing method can achieve competitive performance against several state-of-the-arts with only moderate training and testing time.

Publication Date

9-1-2017

Publication Title

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volume

39

Issue

9

Number of Pages

1825-1838

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/TPAMI.2016.2610969

Socpus ID

85029391713 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/85029391713

This document is currently not available here.

Share

COinS