Tensor-SVD Based Graph Learning for Multi-View Subspace Clustering

doi:10.1609/aaai.v34i04.5807

Tensor-SVD Based Graph Learning for Multi-View Subspace Clustering

2020-04-03

0

OA

AI

DOI：10.1609/aaai.v34i04.5807

原文链接

查看原文

摘要

En 中文

Low-rank representation based on tensor-Singular Value Decomposition (t-SVD) has achieved impressive results for multi-view subspace clustering, but it does not well deal with noise and illumination changes embedded in multi-view data. The major reason is that all the singular values have the same contribution in tensor-nuclear norm based on t-SVD, which does not make sense in the existence of noise and illumination change. To improve the robustness and clustering performance, we study the weighted tensor-nuclear norm based on t-SVD and develop an efficient algorithm to optimize the weighted tensor-nuclear norm minimization (WTNNM) problem. We further apply the WTNNM algorithm to multi-view subspace clustering by exploiting the high order correlations embedded in different views. Extensive experimental results reveal that our WTNNM method is superior to several state-of-the-art multi-view subspace clustering methods in terms of performance.

Tensor-SVD Based Graph Learning for Multi-View Subspace Clustering

摘要

AI总结

期刊

机构

引用论文