Local Contextual Attention for Enhancing Kernel Point Convolution in 3D Point Cloud Semantic Segmentation
Bibliographic record
Abstract
Point cloud segmentation underpins various applications in geospatial analysis, such as autonomous navigation, urban planning, and management. Kernel Point Convolution (KPConv) has become a de facto standard for such tasks, yet its fixed geometric kernel limits the modeling of fine-grained contextual relationships—particularly in heterogeneous, real-world point cloud data. In this paper, we introduce the adaptation of a Local Contextual Attention (LCA) mechanism for the KPConv network, with reweighting kernel coefficients based on local feature similarity in the spatial proximity domain. Crucially, our lightweight design preserves KPConv’s distance-based weighting while embedding adaptive context aggregation, improving boundary delineation and small-object recognition without incurring significant computational or memory overhead. Our comprehensive experiments validate the efficacy of the proposed LCA block across multiple challenging benchmarks. Specifically, our method significantly improves segmentation performance by achieving a 20% increase in mean Intersection over Union (mIoU) on the STPLS3D dataset. Furthermore, we observe a 16% enhancement in mean F1 score (mF1) on the Hessigheim3D benchmark and a notable 15% improvement in mIoU on the Toronto3D dataset. These performance gains place LCA-KPConv among the top-performing methods reported in these benchmark evaluations. Trained models, prediction results, and the code of LCA are available in a GitHub opensource repository.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".