Graph Filter-Based Fast Motion Matching for Inter Frame Coding of MPEG G-PCC
Tian Guo, Hui Yuan, Tingting Wang, Wei Gao
Abstract
As a key technique for geometry-based point cloud inter frame coding, motion estimation (ME) has shown the effectiveness to improve the coding efficiency. But the high complexity limits its application. We propose a novel and effective method for fast global motion matching between consecutive frames. We first divide an input point cloud into several blocks, and construct a graph for each block. Then, a graph filter is applied to remove the highest and lowest frequency coefficients based on predefined thresholds. Final-ly, by quantitatively analyzing the geometry gradients of the output of the graph filter, only some key points are reserved. Experimental results show that an average 49% encoding time can be saved with only 0.5% loss of coding efficiency for lossy geometry-lossy attributes configuration while an average 45% encoding time can be saved with no loss of coding efficiency for lossless geometry-lossless attributes configuration.