3D Gaussian splatting enables real-time, photo-realistic scene rendering but is challenged by redundant, high-dimensional primitive data. To make immersive AR/VR and volumetric communication practical, compression must address both temporal and attribute redundancy. We introduce a streamlined inter-prediction coding pipeline that predicts each P-frame's color and geometry attributes from a nearby reference using a lightweight hybrid predictor, combining bilateral filtering and K-nearest-neighbor feature transfer, and encodes only residuals. Our approach targets the most rate-critical channels by applying codebook-based vector quantization to spherical harmonic components, while retaining efficient scalar quantization for other attributes. All quantized streams and codebooks are entropy coded. The proposed method achieves an average 89.1 % reduction in BD-rate and a 12.39 dB increase in BD-PSNR over GPCCv1, and outperforms previous SOTA interGS by 18.6 % in BD-rate and 1.81 dB in BD-PSNR. With practical decoding speeds (0.605 seconds per frame), interGS-Lite preserves real-time rendering and has potential for streaming and AR/VR applications, delivering consistent bitrate reductions with high visual quality.

A point cloud is a 3D data representation that presents unique challenges due to its large volume, high dimensionality, and lack of structure. This work introduces FDIP-PCAC, a$F$requency$D$omain$I$nter$P$rediction and Compensation system for dynamic point cloud attribute compression. The method combines deep learning, geometry-driven modeling, and Graph Fourier Transform (GFT) within a five-phase encoder–decoder framework. Initially, the reference and target point cloud frames are partitioned into corresponding nodes using a binary tree. In Phase 1, each target node identifies its K-nearest reference nodes based on the geometry centroid. Phase 2 computes the GFT latent representation of these selected reference nodes. Phase 3 and 4 transfer the RGB colors from matched reference nodes to target nodes, generating Predicted Target Node and Second-Stage Predicted Target Node, respectively. In phase 5, the neural network-based FreqNeRF predicts the GFT latent representation of target nodes. The proposed system achieves superior compression and reconstruction performance compared to G-PCC across diverse datasets. It delivers average BD-rate reductions of 65.89% against RAHT-v30, 63.61% against PredLift-v30, 67.59% against RAHT-v23 and 66.82% against PredLift-v23.

Current video-based GS compression methods rely on using Parallel Linear Assignment Sorting (PLAS) to convert 3D GS into smooth 2D maps, which are computationally expensive and time-consuming, limiting the application of GS on lightweight devices. In this paper, we propose a Lightweight 3D Gaussian Splatting (GS) Compression method based on Video codec (LGSCV). First, a two-stage Morton scan is proposed to generate blockwise 2D maps that are friendly for canonical video codecs in which the coding units (CU) are square blocks. A 3D Morton scan is used to permute GS primitives, followed by a 2D Morton scan to map the ordered GS primitives to 2D maps in a blockwise style. However, although the blockwise 2D maps report close performance to the PLAS map in high-bitrate regions, they show a quality collapse at medium-to-low bitrates. Therefore, a principal component analysis (PCA) is used to reduce the dimensionality of spherical harmonics (SH), and a MiniPLAS, which is flexible and fast, is designed to permute the primitives within certain block sizes. Incorporating SH PCA and MiniPLAS leads to a significant gain in rate-distortion (RD) performance, especially at medium and low bitrates. MiniPLAS can also guide the setting of the codec CU size configuration and significantly reduce encoding time. Experimental results on the MPEG dataset demonstrate that the proposed LGSCV achieves over 20% RD gain compared with state-of-the-art methods, while reducing 2D map generation time to approximately 1 second and cutting encoding time by 50%. The code is available at https://github.com/Qi-Yangsjtu/LGSCV.

High-fidelity 3D representations of objects and scenes can be obtained with point clouds, but dealing with their massive data sizes can be difficult. This data is efficiently compressed via MPEG’s Geometry-based Point Cloud Compression (G-PCC), which makes it manageable and useful for real-world applications. One major drawback, though, is that decoding introduces coding artifacts that cause the reconstructed point cloud to appear blocky. In this paper, we present a new approach to attribute learning in point clouds leveraging sparse convolution, that effectively deals with the non-uniformity and sparsity of these data structures.

This paper describes a scalable video codec that was submitted as a response to the joint call for proposals issued by ISO/IEC MPEG and ITU-T VCEG on HEVC scalable extension. The proposed codec uses a multi-loop decoding structure. Several inter-layer texture prediction methods are employed to remove the inter-layer redundancy. Inter-layer prediction is also used when coding enhancement layer syntax elements such as motion parameter and intra prediction mode, to further reduce bit overhead. Additionally, alternative transforms as well as adaptive coefficients scanning are used to code the prediction residues more efficiently. Experimental results are presented to demonstrate the effectiveness of the proposed scheme. When compared to HEVC single-layer coding, the additional rate overhead for the proposed scalable extension is 1.2% to 6.4% to achieve two layers of SNR and spatial scalability.