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

寻找GEMS:高维图形信号的多尺度字典

Finding GEMS: Multi-Scale Dictionaries for High-Dimensional Graph Signals

Yael Yankelevsky, Michael Elad

摘要:

现代数据对传统的信号处理方法提出了新的挑战,导致人们对图形信号处理领域的兴趣日益浓厚。一个强大的和良好建立的模型,为现实世界的信号在各个领域是稀疏表示字典,结合训练的能力,从信号的例子字典。该模型已成功地应用于图形信号,以及通过将底层图形拓扑结构集成到学习的字典。尽管如此,由于字典学习问题所需要的计算约束,以及由于直接使用图拉普拉斯矩阵,用于图信号的字典学习方法通常限于小维度。在本文中,我们提出了一个字典学习算法,适用于更广泛的一类图形信号,并能够处理更高维的数据。我们将潜在的图形拓扑结构隐式地,通过迫使学习字典原子是图小波函数的稀疏组合,并明确地,通过添加直接图约束,以促进在特征和流形域的平滑度。因此,所得到的原子适应于感兴趣的数据,同时粘附到底层的图形结构,并拥有所需的多尺度属性。在不同性质的合成和真实网络数据集上的实验结果表明,该算法在高维情况下也能有效地处理图形信号.

英文摘要:

Modern data introduces new challenges to classic signal processing approaches, leading to a growing interest in the field of graph signal processing. A powerful and well established model for real world signals in various domains is sparse representation over a dictionary, combined with the ability to train the dictionary from signal examples. This model has been successfully applied to graph signals as well by integrating the underlying graph topology into the learned dictionary. Nonetheless, dictionary learning methods for graph signals are typically restricted to small dimensions due to the computational constraints that the dictionary learning problem entails, and due to the direct use of the graph Laplacian matrix. In this paper, we propose a dictionary learning algorithm that applies to a broader class of graph signals, and is capable of handling much higher dimensional data. We incorporate the underlying graph topology both implicitly, by forcing the learned dictionary atoms to be sparse combinations of graph-wavelet functions, and explicitly, by adding direct graph constraints to promote smoothness in both the feature and manifold domains. The resulting atoms are thus adapted to the data of interest while adhering to the underlying graph structure and possessing a desired multi-scale property. Experimental results on several datasets, representing both synthetic and real network data of different nature, demonstrate the effectiveness of the proposed algorithm for graph signal processing even in high dimensions.

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

↑