Pointmap Association and Piecewise-Plane Constraint for Consistent and Compact 3D Gaussian Segmentation Field
Wenhao Hu, Wenhao Chai, Shengyu Hao, Xiaotong Cui, Xuexiang Wen, Jenq-Neng Hwang, Gaoang Wang
TL;DR
CCGS tackles the challenge of maintaining semantic coherence across views in 3D segmentation by jointly ensuring view-consistent 2D segmentation and a compact 3D Gaussian segmentation field. It introduces pointmap-based association to unify multi-view masks and a Hungarian-matching-based mask association that tolerates partial matches, yielding consistent 2D labels and a 3D segmented point cloud. To enforce compactness and structure in the 3D field, CCGS employs piecewise-plane constrained Gaussian splatting with plane regularization and a split-projection strategy that preserves object boundaries and minimizes floaters. Experimental results on ScanNet and Replica demonstrate state-of-the-art performance in both 2D and 3D segmentation, with notable gains in multi-view consistency and downstream robustness for editing tasks. Overall, the approach provides a practical pathway to accurate, view-stable 3D scene representations suitable for perception, manipulation, and editing tasks.
Abstract
Achieving a consistent and compact 3D segmentation field is crucial for maintaining semantic coherence across views and accurately representing scene structures. Previous 3D scene segmentation methods rely on video segmentation models to address inconsistencies across views, but the absence of spatial information often leads to object misassociation when object temporarily disappear and reappear. Furthermore, in the process of 3D scene reconstruction, segmentation and optimization are often treated as separate tasks. As a result, optimization typically lacks awareness of semantic category information, which can result in floaters with ambiguous segmentation. To address these challenges, we introduce CCGS, a method designed to achieve both view consistent 2D segmentation and a compact 3D Gaussian segmentation field. CCGS incorporates pointmap association and a piecewise-plane constraint. First, we establish pixel correspondence between adjacent images by minimizing the Euclidean distance between their pointmaps. We then redefine object mask overlap accordingly. The Hungarian algorithm is employed to optimize mask association by minimizing the total matching cost, while allowing for partial matches. To further enhance compactness, the piecewise-plane constraint restricts point displacement within local planes during optimization, thereby preserving structural integrity. Experimental results on ScanNet and Replica datasets demonstrate that CCGS outperforms existing methods in both 2D panoptic segmentation and 3D Gaussian segmentation.
