ELMF-Net: Semantic Segmentation of Large-Scale Point Clouds via Efficient Local Feature Learner and Multiscale Fusion
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The semantic segmentation of 3-D point clouds can precisely describe 3-D environmental information, serving as an important research direction for environmental perception in unmanned systems. However, existing methods face drawbacks owing to the limitations in local semantic feature representation and cross-scale information fusion capabilities. To address these issues, we propose ELMF-Net, an efficient and accurate semantic segmentation model for large-scale 3-D point clouds. First, we introduce a local feature learning method that does not rely on strict geometric relationships and establish a local feature learner (w-LFL) model to capture and aggregate locally semantic discriminative features from point clouds. Subsequently, a novel multiscale feature fusion (MSFF) module was designed to collaborate with the decoder to deeply integrate shallow encoding layer features at different resolutions and high-level semantic features from deep encoding layers, providing an efficient representation of objects with varying scales. Finally, we validate the performance of ELMF-Net on three large-scale datasets, Stanford large-scale 3D indoor spaces dataset (S3DIS), Toronto3D, and Semantic Karlsruhe Institute of Technology and Toyota Technological Institute at Chicago (KITTI), demonstrating the excellent performance of the ELMF-Net network in large-scale, multitarget scene.
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.
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.000 | 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 it