mlsanityData to 7 Oct 2026

Motion estimation and filtered prediction for dynamic point cloud attribute compression

arXiv 2210.08262 ↗First posted 15 Oct 2022cs.CV eess.IVcited by 1

Not on the map. Why?

Abstract (arXiv)

In point cloud compression, exploiting temporal redundancy for inter predictive coding is challenging because of the irregular geometry. This paper proposes an efficient block-based inter-coding scheme for color attribute compression. The scheme includes integer-precision motion estimation and an adaptive graph based in-loop filtering scheme for improved attribute prediction. The proposed block-based motion estimation scheme consists of an initial motion search that exploits geometric and color attributes, followed by a motion refinement that only minimizes color prediction error. To further improve color prediction, we propose a vertex-domain low-pass graph filtering scheme that can adaptively remove noise from predictors computed from motion estimation with different accuracy. Our experiments demonstrate significant coding gain over state-of-the-art coding methods.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 9 of its 24 references that are in the map. First posted on arXiv 15 Oct 2022.

Builds on

9 of 24 references.

References · 9

  1. 2021A comprehensive survey on point cloud registrationcited by 84
  2. 2018Graph Spectral Image Processingcited by 41
  3. 2015Graph-based compression of dynamic 3D point cloud sequencescited by 15
  4. 2019Predictive Generalized Graph Fourier Transform for Attribute Compression of Dynamic Point Cloudscited by 11
  5. 2018Irregularity-Aware Graph Fourier Transformscited by 8
  6. 2020Region adaptive graph fourier transform for 3d point cloudscited by 8
  7. 2016Dynamic Polygon Clouds: Representation and Compression for VR/ARcited by 5
  8. 2020A 3D Motion Vector Database for Dynamic Point Cloudscited by 3
  9. 2022Fractional Motion Estimation for Point Cloud Compressioncited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.