标题:Efficient discrete latent semantic hashing for scalable cross-modal retrieval
作者:Lu, Xu; Zhu, Lei; Cheng, Zhiyong; Song, Xuemeng; Zhang, Huaxiang
作者机构:[Lu, Xu; Zhu, Lei; Zhang, Huaxiang] Shandong Normal Univ, Sch Informat Sci & Engn, Jinan 250014, Shandong, Peoples R China.; [Zhu, Lei; Zhang, Huaxi 更多
通讯作者:Zhu, Lei;Zhu, L;Zhang, HX;Zhu, L;Zhang, HX
通讯作者地址:[Zhu, L; Zhang, HX]Shandong Normal Univ, Sch Informat Sci & Engn, Jinan 250014, Shandong, Peoples R China;[Zhu, L; Zhang, HX]Shandong Normal Univ, Ins 更多
来源:SIGNAL PROCESSING
出版年:2019
卷:154
页码:217-231
DOI:10.1016/j.sigpro.2018.09.007
关键词:Cross-modal retrieval; Hashing; Matrix factorization; Latent semantic; information
摘要:Hashing has been widely exploited in the cross-modal retrieval applications in recent years for its low storage cost and high retrieval efficiency. However, most existing cross-modal hashing methods either fail to capture the discriminative semantics of multi-modal data or suffer from the relatively high training cost. To address these limitations, we propose an efficient Discrete Latent Semantic Hashing (DLSH) method. DLSH first learns the latent semantic representations of different modalities, and then projects them into a shared Hamming space to support the scalable cross-modal retrieval. Because DLSH directly correlates the explicit semantic labels with binary codes, it can enhance the discriminative capability of the learned hashing codes. Furthermore, to obtain binary codes, traditional methods often relax the discrete constraint, resulting in relatively high computation cost as well as quantization loss. In contrast, DLSH directly learns the binary codes with an efficient discrete hash optimization, and thus increases efficiency and reduces the quantization loss in hash optimization. Extensive experiments on several public datasets show that, DLSH outperforms several state-of-the-art cross-modal hashing methods. (C) 2018 Elsevier B.V. All rights reserved.
收录类别:EI;SCOPUS;SCIE
Scopus被引频次:5
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053187020&doi=10.1016%2fj.sigpro.2018.09.007&partnerID=40&md5=f43221c0f50b66363faff29cfb8bb6b8
TOP