arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.02572cs.LG
收藏

越贪婪越好:每次迭代选择多个邻居进行稀疏子空间聚类

Greedier is Better: Selecting Multiple Neighbors per Iteration for Sparse Subspace Clustering

National Yang Ming Chiao Tung University(国立阳明交通大学);Mississippi State University(密西西比州立大学)

Jwo-Yuh Wu, Liang-Chi Huang, Wen-Hsuan Li, Chun-Hung Liu, Rung-Hung Gau

摘要:

稀疏子空间聚类(SSC)使用基于贪婪的邻居选择,如正交匹配追踪(OMP),已被称为一个流行的计算效率高的替代流行的基于L1最小化的方法。本文提出了一种新的SSC计划,使用广义OMP(GOMP),一个汤的OMP,从而确定多个邻居,每次迭代,随着一个新的停止规则,只需要一个知识的环境信号的尺寸。与每次迭代识别一个邻居的常规OMP相比,所提出的GOMP方法涉及较少的迭代,从而享有较低的算法复杂度;有利地,所提出的停止规则不受子空间维度和噪声功率的离线估计的影响。在半随机模型下,分析性能保证,在邻居恢复率方面,建立证明所提出的GOMP的优势。实验结果表明,GOMP算法能够以较高的概率(i)被所提出的停止规则停止,(ii)比OMP算法能够检索到更多的真实邻居,从而获得更高的最终数据聚类精度.使用合成数据和真实人脸数据的计算机模拟提供了验证我们的分析研究和证据所提出的方法的有效性。

英文摘要:

Sparse subspace clustering (SSC) using greedy-based neighbor selection, such as orthogonal matching pursuit (OMP), has been known as a popular computationally-efficient alternative to the popular L1-minimization based methods. This paper proposes a new SSC scheme using generalized OMP (GOMP), a soup-up of OMP whereby multiple neighbors are identified per iteration, along with a new stopping rule requiring nothing more than a knowledge of the ambient signal dimension. Compared to conventional OMP, which identifies one neighbor per iteration, the proposed GOMP method involves fewer iterations, thereby enjoying lower algorithmic complexity; advantageously, the proposed stopping rule is free from off-line estimation of subspace dimension and noise power. Under the semi-random model, analytic performance guarantees, in terms of neighbor recovery rates, are established to justify the advantage of the proposed GOMP. The results show that, with a high probability, GOMP (i) is halted by the proposed stopping rule, and (ii) can retrieve more true neighbors than OMP, consequently yielding higher final data clustering accuracy. Computer simulations using both synthetic data and real human face data are provided to validate our analytic study and evidence the effectiveness of the proposed approach.

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

↑