DeepPCC: Learned Lossy Point Cloud Compression

We propose DeepPCC, an end-to-end learning-based approach for the lossy compression of large-scale object point clouds. For both geometry and attribute components, we introduce the Multiscale Neighborhood Information Aggregation (NIA) mechanism, which applies resolution downscaling progressively (<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i.e.</i>, dyadic downsampling of geometry and average pooling of attribute) and combines sparse convolution and local self-attention at each resolution scale for effective feature representation. Under a simple autoencoder structure, scale-wise NIA blocks are stacked as the analysis and synthesis transform in the encoder-decoder pair to best characterize spatial neighbors for accurate approximation of geometry occupancy probability and attribute intensity. Experiments demonstrate that DeepPCC remarkably outperforms state-of-the-art rules-based MPEG G-PCC and learning-based solutions both quantitatively and qualitatively, providing strong evidence that DeepPCC is a promising solution for emerging AI-based PCC.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Emerging Topics in Computational Intelligence
Published
2024-10-11
DOI
https://doi.org/10.1109/tetci.2024.3467192
Citations
13
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
6.36

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DeepPCC: Learned Lossy Point Cloud Compression

Gexin Liu, Junteng Zhang, Dandan Ding, Zhan Ma et al.
13 citations
IEEE Transactions on Emerging Topics in Computational Intelligence
Parallel Computing and Optimization Techniques
6.36
article

DeepPCC: Learned Lossy Point Cloud Compression

Gexin Liu, Junteng Zhang, Dandan Ding, Zhan Ma, Junzhe Zhang
article en
13 citations

Abstract

We propose DeepPCC, an end-to-end learning-based approach for the lossy compression of large-scale object point clouds. For both geometry and attribute components, we introduce the Multiscale Neighborhood Information Aggregation (NIA) mechanism, which applies resolution downscaling progressively (<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i.e.</i>, dyadic downsampling of geometry and average pooling of attribute) and combines sparse convolution and local self-attention at each resolution scale for effective feature representation. Under a simple autoencoder structure, scale-wise NIA blocks are stacked as the analysis and synthesis transform in the encoder-decoder pair to best characterize spatial neighbors for accurate approximation of geometry occupancy probability and attribute intensity. Experiments demonstrate that DeepPCC remarkably outperforms state-of-the-art rules-based MPEG G-PCC and learning-based solutions both quantitatively and qualitatively, providing strong evidence that DeepPCC is a promising solution for emerging AI-based PCC.

IEEE Transactions on Emerging Topics in Computational IntelligenceVol. 9(2)
Hangzhou Normal University (CN), Nanjing University (CN)
National Natural Science Foundation of China
Climate action
Openalex Percentile: Top 2%
Parallel Computing and Optimization Techniques
6.36
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.