SurfelSoup: Learned Point Cloud Geometry Compression With a Probablistic SurfelTree Representation

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Fan, Tingyu, Gong, Ran, Hu, Yueyu, Wang, Yao
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911412320731136
author Fan, Tingyu
Gong, Ran
Hu, Yueyu
Wang, Yao
author_facet Fan, Tingyu
Gong, Ran
Hu, Yueyu
Wang, Yao
contents This paper presents SurfelSoup, an end-to-end learned surface-based framework for point cloud geometry compression, with surface-structured primitives for representation. It proposes a probabilistic surface representation, pSurfel, which models local point occupancies using a bounded generalized Gaussian distribution. In addition, the pSurfels are organized into an octree-like hierarchy, pSurfelTree, with a Tree Decision module that adaptively terminates the tree subdivision for rate-distortion optimal Surfel granularity selection. This formulation avoids redundant point-wise compression in smooth regions and produces compact yet smooth surface reconstructions. Experimental results under the MPEG common test condition show consistent gain on geometry compression over voxel-based baselines and MPEG standard G-PCC-GesTM-TriSoup, while providing visually superior reconstructions with smooth and coherent surface structures.
format Preprint
id arxiv_https___arxiv_org_abs_2602_00186
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle SurfelSoup: Learned Point Cloud Geometry Compression With a Probablistic SurfelTree Representation
Fan, Tingyu
Gong, Ran
Hu, Yueyu
Wang, Yao
Image and Video Processing
Computer Vision and Pattern Recognition
This paper presents SurfelSoup, an end-to-end learned surface-based framework for point cloud geometry compression, with surface-structured primitives for representation. It proposes a probabilistic surface representation, pSurfel, which models local point occupancies using a bounded generalized Gaussian distribution. In addition, the pSurfels are organized into an octree-like hierarchy, pSurfelTree, with a Tree Decision module that adaptively terminates the tree subdivision for rate-distortion optimal Surfel granularity selection. This formulation avoids redundant point-wise compression in smooth regions and produces compact yet smooth surface reconstructions. Experimental results under the MPEG common test condition show consistent gain on geometry compression over voxel-based baselines and MPEG standard G-PCC-GesTM-TriSoup, while providing visually superior reconstructions with smooth and coherent surface structures.
title SurfelSoup: Learned Point Cloud Geometry Compression With a Probablistic SurfelTree Representation
topic Image and Video Processing
Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2602.00186