首页> 外文会议>International Conference on Digital Image Processing >Sparse Subspace Clustering with One-way Selective Orthogonal Matching Pursuit
【24h】

Sparse Subspace Clustering with One-way Selective Orthogonal Matching Pursuit

机译:具有单向选择性正交匹配追踪的稀疏子空间聚类

获取原文
获取外文期刊封面目录资料

摘要

Orthogonal matching pursuit (OMP) has gained remarkable achievements in the domain of Sparse Subspace Clustering (SSC) for image clustering. However, current methods based on OMP improves the clustering accuracy by adding additional operations, which increase computational complexity. In this paper, a novel SSC algorithm with one-way selective orthogonal matching pursuit (SSC-OWSOMP) is proposed to improve the clustering accuracy without increasing the computational complexity in the SSC-OMP-based methods. In our SSC-OWSOMP, a one-way selective module is designed to avoid mutual selection among data points, which can enrich the information used for clustering without adding additional operations. Experimental results demonstrate that, with the SSC-OWSOMP, not only the clustering accuracy can be improved but also the time complexity be kept, also the SSC-OWSOMP is suitable for the data sets with high sample density.
机译:正交匹配追踪(OMP)在用于图像聚类的稀疏子空间聚类(SSC)领域中取得了显著成就。但是,当前基于OMP的方法通过添加其他操作来提高聚类精度,这会增加计算复杂性。本文提出了一种新的具有单向选择性正交匹配追踪的SSC算法(SSC-OWSOMP),以提高聚类精度,而不会增加基于SSC-OMP的方法的计算复杂性。在我们的SSC-OWSOMP中,单向选择模块旨在避免数据点之间的相互选择,从而可以在不增加其他操作的情况下丰富用于群集的信息。实验结果表明,利用SSC-OWSOMP不仅可以提高聚类精度,而且可以保持时间复杂度,而且SSC-OWSOMP适用于高样本密度的数据集。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号