Discrete Latent Factor Model for Cross-Modal Hashing
- 6 February 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 28 (7) , 3490-3501
Abstract
Due to its storage and retrieval efficiency, cross-modal hashing (CMH) has been widely used for cross-modal similarity search in many multimedia applications. According to the training strategy, existing CMH methods can be mainly divided into two categories: relaxation-based continuous methods and discrete methods. In general, the training of relaxation-based continuous methods is faster than discrete methods, but the accuracy of relaxation-based continuous methods is not satisfactory. On the contrary, the accuracy of discrete methods is typically better than relaxation-based continuous methods, but the training of discrete methods is very time-consuming. In this paper, we propose a novel CMH method, called discrete latent factor model based cross-modal hashing (DLFH), for cross modal similarity search. DLFH is a discrete method which can directly learn the binary hash codes for CMH. At the same time, the training of DLFH is efficient. Experiments show that DLFH can achieve significantly better accuracy than existing methods, and the training time of DLFH is comparable to that of relaxation-based continuous methods which are much faster than existing discrete methods.Keywords
All Related Versions
Funding Information
- NSFC-NRF Joint Research Project (61861146001)
- National Natural Science Foundation of China (61472182)
This publication has 37 references indexed in Scilit:
- Optimal Data-Dependent Hashing for Approximate Near Neighbors2015
- Semantics-preserving hashing for cross-view retrieval2015
- Supervised hashing with latent factor models2014
- Fast Supervised Hashing with Decision Trees for High-Dimensional Data2014
- A probabilistic model for multimodal hash function learning2012
- Multiple feature hashing for real-time large scale near-duplicate video retrieval2011
- Composite hashing with multiple information sources2011
- The segmented and annotated IAPR TC-12 benchmarkComputer Vision and Image Understanding, 2010
- NUS-WIDE2009
- Monotonicity of quadratic-approximation algorithmsAnnals of the Institute of Statistical Mathematics, 1988