arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2011.11586cs.CV
收藏

基于散射变换的正交补投影图像聚类

Scattering Transform Based Image Clustering using Projection onto Orthogonal Complement

University of Erlangen-Nuremberg(埃尔朗根-纽伦堡大学)

Angel Villar-Corrales, Veniamin I. Morgenshtern

摘要:

在过去的几年里,图像聚类的巨大改进是由深度学习的最新进展推动的。然而,由于深度神经网络的架构复杂性,没有数学理论可以解释深度聚类技术的成功。在这项工作中,我们介绍了投影散射谱聚类(PSSC),一个国家的最先进的,稳定的,快速的图像聚类算法,这也是数学上的解释。PSSC包括利用小图像的散射变换的几何结构的新方法。该方法的灵感来自于这样的观察,即在散射变换域中,由对应于各个类别的数据矩阵的几个最大特征值的特征向量形成的子空间几乎在不同类别之间共享。因此,将这些共享子空间投影出去可以减少类内的可变性,从而大大提高聚类性能。我们称这种方法为投影到正交补(POC)。实验结果表明,PSSC在所有浅聚类算法中获得了最好的结果。此外,它实现了类似的聚类性能,最近的国家的最先进的聚类技术,同时减少了一个以上的数量级的执行时间。本着可重复研究的精神,我们在论文中发布了一个高质量的代码库。

英文摘要:

In the last few years, large improvements in image clustering have been driven by the recent advances in deep learning. However, due to the architectural complexity of deep neural networks, there is no mathematical theory that explains the success of deep clustering techniques. In this work we introduce Projected-Scattering Spectral Clustering (PSSC), a state-of-the-art, stable, and fast algorithm for image clustering, which is also mathematically interpretable. PSSC includes a novel method to exploit the geometric structure of the scattering transform of small images. This method is inspired by the observation that, in the scattering transform domain, the subspaces formed by the eigenvectors corresponding to the few largest eigenvalues of the data matrices of individual classes are nearly shared among different classes. Therefore, projecting out those shared subspaces reduces the intra-class variability, substantially increasing the clustering performance. We call this method Projection onto Orthogonal Complement (POC). Our experiments demonstrate that PSSC obtains the best results among all shallow clustering algorithms. Moreover, it achieves comparable clustering performance to that of recent state-of-the-art clustering techniques, while reducing the execution time by more than one order of magnitude. In the spirit of reproducible research, we publish a high quality code repository along with the paper.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑