arrow
Return

Efficient Geometry Surface Coding in V-PCC

delete2023-01-01
delete9
PRE
AI
J
Jian Xiong
H
Hao Gao *
M
Miaohui Wang *
李宏亮 cover
李宏亮 (Hongliang Li)
K
King Ngi Ngan
W
Weisi Lin
DOI:10.1109/TMM.2022.3158809delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In recent video-based point cloud compression (V-PCC), 3D point clouds are projected onto 2D images and compressed by High-Efficiency Video Coding (HEVC). However, HEVC was originally designed for natural visual signals, which is a suboptimal framework for point clouds. Therefore, there are still problems in geometry information compression in V-PCC: (1) The distortion based on the sum of squared error (SSE) in the existing rate-distortion optimization (RDO) is inconsistent with the geometric quality measurement; (2) The existing prediction cannot explore the fixed relationship between the corresponding far layer and near layer depth, which means that the far layer depth can be always not less than the corresponding near layer depth. In this paper, we present an efficient geometry surface coding (EGSC) method for V-PCC to address the problems. Firstly, an error projection (EP) model is designed to establish the relationship between the SSE-based distortion and the geometry quality metric. Secondly, an EP-based RDO is employed to improve the geometry information compression by estimating the point normals with gradients. Finally, an occupancy-map driven scheme is proposed to improve the prediction accuracy of merge modes. Experimental results show that the proposed method achieves an average of over 10% bit-rate saving compared with the V-PCC reference software.
Keywords:
Geometry compression
HEVC
occupancy map
point cloud
rate distortion optimization
V-PCC

Journal

IEEE Transactions on Multimedia cover
IEEE Transactions on Multimedia
IF:
9.7
Papers:
4.4K
Citations:
2.4W

Organization

N
Nanyang Technological University
Scholars:
4.9W
Papers: 4.7W
Citations: 8.1W
S
shenzhen university
Scholars:
4.4W
Papers: 3.4W
Citations: 72