中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Smooth Neighborhood Structure Mining on Multiple Affinity Graphs with Applications to Context-Sensitive Similarity

文献类型:会议论文

作者Song Bai; Shaoyan Sun; Xiang Bai; Zhaoxiang Zhang; Qi Tian
出版日期2016-10-11
会议日期October 11-14, 2016
会议地点Amsterdam, The Netherlands
关键词Diffusion Process Image/shape Retrieval Affinity Graph
英文摘要Due to the ability of capturing geometry structures of the data manifold, diffusion process has demonstrated impressive performances in retrieval task by spreading the similarities on the affinity graph. In view of robustness to noise edges, diffusion process is usually localized, i.e., only propagating similarities via neighbors. However, selecting neighbors smoothly on graph-based manifolds is more or less ignored by previous works. In this paper, we propose a new algorithm called Smooth Neighborhood (SN) that mines the neighborhood structure to satisfy the manifold assumption. By doing so, nearby points on the underlying manifold are guaranteed to yield similar neighbors as much as possible. Moreover, SN is adjusted to tackle multiple affinity graphs by imposing a weight learning paradigm, and this is the primary difference compared with related works which are only applicable with one affinity graph. Exhausted experimental results and comparisons against other algorithms manifest the effectiveness of the proposed algorithm.
会议录ECCV 2016
源URL[http://ir.ia.ac.cn/handle/173211/13250]  
专题自动化研究所_智能感知与计算研究中心
通讯作者Zhaoxiang Zhang
推荐引用方式
GB/T 7714
Song Bai,Shaoyan Sun,Xiang Bai,et al. Smooth Neighborhood Structure Mining on Multiple Affinity Graphs with Applications to Context-Sensitive Similarity[C]. 见:. Amsterdam, The Netherlands. October 11-14, 2016.

入库方式: OAI收割

来源:自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。