arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.02858eess.SP
收藏

具有半正定变分算子的任意图上的双通道滤波器组

Two Channel Filter Banks on Arbitrary Graphs with Positive Semi Definite Variation Operators

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

AI总结:

针对任意图信号处理,本文提出基于半正定变分算子和新型GFT的双通道GFB,保证完全重构与临界采样,并通过顶点划分优化在大规模3D点云上提升表示质量。

摘要:

我们提出了用于图上信号的新型双通道滤波器组。我们的设计可应用于任意图,只要给定一个半正定变分算子,同时使用任意顶点划分进行下采样。所提出的广义滤波器组(GFBs)还满足若干理想性质,包括完全重构和临界采样,并具有高效的实现方式。我们的结果推广了以往仅适用于二分图归一化拉普拉斯矩阵的方法。我们的方法基于由变分算子的广义特征向量给出的新型图傅里叶变换(GFTs)。这些GFT在一个取决于下采样算子和变分算子的替代内积空间中是正交的。我们的关键理论贡献在于表明:如果内积矩阵选择得当,处于二分图滤波器组理论核心的二分图归一化拉普拉斯矩阵的谱折叠性质,可以针对所提出的GFT进行推广。此外,我们研究了GFBs的顶点域和谱域性质,并利用高斯图模型阐明了它们的概率解释。虽然GFBs可以在给定任意用于下采样的顶点划分的情况下定义,但我们提出了一种算法来优化这些划分,其准则倾向于具有大图割的平衡划分,这被证明可带来高效且稳定的GFB实现。我们的数值实验表明,经划分优化的GFBs可以在具有数十万个点(节点)的3D点云上高效实现,同时相较于竞争的最先进方法,还提高了颜色信号的表示质量。

英文摘要:

We propose novel two-channel filter banks for signals on graphs. Our designs can be applied to arbitrary graphs, given a positive semi definite variation operator, while using arbitrary vertex partitions for downsampling. The proposed generalized filter banks (GFBs) also satisfy several desirable properties including perfect reconstruction and critical sampling, while having efficient implementations. Our results generalize previous approaches that were only valid for the normalized Laplacian of bipartite graphs. Our approach is based on novel graph Fourier transforms (GFTs) given by the generalized eigenvectors of the variation operator. These GFTs are orthogonal in an alternative inner product space which depends on the downsampling and variation operators. Our key theoretical contribution is showing that the spectral folding property of the normalized Laplacian of bipartite graphs, at the core of bipartite filter bank theory, can be generalized for the proposed GFT if the inner product matrix is chosen properly. In addition, we study vertex domain and spectral domain properties of GFBs and illustrate their probabilistic interpretation using Gaussian graphical models. While GFBs can be defined given any choice of a vertex partition for downsampling, we propose an algorithm to optimize these partitions with a criterion that favors balanced partitions with large graph cuts, which are shown to lead to efficient and stable GFB implementations. Our numerical experiments show that partition-optimized GFBs can be implemented efficiently on 3D point clouds with hundreds of thousands of points (nodes), while also improving the color signal representation quality over competing state-of-the-art approaches.

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

↑