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 | |
会议名称 | The 14th European Conference on Computer Vision |
会议录名称 | ECCV 2016 |
会议日期 | October 11-14, 2016 |
会议地点 | Amsterdam, The Netherlands |
摘要 | 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. |
关键词 | Diffusion Process Image/shape Retrieval Affinity Graph |
文献类型 | 会议论文 |
条目标识符 | 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],2016. |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论