arrow
返回

Dynamic Affinity Graph Construction for Spectral Clustering Using Multiple Features

delete2018-12-01
delete227
PRE
AI
李志慧 (Zhihui Li)
聂飞平 (Feiping Nie) *
X
Xiaojun Chang *
Y
Yi Yang
张承启 (Chengqi Zhang)
N
Nicu Sebe
DOI:10.1109/TNNLS.2018.2829867delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Spectral clustering (SC) has been widely applied to various computer vision tasks, where the key is to construct a robust affinity matrix for data partitioning. With the increase in visual features, conventional SC methods are facing two challenges: 1) how to effectively generate an affinity matrix based on multiple features? and 2) how to deal with high-dimensional visual features which could be redundant? To address these issues mentioned earlier, we present a new approach to: 1) learn a robust affinity matrix using multiple features, allowing us to simultaneously determine optimal weights for each feature; and 2) decide a set of optimal projection matrixes, one for each feature, that decide the lower dimensional space, as well as the optimal affinity weight of each data pair in the lower dimensional space. There are two major advantages of our new approach over the existing clustering techniques. First, our approach assigns affinity weights for data points on a per-data-pair basis. The learning procedure avoids the explicit specification of the size of the neighborhood in the affinity matrix, and the bandwidth parameter required to compute the Gaussian kernel, both of which are sensitive and yet difficult to determine beforehand. Second, the affinity weights are based on the distances in a lower dimensional space, while the low-dimensional space is inferred according to the optimized affinity weights. Both variables are jointly optimized so as to leverage mutual benefits. The experimental results outperform the compared alternatives, which indicate that the proposed method is effective in simultaneously learning the affinity graph and feature fusion, resulting in better clustering results.
Keyword:
Affinity graph generation
multifeature
spectral clustering (SC)
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Neural Networks and Learning Systems 封面图
IEEE Transactions on Neural Networks and Learning Systems
IF:
8.9
论文数:
7.5K
被引数:
7.2W

机构

U
University of Trento
学者数:
8.8K
论文数: 9.0K
被引数: 1.2W
C
Carnegie Mellon University
学者数:
1.4W
论文数: 1.4W
被引数: 2.7W
N
Northwestern Polytechnical University
学者数:
4.6W
论文数: 3.7W
被引数: 5.3W
U
university of technology sydney
学者数:
1.6W
论文数: 2.0W
被引数: 25
学者 查看更多机构
引用论文

引用论文

Image Clustering Using Local Discriminant Models and Global Integration
err2010-10-01
err308
PREAI
errYang, Yi; Xu, Dong; Nie, Feiping; Yan, Shuicheng; Zhuang, Yueting
err分享
err收藏
Annealing effects of aluminum silicate films grown on Si(100)Si(100) 上生长的硅酸铝薄膜的退火效应
err2002-05-07
err0
errOAAI
errM.-H. Cho; Y. S. Rho; H.-J. Choi; S. W. Nam; D.-H. Ko; J. H. Ku; H. C. Kang; D. Y. Noh; C. N. Whang; K. Jeong
err分享
err收藏
学者 查看更多内容