arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.04072eess.SPcs.ITmath.IT
收藏

多稀疏输入可逆图滤波器的盲辨识

Blind Identification of Invertible Graph Filters with Multiple Sparse Inputs

Chang Ye, Rasoul Shafipour, Gonzalo Mateos

摘要:

本文研究了图滤波器及其稀疏输入信号的盲辨识问题,从而将经典的时空信号盲反卷积的应用范围扩展到不规则图域。虽然观测值是未知数的双线性函数,但对滤波器的可逆性的温和要求使得能够实现有效的凸公式化,而不依赖于可能阻碍对大型图的适用性的矩阵提升。在缩放的顶部,有人认为,(非循环)置换歧义可能会出现一些特定的图形。确定性的充分条件下,建议的凸松弛可以准确地恢复未知数的陈述,以及那些保证可识别性下的伯努利-高斯模型的输入。合成和真实世界的网络的数值测试说明了所提出的算法的优点,以及利用多个信号来帮助扩散源的(盲)定位的好处。

英文摘要:

This paper deals with problem of blind identification of a graph filter and its sparse input signal, thus broadening the scope of classical blind deconvolution of temporal and spatial signals to irregular graph domains. While the observations are bilinear functions of the unknowns, a mild requirement on invertibility of the filter enables an efficient convex formulation, without relying on matrix lifting that can hinder applicability to large graphs. On top of scaling, it is argued that (non-cyclic) permutation ambiguities may arise with some particular graphs. Deterministic sufficient conditions under which the proposed convex relaxation can exactly recover the unknowns are stated, along with those guaranteeing identifiability under the Bernoulli-Gaussian model for the inputs. Numerical tests with synthetic and real-world networks illustrate the merits of the proposed algorithm, as well as the benefits of leveraging multiple signals to aid the (blind) localization of sources of diffusion.

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

↑