3DAC: Learning Attribute Compression for Point Clouds
- URL: http://arxiv.org/abs/2203.09931v1
- Date: Thu, 17 Mar 2022 09:42:36 GMT
- Title: 3DAC: Learning Attribute Compression for Point Clouds
- Authors: Guangchi Fang, Qingyong Hu, Hanyun Wang, Yiling Xu, Yulan Guo
- Abstract summary: We study the problem of attribute compression for large-scale unstructured 3D point clouds.
We introduce a deep compression network, termed 3DAC, to explicitly compress the attributes of 3D point clouds.
- Score: 35.78404985164711
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: We study the problem of attribute compression for large-scale unstructured 3D
point clouds. Through an in-depth exploration of the relationships between
different encoding steps and different attribute channels, we introduce a deep
compression network, termed 3DAC, to explicitly compress the attributes of 3D
point clouds and reduce storage usage in this paper. Specifically, the point
cloud attributes such as color and reflectance are firstly converted to
transform coefficients. We then propose a deep entropy model to model the
probabilities of these coefficients by considering information hidden in
attribute transforms and previous encoded attributes. Finally, the estimated
probabilities are used to further compress these transform coefficients to a
final attributes bitstream. Extensive experiments conducted on both indoor and
outdoor large-scale open point cloud datasets, including ScanNet and
SemanticKITTI, demonstrated the superior compression rates and reconstruction
quality of the proposed 3DAC.
Related papers
- 3D Point Cloud Compression with Recurrent Neural Network and Image
Compression Methods [0.0]
Storing and transmitting LiDAR point cloud data is essential for many AV applications.
Due to the sparsity and unordered structure of the data, it is difficult to compress point cloud data to a low volume.
We propose a new 3D-to-2D transformation which allows compression algorithms to efficiently exploit spatial correlations.
arXiv Detail & Related papers (2024-02-18T19:08:19Z) - PIVOT-Net: Heterogeneous Point-Voxel-Tree-based Framework for Point
Cloud Compression [8.778300313732027]
We propose a heterogeneous point cloud compression (PCC) framework.
We unify typical point cloud representations -- point-based, voxel-based, and tree-based representations -- and their associated backbones.
We augment the framework with a proposed context-aware upsampling for decoding and an enhanced voxel transformer for feature aggregation.
arXiv Detail & Related papers (2024-02-11T16:57:08Z) - 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) - 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) - EPCL: Frozen CLIP Transformer is An Efficient Point Cloud Encoder [60.52613206271329]
This paper introduces textbfEfficient textbfPoint textbfCloud textbfLearning (EPCL) for training high-quality point cloud models with a frozen CLIP transformer.
Our EPCL connects the 2D and 3D modalities by semantically aligning the image features and point cloud features without paired 2D-3D data.
arXiv Detail & Related papers (2022-12-08T06:27:11Z) - Deep Geometry Post-Processing for Decompressed Point Clouds [32.72083309729585]
Point cloud compression plays a crucial role in reducing the huge cost of data storage and transmission.
We propose a novel learning-based post-processing method to enhance the decompressed point clouds.
Experimental results show that the proposed method can significantly improve the quality of the decompressed point clouds.
arXiv Detail & Related papers (2022-04-29T08:57:03Z) - 4DAC: Learning Attribute Compression for Dynamic Point Clouds [37.447460254690135]
We study the attribute (e.g., color) compression of dynamic point clouds and present a learning-based framework, termed 4DAC.
To reduce temporal redundancy within data, we first build the 3D motion estimation and motion compensation modules with deep neural networks.
In addition, we also propose a deep conditional entropy model to estimate the probability distribution of the transformed coefficients.
arXiv Detail & Related papers (2022-04-25T15:30:06Z) - 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) - Deep Point Cloud Reconstruction [74.694733918351]
Point cloud obtained from 3D scanning is often sparse, noisy, and irregular.
To cope with these issues, recent studies have been separately conducted to densify, denoise, and complete inaccurate point cloud.
We propose a deep point cloud reconstruction network consisting of two stages: 1) a 3D sparse stacked-hourglass network as for the initial densification and denoising, 2) a refinement via transformers converting the discrete voxels into 3D points.
arXiv Detail & Related papers (2021-11-23T07:53:28Z) - GRNet: Gridding Residual Network for Dense Point Cloud Completion [54.43648460932248]
Estimating the complete 3D point cloud from an incomplete one is a key problem in many vision and robotics applications.
We propose a novel Gridding Residual Network (GRNet) for point cloud completion.
Experimental results indicate that the proposed GRNet performs favorably against state-of-the-art methods on the ShapeNet, Completion3D, and KITTI benchmarks.
arXiv Detail & Related papers (2020-06-06T02:46:39Z)
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.