Efficient Large-Scale Point Cloud Geometry Compression

Due to the significant bandwidth and memory requirements for transmitting and storing large-scale point clouds, considerable progress has been made in recent years in the field of large-scale point cloud geometry compression. However, challenges remain, including suboptimal compression performance and complex encoding-decoding processes. To address these issues, we propose an efficient large-scale scene point cloud geometry compression algorithm. By analyzing the sparsity of large-scale point clouds and the impact of scale on feature extraction, we design a cross-attention module in the encoder to enhance the extracted features by incorporating positional information. During decoding, we introduce an efficient generation module that improves decoding quality without increasing decoding time. Experiments on three public datasets demonstrate that, compared to the state-of-the-art G-PCC v23, our method achieves an average bitrate reduction of -46.64%, the fastest decoding time, and a minimal network model size of 2.8 M.

Authors

Institutions

Publication Details

Journal
Sensors
Published
2025-02-21
DOI
https://doi.org/10.3390/s25051325
Citations
2
Primary Topic
3D Shape Modeling and Analysis
Type
article
Field-Weighted Citation Impact
2.67

Funders

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

Efficient Large-Scale Point Cloud Geometry Compression

Huamin Yang, Shiyu Lu, Cheng Han
2 citations
Sensors
3D Shape Modeling and Analysis
2.67
article

Efficient Large-Scale Point Cloud Geometry Compression

Huamin Yang, Shiyu Lu, Cheng Han
article en
2 citations

Abstract

Due to the significant bandwidth and memory requirements for transmitting and storing large-scale point clouds, considerable progress has been made in recent years in the field of large-scale point cloud geometry compression. However, challenges remain, including suboptimal compression performance and complex encoding-decoding processes. To address these issues, we propose an efficient large-scale scene point cloud geometry compression algorithm. By analyzing the sparsity of large-scale point clouds and the impact of scale on feature extraction, we design a cross-attention module in the encoder to enhance the extracted features by incorporating positional information. During decoding, we introduce an efficient generation module that improves decoding quality without increasing decoding time. Experiments on three public datasets demonstrate that, compared to the state-of-the-art G-PCC v23, our method achieves an average bitrate reduction of -46.64%, the fastest decoding time, and a minimal network model size of 2.8 M.

SensorsVol. 25(5)
Changchun University of Science and Technology (CN)
National Key Research and Development Program of China
Openalex Percentile: Top 14%
3D Shape Modeling and Analysis
2.67
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.