arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.04529eess.SPmath.FA
收藏

图形信号处理的局部傅里叶分析

Localized Fourier Analysis for Graph Signal Processing

Basile de Loynes, Fabien Navarro, Baptiste Olivier

摘要:

我们提出了一个新的观点,在研究图的傅立叶分析,利用本地化的傅立叶域。对于具有拉普拉斯矩阵$\mathcal{L}$的加权图$\mathcal{G}$的顶点上的信号$f$,$f$的标准傅立叶分析依赖于对$I_\mathcal{L}$上的某些滤波器$g$的函数$g(\mathcal{L})f$的研究,$g$是包含拉普拉斯谱${\mathrm sp}(\mathcal{L}) \subset I_\mathcal{L}$的最小间隔。我们表明,仔细选择的分区$I_\mathcal{L} = \sqcup_{1\leq k\leq K} I_k$($I_k \subset I_\mathcal{L}$),有许多优点,在理解集合$(g(\mathcal{L}_{I_k})f)_{1\leq k\leq K}$,而不是$g(\mathcal{L})f$直接,其中$\mathcal{L}_I$是投影矩阵$P_I(\mathcal{L})\mathcal{L}$。首先,分区提供了一个方便的建模傅立叶分析的理论特性的研究,并允许在图形信号分析(\emph{e.g.}噪声水平估计,傅立叶支持近似)的新结果。我们扩展研究的频谱图小波局部化的傅立叶域,称为LocLets的小波,我们表明,众所周知的框架可以写在LocLets。从实际的角度来看,我们强调了所提出的本地化傅立叶分析的兴趣,通过许多实验表明,在两个不同的任务,大图,噪声水平估计和信号去噪显着改善。此外,有效的策略允许以与计算$g(\mathcal{L})f$相同的时间复杂度来计算序列$(g(\mathcal{L}_{I_k})f)_{1\leq k\leq K}$。

英文摘要:

We propose a new point of view in the study of Fourier analysis on graphs, taking advantage of localization in the Fourier domain. For a signal $f$ on vertices of a weighted graph $\mathcal{G}$ with Laplacian matrix $\mathcal{L}$, standard Fourier analysis of $f$ relies on the study of functions $g(\mathcal{L})f$ for some filters $g$ on $I_\mathcal{L}$, the smallest interval containing the Laplacian spectrum ${\mathrm sp}(\mathcal{L}) \subset I_\mathcal{L}$. We show that for carefully chosen partitions $I_\mathcal{L} = \sqcup_{1\leq k\leq K} I_k$ ($I_k \subset I_\mathcal{L}$), there are many advantages in understanding the collection $(g(\mathcal{L}_{I_k})f)_{1\leq k\leq K}$ instead of $g(\mathcal{L})f$ directly, where $\mathcal{L}_I$ is the projected matrix $P_I(\mathcal{L})\mathcal{L}$. First, the partition provides a convenient modelling for the study of theoretical properties of Fourier analysis and allows for new results in graph signal analysis (\emph{e.g.} noise level estimation, Fourier support approximation). We extend the study of spectral graph wavelets to wavelets localized in the Fourier domain, called LocLets, and we show that well-known frames can be written in terms of LocLets. From a practical perspective, we highlight the interest of the proposed localized Fourier analysis through many experiments that show significant improvements in two different tasks on large graphs, noise level estimation and signal denoising. Moreover, efficient strategies permit to compute sequence $(g(\mathcal{L}_{I_k})f)_{1\leq k\leq K}$ with the same time complexity as for the computation of $g(\mathcal{L})f$.

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

↑