Unsupervised Topic Hypergraph Hashing for Efficient Mobile Image Retrieval

Lei Zhu, Jialie Shen, Liang Xie, Zhiyong Cheng

Research output: Contribution to journalArticlepeer-review

83 Citations (Scopus)

Abstract

Hashing compresses high-dimensional features into compact binary codes. It is one of the promising techniques to support efficient mobile image retrieval, due to its low data transmission cost and fast retrieval response. However, most of existing hashing strategies simply rely on low-level features. Thus, they may generate hashing codes with limited discriminative capability. Moreover, many of them fail to exploit complex and high-order semantic correlations that inherently exist among images. Motivated by these observations, we propose a novel unsupervised hashing scheme, called topic hypergraph hashing (THH), to address the limitations. THH effectively mitigates the semantic shortage of hashing codes by exploiting auxiliary texts around images. In our method, relations between images and semantic topics are first discovered via robust collective non-negative matrix factorization. Afterwards, a unified topic hypergraph, where images and topics are represented with independent vertices and hyperedges, respectively, is constructed to model inherent high-order semantic correlations of images. Finally, hashing codes and functions are learned by simultaneously enforcing semantic consistence and preserving the discovered semantic relations. Experiments on publicly available datasets demonstrate that THH can achieve superior performance compared with several state-of-the-art methods, and it is more suitable for mobile image retrieval.
Original languageEnglish
Pages (from-to)3941-3954
Number of pages14
JournalIEEE Transactions on Cybernetics
Volume47
Issue number11
Early online date21 Oct 2017
DOIs
Publication statusPublished - Nov 2017

Fingerprint

Dive into the research topics of 'Unsupervised Topic Hypergraph Hashing for Efficient Mobile Image Retrieval'. Together they form a unique fingerprint.

Cite this