Sparse Multi-Modal Hashing

IEEE Transactions on Multimedia(2014)

引用 143|浏览112
暂无评分
摘要
Learning hash functions across heterogenous high-dimensional features is very desirable for many applications involving multi-modal data objects. In this paper, we propose an approach to obtain the sparse codesets for the data objects across different modalities via joint multi-modal dictionary learning, which we call sparse multi-modal hashing (abbreviated as ${\rm SM}^{2}{\rm H}$). In ${\rm SM}^{2}{\rm H}$, both intra-modality similarity and inter-modality similarity are first modeled by a hypergraph, then multi-modal dictionaries are jointly learned by Hypergraph Laplacian sparse coding. Based on the learned dictionaries, the sparse codeset of each data object is acquired and conducted for multi-modal approximate nearest neighbor retrieval using a sensitive Jaccard metric. The experimental results show that ${\rm SM}^{2}{\rm H}$ outperforms other methods in terms of mAP and Percentage on two real-world data sets.
更多
查看译文
关键词
Dictionaries,Dinosaurs,Correlation,Search problems,Artificial neural networks,Data models,Feature extraction
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要