IEEE Transactions on Image Processing · 2019 · 170 citations · 49 references
ComputingComputer ScienceData MiningInformation RetrievalMachine LearningHash FunctionsHash TablesMatrix FactorizationMultimedia RetrievalNearest Neighbor SearchBinary CodesCross-modal RetrievalHashingLatent Factor ModelsRetrievalSimilarity SearchTrainingTraining Time
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 that of 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 that of the 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 the DLFH can achieve significantly better accuracy than existing methods, and the training time of DLFH is comparable to that of the relaxation-based continuous methods which are much faster than the existing discrete methods.
49
Tat‐Seng Chua, Jinhui Tang, Richang Hong et al. · 2009 · 3K citations
Locality-sensitive hashing scheme based on p-stable distributions
Mayur Datar, Nicole Immorlica, Piotr Indyk et al. · 2004 · 3K citations
The MIR flickr retrieval evaluation
Mark J. Huiskes, Michael S. Lew · 2008 · 1.8K citations
Neighborhood preserving embedding
Xiaofei He, Deng Cai, Shuicheng Yan · 2005 · 1.5K citations