A regularize-then-enrich interaction is revealed: multi-scale features alone do not improve final segmentation, yet become highly effective when coupled with spatial regularization, underscoring that spatial coherence is aprerequisite for multi-scale representations in superpoint clustering.
Abstract
3D point cloud semantic segmentation is essential for real-world spatial understanding, yet the prohibitive cost of human annotations motivates unsupervised approaches that require no labels. Existing superpoint-based methods typically rely on spectral analysis at a fixed granularity, failing to capture the hierarchical semantic structures inherent in complex indoor scenes. To bridge this gap, we present a Multi-Scale Spatially-Constrained Partition (MSSP) framework that combines multi-scale spectral analysis with spatially-constrained clustering. Multi-scale spectral analysis constructs enriched superpoint descriptors across multiple clustering granularities; however, the resulting high-dimensional feature space calls for a structural prior to translate into cleaner segmentation. Spatially-constrained clustering supplies this prior by restricting superpoint merging to physically adjacent regions, imposing the spatial coherence needed for multi-scale features to be effective. Extensive experiments on S3DIS and ScanNet show that MSSP achieves the best mIoU among unsupervised methods on the main benchmarks, with particularly significant gains on S3DIS. Notably, our ablation reveals a regularize-then-enrich interaction: multi-scale features alone do not improve final segmentation, yet become highly effective when coupled with spatial regularization, underscoring that spatial coherence is aprerequisite for multi-scale representations in superpoint clustering.
The complex spatial structures and varying scales of point cloud data make semantic segmentation a highly challenging task. While downsampling and feature fusion are essential steps in mainstream networks, existing models often suffer from local geometry loss and multiscale semantic conflicts during these processes. To...
Experiments show that DGSRef improves diverse segmentation architectures with limited additional computation and parameters, confirming its effectiveness as a lightweight decoupled refinement framework.
GFE-Net is rigorously benchmarked on two widely adopted large-scale datasets—S3DIS and SensatUrban—yielding OA/mIoU of 89.6%/73.1% and 93.3%/61.1%, respectively.
A novel multi-relational-aware segmentation framework that leverages hypergraph theory to dynamically model higher-order semantic groupings across non-adjacent regions that achieves state-of-the-art mIoU performance on the LoveDA, Vaihingen, and Potsdam datasets.
Qi-Hao Zhang, Lan-Kun Peng, Fei-Yang Hu et al.· Journal of Imaging· 0 citations
The proposed GSSP-KAN is an efficient semantic segmentation network that integrates Kansformer with grouped separable sparse convolution, while the Grouped Separable Sparse Convolution Block (GSSP_Block) reduces redundant self-attention computation and preserves fine-grained local geometric structures.
F. Shuang, Lin-Yang Zou, Yong Li et al.· Remote Sensing· 0 citations
Despite the economic advantages of weakly supervised semantic segmentation (WSSS) in remote sensing imagery (RSI), existing VLM- and VFM-based approaches still struggle with domain-specific semantic ambiguities and geometric discontinuities. To address these challenges, we propose GeoSeC, the Geometric-Semantic Collabo...
Xiang-Rong Zhang, Jian-Xun Lai, Guan-Chun Wang et al.· IEEE Transactions on Image P...· 0 citations
Known for his clear and elegant writing style, Bertsekas shaped fields from control and optimization to large-scale computation and artificial intelligence.