arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.01866cs.CVcs.MMeess.SP
收藏

三维点云的区域自适应图形傅立叶变换

Region adaptive graph fourier transform for 3d point clouds

University of Southern California(南加州大学);Google, Inc.(谷歌公司)

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

摘要:

我们介绍了区域自适应图形傅立叶变换(RA-GFT)的三维点云属性的压缩。RA-GFT是通过组合空间局部块变换形成的多分辨率变换。我们假设这些点是由一系列嵌套的分区组织起来的,这些分区由一棵有根树表示。在每个分辨率级别上,使用块变换在聚类中处理属性。每个块变换产生单个近似(DC)系数和各种细节(AC)系数。DC系数在树中向上提升到下一个(较低分辨率)级别,其中可以重复该过程直到到达根。由于簇可能具有不同数量的点,因此每个块变换必须包含每个系数的相对重要性。为此,我们引入了$\mathbf{Q}$ -归一化图拉普拉斯算子,并提出使用其特征向量作为块变换。RA-GFT比以前的方法实现了更好的复杂性-性能权衡。特别是,它优于区域自适应Haar变换(RAHT)高达2.5 dB,具有较小的复杂性开销。

英文摘要:

We introduce the Region Adaptive Graph Fourier Transform (RA-GFT) for compression of 3D point cloud attributes. The RA-GFT is a multiresolution transform, formed by combining spatially localized block transforms. We assume the points are organized by a family of nested partitions represented by a rooted tree. At each resolution level, attributes are processed in clusters using block transforms. Each block transform produces a single approximation (DC) coefficient, and various detail (AC) coefficients. The DC coefficients are promoted up the tree to the next (lower resolution) level, where the process can be repeated until reaching the root. Since clusters may have a different numbers of points, each block transform must incorporate the relative importance of each coefficient. For this, we introduce the $\mathbf{Q}$-normalized graph Laplacian, and propose using its eigenvectors as the block transform. The RA-GFT achieves better complexity-performance trade-offs than previous approaches. In particular, it outperforms the Region Adaptive Haar Transform (RAHT) by up to 2.5 dB, with a small complexity overhead.

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

↑