Efficient dynamic point cloud coding using Slice-Wise Segmentation
Faranak Tohidi, Manoranjan Paul, Anwaar Ulhaq

TL;DR
This paper introduces a novel slice-wise segmentation method for dynamic point cloud coding that reduces data loss and bit requirements, improving rate-distortion performance over standard V-PCC.
Contribution
It proposes an overlapping slicing technique that minimizes data loss and bits in point cloud compression by adaptively segmenting point clouds based on self-occlusion.
Findings
Significantly reduces data loss compared to V-PCC.
Improves rate-distortion performance.
Reduces bits required for encoding geometric data.
Abstract
With the fast growth of immersive video sequences, achieving seamless and high-quality compressed 3D content is even more critical. MPEG recently developed a video-based point cloud compression (V-PCC) standard for dynamic point cloud coding. However, reconstructed point clouds using V-PCC suffer from different artifacts, including losing data during pre-processing before applying existing video coding techniques, e.g., High-Efficiency Video Coding (HEVC). Patch generations and self-occluded points in the 3D to the 2D projection are the main reasons for missing data using V-PCC. This paper proposes a new method that introduces overlapping slicing as an alternative to patch generation to decrease the number of patches generated and the amount of data lost. In the proposed method, the entire point cloud has been cross-sectioned into variable-sized slices based on the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topics3D Shape Modeling and Analysis · Computer Graphics and Visualization Techniques · Advanced Vision and Imaging
MethodsBalanced Selection
