The study on Point Cloud Semantic Segmentation Based on RandLA-Net Algorithm
Bibliographic record
Abstract
3D point cloud semantic segmentation is widely used in many fields, such as autonomous driving and robotics, and is crucial for path planning and obstacle avoidance in autonomous navigation. However, existing methods suffer from poor generalization and high computational complexity when dealing with large-scale point cloud data. This paper proposes a lightweight improved point cloud semantic segmentation algorithm based on RandLA Net. Firstly, by introducing residual connections, the network’s feature transfer capability has been enhanced. Data augmentation techniques further improves the model’s generalization ability. Secondly, by integrating attention mechanisms and proposing new weights for loss functions, the accuracy of semantic segmentation has been improved. Finally, in order to facilitate the observation of segmentation results, the 3D point cloud was visualized using the Meshlab tool. Experiments on the S3DIS dataset and real-world scenarios show that the improved RandLA Net algorithm proposed in this paper has better segmentation accuracy and generalization than the original RandLA Net algorithm, and has significant performance improvements compared to classic algorithms such as PointNet and PointNet++.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".