图结构数据的完全重构双通道小波滤波器组
Perfect Reconstruction Two-Channel Wavelet Filter-Banks for Graph Structured Data
摘要:
在这项工作中,我们提出了双通道小波滤波器组的建设,分析任何有限加权无向图的顶点上定义的功能。这些基于图的函数被称为图信号,因为我们构建了一个框架,在该框架中,来自经典信号处理领域的许多概念,例如傅立叶分解,信号滤波和下采样可以扩展到图域。特别是,我们观察到的频谱折叠现象,发生在这些图的下采样,并产生混淆的图形信号中的二分图。二分图的这种性质,使我们能够设计严格采样的两通道滤波器组,我们提出了正交镜像滤波器(称为图QMF)的二分图,取消混叠,并导致完美的重建。对于任意图,我们提出了一个二部子图分解,产生一个边不相交的二部子图的集合。图QMF,然后构建在每个二部子图导致“多维”可分离的小波滤波器组的图。我们提出的滤波器组是严格采样的,我们陈述了正交性,混叠消除和完美重建的充分必要条件。滤波器组由切比雪夫多项式逼近实现。
英文摘要:
In this work we propose the construction of two-channel wavelet filterbanks for analyzing functions defined on the vertices of any arbitrary finite weighted undirected graph. These graph based functions are referred to as graph-signals as we build a framework in which many concepts from the classical signal processing domain, such as Fourier decomposition, signal filtering and downsampling can be extended to graph domain. Especially, we observe a spectral folding phenomenon in bipartite graphs which occurs during downsampling of these graphs and produces aliasing in graph signals. This property of bipartite graphs, allows us to design critically sampled two-channel filterbanks, and we propose quadrature mirror filters (referred to as graph-QMF) for bipartite graph which cancel aliasing and lead to perfect reconstruction. For arbitrary graphs we present a bipartite subgraph decomposition which produces an edge-disjoint collection of bipartite subgraphs. Graph-QMFs are then constructed on each bipartite subgraph leading to "multi-dimensional" separable wavelet filterbanks on graphs. Our proposed filterbanks are critically sampled and we state necessary and sufficient conditions for orthogonality, aliasing cancellation and perfect reconstruction. The filterbanks are realized by Chebychev polynomial approximations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。