arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.12604eess.SPeess.IV
收藏

任意图的谱折叠与双通道滤波器组

Spectral folding and two-channel filter-banks on arbitrary graphs

Eduardo Pavez, Benjamin Girault, Antonio Ortega, Philip A. Chou

摘要:

在过去的十年中,已经提出了一些多分辨率表示理论的图形信号。二分滤波器组作为时域滤波器组的最自然的扩展而脱颖而出,部分原因在于图谱域中的完美重构、正交性和双正交性条件类似于传统滤波器组的条件。因此,许多公知的正交和双正交设计可以容易地适用于图形信号。一个主要的限制是,这个框架只能应用于规范化的二部图的拉普拉斯算子。本文将这一理论推广到任意图和半正定变分算子。我们的方法是基于一个不同的定义的图形傅里叶变换(GFT),其中正交性的定义相对于Q内积。我们构造GFT满足频谱折叠属性,这使我们能够很容易地构建正交和双正交完美重建滤波器组。我们说明了我们的滤波器组的信号表示和计算效率的3D点云与数十万个点。

英文摘要:

In the past decade, several multi-resolution representation theories for graph signals have been proposed. Bipartite filter-banks stand out as the most natural extension of time domain filter-banks, in part because perfect reconstruction, orthogonality and bi-orthogonality conditions in the graph spectral domain resemble those for traditional filter-banks. Therefore, many of the well known orthogonal and bi-orthogonal designs can be easily adapted for graph signals. A major limitation is that this framework can only be applied to the normalized Laplacian of bipartite graphs. In this paper we extend this theory to arbitrary graphs and positive semi-definite variation operators. Our approach is based on a different definition of the graph Fourier transform (GFT), where orthogonality is defined with the respect to the Q inner product. We construct GFTs satisfying a spectral folding property, which allows us to easily construct orthogonal and bi-orthogonal perfect reconstruction filter-banks. We illustrate signal representation and computational efficiency of our filter-banks on 3D point clouds with hundreds of thousands of points.

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

↑