arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.00628math.COcs.DM
收藏

图信号的排列熵

Permutation Entropy for Graph Signals

John Stewart Fabila-Carrasco, Chao Tan, Javier Escudero

摘要:

熵度量(例如,排列熵)是时间序列(一维数据)中不规则性的非线性度量。这些熵度量中的一些可以推广到周期性结构的数据,例如使用其对称性的网格或晶格图案(二维数据),从而使其能够应用于图像。然而,这些指标尚未开发的信号采样不规则域,定义的图形。在这里,我们第一次定义了一个熵度量来分析信号测量不规则的图形通过概括排列熵,一个完善的非线性度量的基础上比较相邻值内的模式在时间序列。我们的算法是基于比较信号值的相邻节点,使用的邻接矩阵。我们发现,这种推广保留了时间序列和最近的置换熵的图像的经典置换的性质,它可以应用于任何图形结构与合成和真实的信号。我们希望目前的工作,使其他非线性动态方法的图形信号的扩展。

英文摘要:

Entropy metrics (for example, permutation entropy) are nonlinear measures of irregularity in time series (one-dimensional data). Some of these entropy metrics can be generalised to data on periodic structures such as a grid or lattice pattern (two-dimensional data) using its symmetry, thus enabling their application to images. However, these metrics have not been developed for signals sampled on irregular domains, defined by a graph. Here, we define for the first time an entropy metric to analyse signals measured over irregular graphs by generalising permutation entropy, a well-established nonlinear metric based on the comparison of neighbouring values within patterns in a time series. Our algorithm is based on comparing signal values on neighbouring nodes, using the adjacency matrix. We show that this generalisation preserves the properties of classical permutation for time series and the recent permutation entropy for images, and it can be applied to any graph structure with synthetic and real signals. We expect the present work to enable the extension of other nonlinear dynamic approaches to graph signals.

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

↑