arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.08970eess.SPcs.DS
收藏

Fast DCT+:一类基于路径图秩一更新的快速变换

Fast DCT+: A Family of Fast Transforms Based on Rank-One Updates of the Path Graph

Samuel Fernández-Menduiña, Eduardo Pavez, Antonio Ortega

AI总结:

本文针对路径图秩一更新提出O(n log n)复杂度的Fast DCT+快速图傅里叶变换算法,证明常用音视频编码变换属于该类,基于秩一扰动理论给出分解并验证算法存在性,可推广至其他图与秩k扰动,在图规模大于64时相比朴素方法有计算增益。

摘要:

本文针对路径图的秩一更新,提出了运行时间复杂度为O(n log n)的快速图傅里叶变换(GFT)算法。我们首先证明,几种常用的音频和视频编码变换都属于这类GFT,我们将其记为DCT+。接下来,我们从任意广义图拉普拉斯矩阵出发,利用秩一扰动理论,给出了扰动后GFT的一种分解形式。这一分解是我们的核心结果,它揭示了一种渐进式结构:我们先应用未扰动拉普拉斯矩阵的GFT,再将结果与一个柯西矩阵相乘。通过将该分解应用于路径图并利用柯西矩阵的性质,我们证明了Fast DCT+算法的存在性。我们还证明,当与剪枝策略结合时,这种渐进性可以加速涉及多个由秩一扰动关联的变换的应用(例如视频编码)中的计算。我们的结果可以推广到其他图和秩k扰动的情况。运行时间分析表明,对于节点数大于64的图,Fast DCT+相比朴素方法具有计算优势,其运行时间约等于8次DCT的运行时间。

英文摘要:

This paper develops fast graph Fourier transform (GFT) algorithms with O(n log n) runtime complexity for rank-one updates of the path graph. We first show that several commonly-used audio and video coding transforms belong to this class of GFTs, which we denote by DCT+. Next, starting from an arbitrary generalized graph Laplacian and using rank-one perturbation theory, we provide a factorization for the GFT after perturbation. This factorization is our central result and reveals a progressive structure: we first apply the unperturbed Laplacian's GFT and then multiply the result by a Cauchy matrix. By specializing this decomposition to path graphs and exploiting the properties of Cauchy matrices, we show that Fast DCT+ algorithms exist. We also demonstrate that progressivity can speed up computations in applications involving multiple transforms related by rank-one perturbations (e.g., video coding) when combined with pruning strategies. Our results can be extended to other graphs and rank-k perturbations. Runtime analyses show that Fast DCT+ provides computational gains over the naive method for graph sizes larger than 64, with runtime approximately equal to that of 8 DCTs.

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

↑