Simple Grid-Based Refinement Segmentation Algorithm for MPEG Video-Based Point Cloud Compression

Abstract

In this paper, we proposed two simple refinement segmentation algorithms that can provide options to improve the computational complexity of the Video-based Point Cloud Compression (V-PCC) encoder. The patch image generation process in the encoding process is the most time-consuming and computationally intensive, accounting for about 70% of the encoder's self-running time in TMC2 v13.0. Since the real-time encoding of V-PCC is within the requirement of industry, it is highly necessary to research methods that can achieve good compression performance with low computational complexity. The grid-based refinement segmentation is one of the most computationally intensive processes in V-PCC. We found that the computational complexity can be reduced by further reducing the refinement segmentation process. Therefore, we propose to change the grid-based refinement segmentation loop process, thereby reducing the computational complexity by reducing some computational processes when the projection plane index of the neighboring grid point does not change. In the experiment, the compression performance of some sequences is improved by 0.1% to 0.9%, and the refinement segmentation time used is 79.21% and 79.53% of the anchor. INDEX TERMSVideo-based point cloud compression, MPEG, fast encoding, low complexity.