Graph-based compression of dynamic 3D point cloud sequences

Abstract

This paper addresses the problem of compression of 3D point cloud sequences that are characterized by moving 3D positions and color attributes. As temporally successive point cloud frames are similar, motion estimation is key to effective compression of these sequences. It however remains a challenging problem as the point cloud frames have varying numbers of points without explicit correspondence information. We represent the time-varying geometry of these sequences with a set of graphs, and consider 3D positions and color attributes of the points clouds as signals on the vertices of the graphs. We then cast motion estimation as a feature matching problem between successive graphs. The motion is estimated on a sparse set of representative vertices using new spectral graph wavelet descriptors. A dense motion field is eventually interpolated by solving a graph-based regularization problem. The estimated motion is finally used for removing the temporal redundancy in the predictive coding of the 3D positions and the color characteristics of the point cloud sequences. Experimental results demonstrate that our method is able to accurately estimate the motion between consecutive frames. Moreover, motion estimation is shown to bring significant improvement in terms of the overall compression performance of the sequence. To the best of our knowledge, this is the first paper that exploits both the spatial correlation inside each frame (through the graph) and the temporal correlation between the frames (through the motion estimation) to compress the color and the geometry of 3D point cloud sequences in an efficient way.

References in corpus (1)

• Learning parametric dictionaries for graph signals

Cited by in corpus (14)

• Reduced Reference Perceptual Quality Model and Application to Rate Control for 3D Point Cloud Compression
• Learned Point Cloud Geometry Compression
• Fast Resampling of 3D Point Clouds via Graphs
• Learning Convolutional Transforms for Lossy Point Cloud Geometry Compression
• Random Walk Graph Laplacian based Smoothness Prior for Soft Decoding of JPEG Images
• Deep Unsupervised Learning of 3D Point Clouds via Graph Topology Inference and Filtering
• Model-based Joint Bit Allocation between Geometry and Color for Video-based 3D Point Cloud Compression
• Reconstruction of Time-varying Graph Signals via Sobolev Smoothness
• Digraph Signal Processing with Generalized Boundary Conditions
• Sampling of graph signals via randomized local aggregations
• Rate-Distortion Modeling for Bit Rate Constrained Point Cloud Compression
• D-Lite: Navigation-Oriented Compression of 3D Scene Graphs for Multi-Robot Collaboration
• Geometric Prior Based Deep Human Point Cloud Geometry Compression
• Buildup of Speaking Skills in an Online Learning Community: A Network-Analytic Exploration