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

基于稀疏图算子的DCT和DST滤波

DCT and DST Filtering with Sparse Graph Operators

Keng-Shih Lu, Antonio Ortega, Debargha Mukherjee, Yue Chen

摘要:

图滤波是图信号处理的基本工具。多项式图滤波器(Polynomial Graph Filter,PGF)被定义为基本图算子的多项式,可以在顶点域中实现,并且通常具有比频域滤波器实现更低的复杂度。在本文中,我们专注于设计过滤器的图与图傅里叶变换(GFT)对应的离散三角变换(DTT),即,8种离散余弦变换(DCT)和8种离散正弦变换(DST)之一。在这种情况下,我们表明,可以识别多个稀疏图运算符,这使我们能够提出一个推广的PGF设计:多元多项式图过滤器(MPGF)。首先,对于广泛使用的DCT-Ⅱ(2型DCT),我们描述了一组稀疏图算子,共享DCT-Ⅱ矩阵作为它们的公共特征向量矩阵。这个集合包含著名的连通线图。这些稀疏算子可以被看作是在DCT域中操作的图滤波器,这允许我们通过MPGF来近似任何DCT图滤波器,从而导致比传统PGF方法具有更多自由度的设计。然后,我们将这些结果扩展到所有的16个DTT以及它们的2D版本,并展示了如何确定它们的多个图运算符的相关集合。我们通过实验证明,理想的低通和指数DCT/DST滤波器可以近似具有类似的运行时复杂度更高的精度。最后,我们将我们的方法应用于视频编解码器AV 1中的变换类型选择,在那里我们展示了显著的编码时间节省,压缩损失可以忽略不计。

英文摘要:

Graph filtering is a fundamental tool in graph signal processing. Polynomial graph filters (PGFs), defined as polynomials of a fundamental graph operator, can be implemented in the vertex domain, and usually have a lower complexity than frequency domain filter implementations. In this paper, we focus on the design of filters for graphs with graph Fourier transform (GFT) corresponding to a discrete trigonometric transform (DTT), i.e., one of 8 types of discrete cosine transforms (DCT) and 8 discrete sine transforms (DST). In this case, we show that multiple sparse graph operators can be identified, which allows us to propose a generalization of PGF design: multivariate polynomial graph filter (MPGF). First, for the widely used DCT-II (type-2 DCT), we characterize a set of sparse graph operators that share the DCT-II matrix as their common eigenvector matrix. This set contains the well-known connected line graph. These sparse operators can be viewed as graph filters operating in the DCT domain, which allows us to approximate any DCT graph filter by a MPGF, leading to a design with more degrees of freedom than the conventional PGF approach. Then, we extend those results to all of the 16 DTTs as well as their 2D versions, and show how their associated sets of multiple graph operators can be determined. We demonstrate experimentally that ideal low-pass and exponential DCT/DST filters can be approximated with higher accuracy with similar runtime complexity. Finally, we apply our method to transform-type selection in a video codec, AV1, where we demonstrate significant encoding time savings, with a negligible compression loss.

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

↑