ACM Transactions on Multimedia Computing Communications and Applications · 2021 · 58 citations · 31 references
ComputingComputer ScienceData ScienceData MiningInformation RetrievalMachine LearningDimensionality ReductionMatrix FactorizationMultimedia RetrievalCross-modal Representation LearningCross-modal RetrievalHashingLatent Semantic AnalysisMulti-modal RetrievalMultimodal RetrievalSemantic HashingShared Latent Space Learning
Hashing methods have sparked a great revolution on large-scale cross-media search due to its effectiveness and efficiency. Most existing approaches learn unified hash representation in a common Hamming space to represent all multimodal data. However, the unified hash codes may not characterize the cross-modal data discriminatively, because the data may vary greatly due to its different dimensionalities, physical properties, and statistical information. In addition, most existing supervised cross-modal algorithms preserve the similarity relationship by constructing an n × n pairwise similarity matrix, which requires a large amount of calculation and loses the category information. To mitigate these issues, a novel cross-media hashing approach is proposed in this article, dubbed label flexible matrix factorization hashing (LFMH). Specifically, LFMH jointly learns the modality-specific latent subspace with similar semantic by the flexible matrix factorization. In addition, LFMH guides the hash learning by utilizing the semantic labels directly instead of the large n × n pairwise similarity matrix. LFMH transforms the heterogeneous data into modality-specific latent semantic representation. Therefore, we can obtain the hash codes by quantifying the representations, and the learned hash codes are consistent with the supervised labels of multimodal data. Then, we can obtain the similar binary codes of the corresponding modality, and the binary codes can characterize such samples flexibly. Accordingly, the derived hash codes have more discriminative power for single-modal and cross-modal retrieval tasks. Extensive experiments on eight different databases demonstrate that our model outperforms some competitive approaches.
31
The Pascal Visual Object Classes (VOC) Challenge
Mark Everingham, Luc Van Gool, Christopher K. I. Williams et al. · International Journal of Computer Vision · 2009 · 19.5K citations · Full text
LabelMe: A Database and Web-Based Tool for Image Annotation
Bryan Russell, Antonio Torralba, Kevin Murphy et al. · International Journal of Computer Vision · 2007 · 4.2K citations · Full text
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