返回
Scalable graph based non-negative multi-view embedding for image ranking
DOI:10.1016/j.neucom.2016.06.097.png)
摘要
En 中文
Due to the well-known semantic gap, content based image retrieval task is still a challenge problem. The performance of image ranking highly depends on feature representation. In this paper, trying to make a more discriminative feature, we propose a multi-graph based non-negative feature embedding framework for image ranking. In this framework, various image features are embedded into a unified latent space by a learned graph based non-negative multi-view embedding model. In this model, a multi-graph based regularization term, which discovers the intrinsic geometrical and the discriminating structure of the data space, is imposed into the non-negative matrix factorization. The framework learns to find an optimized combination of different Laplacian matrices to approximate the intrinsic manifold automatically. Meanwhile, multiple anchor graphs are utilized to reduce the complexity of computational. Finally, ranking is conducted according to the relevance score inferred by a Markov random field. Extensive experiments prove the effectiveness of proposed method. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Image retrieval
Ranking
Multiview embedding
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Large scale image annotation: learning to rank with joint word-image embeddings
MACHINE LEARNING
IF2.9
Low rank approximation with sparse integration of multiple manifolds for data representation用于数据表示的多流形稀疏集成的低秩近似
APPLIED INTELLIGENCE
IF3.5
A locally weighted sparse graph regularized Non-Negative Matrix Factorization method一种局部加权稀疏图正则化非负矩阵分解方法
NEUROCOMPUTING
IF6.5

