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

图信号处理中的顶点不相交圈覆盖

Vertex-disjoint Cycle Cover for graph signal processing

Raghavendra Singh

摘要:

循环图的拉普拉斯算子的特征向量表现出标准DFT基的正弦特性,并且在这样的图上定义的信号服从线性移位不变(LSI)运算。在本文中,我们提出了一个通用图约简到它的顶点不相交圈覆盖,即,一组循环的子图,包含图的所有顶点,并且没有两个子图有任何公共顶点。另外,如果图中的边的权重是其顶点上的信号的变化的函数,则可以找到最大平滑循环,使得所得DFT不具有高频分量。我们表明,图像图可以减少到这样的低频周期,并使用它来提出一个简单的图像去噪算法。

英文摘要:

Eigenvectors of the Laplacian of a cycle graph exhibit the sinusoidal characteristics of the standard DFT basis, and signals defined on such graphs are amenable to linear shift invariant (LSI) operations. In this paper we propose to reduce a generic graph to its vertex-disjoint cycle cover, i.e., a set of subgraphs that are cycles, that together contain all vertices of the graph, and no two subgraphs have any vertices in common. Additionally if the weight of an edge in the graph is a function of the variation in the signals on its vertices, then maximally smooth cycles can be found, such that the resulting DFT does not have high frequency components. We show that an image graph can be reduced to such low-frequency cycles, and use that to propose a simple image denoising algorithm.

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

↑