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

任意无向图的紧支集双正交小波滤波器组

Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs

Sunil K. Narang, Antonio Ortega

摘要:

在我们最近的工作中,我们提出了针对任意无向加权图的完美重构正交小波滤波器组的设计,称为图- QMF。在该公式中,我们首先设计了“一维”的二分图上的两个通道的滤波器组,然后将它们扩展到“多维”的可分离的两个通道的滤波器组的任意图通过一个二分子图分解。基于图的谱分解,我们专门设计了小波滤波器,并给出了二分图上双通道图滤波器组提供混叠消除、完美重构和正交基集(正交性)的充分必要条件。虽然,精确的图QMF设计满足所有上述条件,但它们不是精确地在图上定位的k-hop。在本文中,我们放松了正交性条件,设计了一个双正交的图小波对,可以有紧凑的空间扩展,仍然满足完美的重建条件。该设计类似于标准的Cohen-Daubechies-Feauveau(CDF)结构,用于分解最大平坦Daubechies半带滤波器。初步结果表明,所提出的滤波器组可以是有用的标准信号处理应用程序,以及对任意图形上定义的信号。注意:本文中的代码示例可在http://biron.usc.edu/wiki/index.php/Graph Filterbanks上获得

英文摘要:

In our recent work, we proposed the design of perfect reconstruction orthogonal wavelet filterbanks, called graph- QMF, for arbitrary undirected weighted graphs. In that formulation we first designed "one-dimensional" two-channel filterbanks on bipartite graphs, and then extended them to "multi-dimensional" separable two-channel filterbanks for arbitrary graphs via a bipartite subgraph decomposition. We specifically designed wavelet filters based on the spectral decomposition of the graph, and stated necessary and sufficient conditions for a two-channel graph filter-bank on bipartite graphs to provide aliasing-cancellation, perfect reconstruction and orthogonal set of basis (orthogonality). While, the exact graph-QMF designs satisfy all the above conditions, they are not exactly k-hop localized on the graph. In this paper, we relax the condition of orthogonality to design a biorthogonal pair of graph-wavelets that can have compact spatial spread and still satisfy the perfect reconstruction conditions. The design is analogous to the standard Cohen-Daubechies-Feauveau's (CDF) construction of factorizing a maximally-flat Daubechies half-band filter. Preliminary results demonstrate that the proposed filterbanks can be useful for both standard signal processing applications as well as for signals defined on arbitrary graphs. Note: Code examples from this paper are available at http://biron.usc.edu/wiki/index.php/Graph Filterbanks

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

↑