arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1811.04460eess.SPcs.DM
收藏

分析与综合--图上(共)稀疏信号模型的研究

Analysis vs Synthesis - An Investigation of (Co)sparse Signal Models on Graphs

Madeleine S. Kotzagiannidis, Mike E. Davies

摘要:

在这项工作中,我们提出了一个理论研究的信号与稀疏表示在顶点域的图,这主要是由分别采用合成和分析视图的图形拉普拉斯矩阵所产生的差异的动机。稀疏图,特别是稀疏的信号的子空间的特征,相对于图的连通性,诱导分析与一个合适的图形算子,仍然是一般的一个不透明的概念,我们的目的是阐明。通过利用cosparsity的理论,我们提出了一种新的(co)稀疏图拉普拉斯信号模型和特征的基本(结构化)(co)稀疏性,光滑性和本地化的无向图的解决方案的子空间,同时提供更精细的语句的特殊情况下,如循环图。最终,我们证实了在这种结构化的设置的cosparse分析和稀疏合成模型之间的根本差异,通过证明前者构成了一个特殊的,受约束的情况下,后者。

英文摘要:

In this work, we present a theoretical study of signals with sparse representations in the vertex domain of a graph, which is primarily motivated by the discrepancy arising from respectively adopting a synthesis and analysis view of the graph Laplacian matrix. Sparsity on graphs and, in particular, the characterization of the subspaces of signals which are sparse with respect to the connectivity of the graph, as induced by analysis with a suitable graph operator, remains in general an opaque concept which we aim to elucidate. By leveraging the theory of cosparsity, we present a novel (co)sparse graph Laplacian-based signal model and characterize the underlying (structured) (co)sparsity, smoothness and localization of its solution subspaces on undirected graphs, while providing more refined statements for special cases such as circulant graphs. Ultimately, we substantiate fundamental discrepancies between the cosparse analysis and sparse synthesis models in this structured setting, by demonstrating that the former constitutes a special, constrained instance of the latter.

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

↑