Efficient dynamic point cloud coding using Slice-Wise Segmentation

• URL: http://arxiv.org/abs/2208.08061v1
• Date: Wed, 17 Aug 2022 04:23:45 GMT
• Title: Efficient dynamic point cloud coding using Slice-Wise Segmentation
• Authors: Faranak Tohidi, Manoranjan Paul, Anwaar Ulhaq
• Abstract summary: MPEG recently developed a video-based point cloud compression (V-PCC) standard for dynamic point cloud coding. 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 to decrease the number of patches generated and the amount of data lost.
• Score: 10.850101961203748
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 self-occluded points so that data loss can be minimized in the patch generation process and projection. For this, a variable number of layers are considered, partially overlapped to retain the self-occluded points. The proposed method's added advantage is to reduce the bits requirement and to encode geometric data using the slicing base position. The experimental results show that the proposed method is much more flexible than the standard V-PCC method, improves the rate-distortion performance, and decreases the data loss significantly compared to the standard V-PCC method.

Related papers

• Hierarchical Prior-based Super Resolution for Point Cloud Geometry Compression [39.052583172727324]
  The Geometry-based Point Cloud Compression (G-PCC) has been developed by the Moving Picture Experts Group to compress point clouds. This paper proposes a hierarchical prior-based super resolution method for point cloud geometry compression.
  arXiv  Detail & Related papers  (2024-02-17T11:15:38Z)
• Geometric Prior Based Deep Human Point Cloud Geometry Compression [67.49785946369055]
  We leverage the human geometric prior in geometry redundancy removal of point clouds. We can envisage high-resolution human point clouds as a combination of geometric priors and structural deviations. The proposed framework can operate in a play-and-plug fashion with existing learning based point cloud compression methods.
  arXiv  Detail & Related papers  (2023-05-02T10:35:20Z)
• Quadric Representations for LiDAR Odometry, Mapping and Localization [93.24140840537912]
  Current LiDAR odometry, mapping and localization methods leverage point-wise representations of 3D scenes. We propose a novel method of describing scenes using quadric surfaces, which are far more compact representations of 3D objects. Our method maintains low latency and memory utility while achieving competitive, and even superior, accuracy.
  arXiv  Detail & Related papers  (2023-04-27T13:52:01Z)
• GQE-Net: A Graph-based Quality Enhancement Network for Point Cloud Color Attribute [51.4803148196217]
  We propose a graph-based quality enhancement network (GQE-Net) to reduce color distortion in point clouds. GQE-Net uses geometry information as an auxiliary input and graph convolution blocks to extract local features efficiently. Experimental results show that our method achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2023-03-24T02:33:45Z)
• Evaluating Point Cloud from Moving Camera Videos: A No-Reference Metric [58.309735075960745]
  This paper explores the way of dealing with point cloud quality assessment (PCQA) tasks via video quality assessment (VQA) methods. We generate the captured videos by rotating the camera around the point clouds through several circular pathways. We extract both spatial and temporal quality-aware features from the selected key frames and the video clips through using trainable 2D-CNN and pre-trained 3D-CNN models.
  arXiv  Detail & Related papers  (2022-08-30T08:59:41Z)
• IPDAE: Improved Patch-Based Deep Autoencoder for Lossy Point Cloud Geometry Compression [11.410441760314564]
  We propose a set of significant improvements to patch-based point cloud compression. Experiments show that the improved patch-based autoencoder outperforms the state-of-the-art in terms of rate-distortion performance.
  arXiv  Detail & Related papers  (2022-08-04T08:12:35Z)
• Learned Video Compression via Heterogeneous Deformable Compensation Network [78.72508633457392]
  We propose a learned video compression framework via heterogeneous deformable compensation strategy (HDCVC) to tackle the problems of unstable compression performance. More specifically, the proposed algorithm extracts features from the two adjacent frames to estimate content-Neighborhood heterogeneous deformable (HetDeform) kernel offsets. Experimental results indicate that HDCVC achieves superior performance than the recent state-of-the-art learned video compression approaches.
  arXiv  Detail & Related papers  (2022-07-11T02:31:31Z)
• Dynamic Point Cloud Compression with Cross-Sectional Approach [10.850101961203748]
  MPEG finalized a Video-based Point Cloud Compression standard known as V-PCC. The proposed method addresses these limitations by using a novel cross-sectional approach. The experimental results using standard video sequences show that the proposed technique can achieve better compression in both geometric and texture data.
  arXiv  Detail & Related papers  (2022-04-25T02:58:18Z)
• Variable Rate Compression for Raw 3D Point Clouds [5.107705550575662]
  We propose a novel variable rate deep compression architecture that operates on raw 3D point cloud data. Our network is capable of explicitly processing point clouds and generating a compressed description.
  arXiv  Detail & Related papers  (2022-02-28T15:15:39Z)
• Reduced Reference Perceptual Quality Model and Application to Rate Control for 3D Point Cloud Compression [61.110938359555895]
  In rate-distortion optimization, the encoder settings are determined by maximizing a reconstruction quality measure subject to a constraint on the bit rate. We propose a linear perceptual quality model whose variables are the V-PCC geometry and color quantization parameters. Subjective quality tests with 400 compressed 3D point clouds show that the proposed model correlates well with the mean opinion score. We show that for the same target bit rate, ratedistortion optimization based on the proposed model offers higher perceptual quality than rate-distortion optimization based on exhaustive search with a point-to-point objective quality metric.
  arXiv  Detail & Related papers  (2020-11-25T12:42:02Z)
• Multiscale Point Cloud Geometry Compression [29.605320327889142]
  We propose a multiscale-to-end learning framework which hierarchically reconstructs the 3D Point Cloud Geometry. The framework is developed on top of a sparse convolution based autoencoder for point cloud compression and reconstruction.
  arXiv  Detail & Related papers  (2020-11-07T16:11:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.