mlsanityData to 7 Oct 2026

Hierarchical Attention Networks for Lossless Point Cloud Attribute Compression

arXiv 2504.00481 ↗First posted 1 Apr 2025cs.CV eess.SPcited by 1

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose a deep hierarchical attention context model for lossless attribute compression of point clouds, leveraging a multi-resolution spatial structure and residual learning. A simple and effective Level of Detail (LoD) structure is introduced to yield a coarse-to-fine representation. To enhance efficiency, points within the same refinement level are encoded in parallel, sharing a common context point group. By hierarchically aggregating information from neighboring points, our attention model learns contextual dependencies across varying scales and densities, enabling comprehensive feature extraction. We also adopt normalization for position coordinates and attributes to achieve scale-invariant compression. Additionally, we segment the point cloud into multiple slices to facilitate parallel processing, further optimizing time complexity. Experimental results demonstrate that the proposed method offers better coding performance than the latest G-PCC for color and reflectance attributes while maintaining more efficient encoding and decoding runtimes.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 6 of its 17 references that are in the map. First posted on arXiv 1 Apr 2025.

Builds on

6 of 17 references.

References · 6

  1. 2017ScanNet: Richly-annotated 3D Reconstructions of Indoor Scenescited by 3,088
  2. 2022Point Transformer V2: Grouped Vector Attention and Partition-based Poolingcited by 384
  3. 2022OctAttention: Octree-Based Large-Scale Contexts Model for Point Cloud Compressioncited by 57
  4. 2023Lossless Point Cloud Geometry and Attribute Compression Using a Learned Conditional Probability Modelcited by 25
  5. 2023Lossless Point Cloud Attribute Compression Using Cross-scale, Cross-group, and Cross-color Predictioncited by 11
  6. 2020Point Cloud Attribute Compression via Successive Subspace Graph Transformcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.