🤖 AI Summary
This study addresses the substantial storage bandwidth demands of 3D Gaussian Splatting (3DGS) and the limited compression efficiency of existing projection-based codecs caused by insufficient spatial coherence. To overcome these challenges, this work proposes a two-stage Morton sorting-based coding scheme for 3DGS. By employing a hierarchical strategy, the method rearranges discrete 3D Gaussian primitives and maps them into 2D feature maps exhibiting high spatial correlation, thereby enabling effective adaptation to standard video codecs such as HEVC and VVC. Experimental results demonstrate that the proposed approach significantly outperforms existing methods in both compression performance and processing speed. Consequently, this work presents an efficient, standards-compatible paradigm for 3DGS compression.
📝 Abstract
3D Gaussian Splatting (3DGS) enables high fidelity novel view synthesis but suffers from excessive storage and bandwidth requirements due to its unstructured representation. To address this, a projection based video coding framework has emerged as a leading approach, supported by MPEG's ongoing standardization, where 3DGS attributes are converted into 2D maps to take advantage of efficient compression using established video codecs such as HEVC and VVC. However, the effectiveness of this approach depends heavily on the spatial coherence of the projected video, which current sorting strategies such as PLAS and Morton ordering fail to preserve adequately, either incurring high computational cost or achieving limited correlation retention. To overcome these limitations, we propose a dual phase Morton spatial sorting algorithm that improves both coding efficiency and processing speed. In the first phase, Morton based 1D indexing is applied to high dimensional attributes to enhance spatial locality. The second phase further refines layout continuity through a structured 2D Morton mapping table that enforces spatial adjacency. This hierarchical strategy generates highly regular, block wise feature maps with strong local correlation, making them well suited for compression via conventional block based coding tools. Experimental results show that our method significantly outperforms existing approaches in both compression performance and runtime efficiency, providing a practical and standard compatible solution for 3DGS data coding.