# US 2026/0073572 A1 · 3d gaussian splatting data compression

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0073572 A1
- Document ID: US20260073572A1
- Status: Published application
- Kind: A1
- Application number: 19/299,682
- Filed: 2025-08-14
- Published: 2026-03-12
- Earliest claimed: 2024-08-29
- Assignees: Sony Group Corporation; Sony Corporation of America
- Applicants: Sony Group Corporation; Sony Corporation of America
- Inventors: Shashank Nelamangala Sridhara; Alexandre Zaghetto; Danillo Graziosi; Ali Tabatabai
- Web page: https://patentgrep.com/patent/US20260073572A1

## CPC

- G06T 9/001: {Model-based coding, e.g. wire frame}
- G06T 9/40: Tree coding, e.g. quadtree, octree
- H04N 19/597: specially adapted for multi-view video sequence encoding
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

Post training compression of 3DGS data is agnostic to training in a traditional signal compression perspective. Gaussian parameters are treated as signals. Pre-processing and transform coding techniques are used to compress the signals effectively. Firstly, lossless/lossy compression is performed on 3DGS geometry (positions, scales, rotations) using a point cloud coding-based (e.g., G-PCC, GeS) framework. Positions are compressed using occupancy tree coding. Scales and rotations are encoded as attributes using transform coding. The widely used block-based graph Fourier transform (GFT) is used to compress the attributes (base colors, spherical harmonic coefficients and opacities). In addition, a graph construction strategy is used for 3DGS data that computes the edge weights based on similarity (or dissimilarity) between the 3D Gaussian distributions using KL-divergence. Alternatively, positions can be encoded using occupancy tree (e.g., G-PCC, GeS) or AI-based PCC methods, and any subset of Gaussian parameters or the transformed coefficients of Gaussian parameters can be mapped into 2D frames and encoded by video coders.

## Claims

### Claim 1

A method programmed in a non-transitory memory of a device comprising:
performing compression on a three-dimensional Gaussian splat (3DGS) geometry using a geometry-based point cloud compression (G-PCC) framework;
encoding scales and rotations as attributes using transform coding;
compressing positions using occupancy tree encoding;
implementing block-based graph Fourier transform (GFT) to compress the attributes; and
computing the edge weights based on a similarity between the 3D gaussian distributions using KL-divergence.

### Claim 2 (depends on 1)

The method of claim 1 wherein the 3DGS geometry includes positions, the scales, and the rotations.

### Claim 3 (depends on 1)

The method of claim 1 wherein the attributes include base colors, spherical harmonics coefficients and opacities.

### Claim 4 (depends on 1)

The method of claim 1 wherein the compression is lossless.

### Claim 5 (depends on 1)

The method of claim 1 wherein the compression is lossy.

### Claim 6 (depends on 1)

The method of claim 1 further comprising pre-processing the 3DGS geometry including performing color space conversion and spherical harmonics coefficients reduction.

### Claim 7

An apparatus comprising:
a non-transitory memory configured for storing an application, the application configured for:
performing compression on a three-dimensional Gaussian splat (3DGS) geometry using a geometry-based point cloud compression (G-PCC) framework;
encoding scales and rotations as attributes using transform coding;
compressing positions using occupancy tree encoding;
implementing block-based graph Fourier transform (GFT) to compress the attributes; and
computing the edge weights based on a similarity between the 3D gaussian distributions using KL-divergence; and
a processor configured for processing the application.

### Claim 8 (depends on 7)

The apparatus of claim 7 wherein the 3DGS geometry includes positions, the scales, and the rotations.

### Claim 9 (depends on 7)

The apparatus of claim 7 wherein the attributes include base colors, spherical harmonics coefficients and opacities.

### Claim 10 (depends on 7)

The apparatus of claim 7 wherein the compression is lossless.

### Claim 11 (depends on 7)

The apparatus of claim 7 wherein the compression is lossy.

### Claim 12 (depends on 7)

The apparatus of claim 7 wherein the application is further configured for: pre-processing the 3DGS geometry including performing color space conversion and spherical harmonics coefficients reduction.

### Claim 13

A system comprising:
an encoder configured for:
performing compression on a three-dimensional Gaussian splat (3DGS) geometry using a geometry-based point cloud compression (G-PCC) framework;
encoding scales and rotations as attributes using transform coding;
compressing positions using occupancy tree encoding;
implementing block-based graph Fourier transform (GFT) to compress the attributes; and
computing the edge weights based on a similarity between the 3D gaussian distributions using KL-divergence; and
a decoder configured for:
decoding the compressed Gaussian splat.

### Claim 14 (depends on 13)

The system of claim 13 wherein the 3DGS geometry includes positions, the scales, and the rotations.

### Claim 15 (depends on 13)

The system of claim 13 wherein the attributes include base colors, spherical harmonics coefficients and opacities.

### Claim 16 (depends on 13)

The system of claim 13 wherein the compression is lossless.

### Claim 17 (depends on 13)

The system of claim 13 wherein the compression is lossy.

### Claim 18 (depends on 13)

The system of claim 13 wherein the encoder is further configured for pre-processing the 3DGS geometry including performing color space conversion and spherical harmonics coefficients reduction.

### Claim 19

A method programmed in a non-transitory memory of a device comprising:
organizing parameters of a plurality of ordered points;
storing the plurality of ordered points in a two-dimensional structure, wherein each point of the plurality of ordered points is in a column, and attribute information is stored in each row; and
processing the plurality of ordered points and the corresponding attribute information using a video coding scheme;
processing position information using a point cloud coding-based scheme, wherein the processed attribute information and position information generates a Gaussian splat bitstream.

### Claim 20 (depends on 19)

The method of claim 19 wherein the plurality of ordered points are ordered in Morton order.

### Claim 21 (depends on 19)

The method of claim 19 wherein the attribute information comprises scales, rotations, DCs, spherical harmonics coefficients, and opacity.

### Claim 22 (depends on 19)

The method of claim 19 further comprising separating the 2D structure into two or more sub-structures.

### Claim 23 (depends on 19)

The method of claim 19 wherein the video coding scheme is selected from Advanced Video Coding, High Efficiency Video Coding or Versatile Video Coding.

### Claim 24 (depends on 19)

The method of claim 19 wherein the point cloud coding-based scheme is selected from geometry-based point cloud compression, video-based point cloud compression or artificial intelligence-based point cloud compression.
