Point Cloud Classification and Segmentation Based on Graph Walk and Graph Attention
Bibliographic record
Abstract
Aiming at the shortage of distance feature and local geometric structure information in feature extraction, a point cloud classification and segmentation network based on graph walk and graph attention was proposed. Firstly, a guided graph walk algorithm was used to supplement additional geometric information and remote feature information to the whole feature of point cloud. Secondly, the graph attention mechanism was embedded to make the model on the key areas of the point cloud and improve the feature extraction ability of the network. Finally, distance features were extracted from the initial point cloud and embedded into the network as initial residuals to avoid oversmoothing. Point cloud classification experiments were carried out on ModelNet40 dataset and ScanObjectNN dataset, and point cloud component segmentation and point cloud semantic segmentation experiments were carried out on ShapeNetPart dataset and Toronto-3D dataset, respectively. The experiment results showed that, compared with the benchmark network DGCNN, classification accuracy increased by 1. 3 percentages and 5. 6 percentages, respectively; The segmentation accuracy was improved by 1. 2 percentages and 33. 1 percentages respectively. Through the robust analysis on ModelNet40-C dataset, it was proved that the proposed network had strong robustness.
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.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.002 |
| 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".