SAT-Former: An Efficient 3-D Transformer With Semantic Aggregated Point Tokenizer for Point Cloud Semantic Segmentation in Urban Scenes
Bibliographic record
Abstract
3D Transformers have advanced point cloud understanding, but prevalent token generation methods (e.g., Farthest Point Sampling and k-Nearest Neighbors clustering) over-rely on geometric properties while neglecting semantic information. In urban scene point clouds, these methods cannot easily form semantically homogeneous neighborhoods, which forces semantic confusion in point tokens and weakening the self-attention mechanism's ability to model token similarity. Additionally, processing large-scale point clouds leads to excessive tokens, imposing high computational costs of attention calculations and reducing efficiency. Therefore, from the perspective of semantic information, this paper re-examines the point token generation problem and accordingly proposes an efficient 3D Transformer withSemanticAggregated pointTokenizer (SAT-Former) for point cloud semantic segmentation in urban scenes. The developed tokenizer comprises two key modules: the Relation Reasoning Module (RRM) and the Feature Mapping Module (FMM). RRM captures inter-token relationships, generating semantic homogeneity guidance to effectively transmission and integrate semantic information, thereby reducing semantic confusion. FMM maps point-level features onto the semantically homogeneous guided tokens generated by RRM, enhancing token expressiveness while preserving essential details. We evaluate SAT-Former on three urban scene point cloud datasets: Hessigheim 3D (H3D), Toronto-3D (T3D), and SensatUrban, demonstrating competitive performance and up to$30\times$faster inference efficiency than baseline methods while maintaining >95% of their accuracy. Additionally, extensive visualization experiments highlight the semantic homogeneity and feature representativeness of the generated tokens, providing insights into the model's internal mechanisms and validating its effectiveness.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.014 | 0.006 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".