.png){kind=icon}
返回
Graph regularized supervised cross-view hashing
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-018-5988-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Hashing methods have received significant attention for effective and efficient large scale similarity search in computer vision and information retrieval community. However, most existing cross-view hashing methods mainly focus on either similarity preservation of data or cross-view correlation. In this paper, we propose a graph regularized supervised cross-view hashing (GSCH) to preserve both the semantic correlation and the intra-view and inter view similarity simultaneously. In particular, GSCH uses intra-view similarity to estimate inter-view similarity structure. We further propose a sequential learning approach to derive the hashing function for each view. Experimental results on benchmark datasets against state-of-the-art methods show the effectiveness of our proposed method.
Keyword:
Hashing
Cross-view retrieval
Spectral relaxation
Sequential learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
2.0W
被引数:
3.2W
机构
引用论文
分享收藏Learning unified binary codes for cross-modal retrieval via latent semantic hashing.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏Towards unsupervised physical activity recognition using smartphone accelerometers使用智能手机加速度计进行无监督的身体活动识别
PREAI
分享收藏
查看更多内容