SiamesePointNet: A Siamese Point Network Architecture for Learning 3D Shape Descriptor
Bibliographic record
Abstract
Abstract We present a novel deep learning approach to extract point‐wise descriptors directly on 3D shapes by introducing Siamese Point Networks, which contain a global shape constraint module and a feature transformation operator. Such geometric descriptor can be used in a variety of shape analysis problems such as 3D shape dense correspondence, key point matching and shape‐to‐scan matching. The descriptor is produced by a hierarchical encoder–decoder architecture that is trained to map geometrically and semantically similar points close to one another in descriptor space. Benefiting from the additional shape contrastive constraint and the hierarchical local operator, the learned descriptor is highly aware of both the global context and local context. In addition, a feature transformation operation is introduced in the end of our networks to transform the point features to a compact descriptor space. The feature transformation can make the descriptors extracted by our networks unaffected by geometric differences in shapes. Finally, an N‐tuple loss is used to train all the point descriptors on a complete 3D shape simultaneously to obtain point‐wise descriptors. The proposed Siamese Point Networks are robust to many types of perturbations such as the Gaussian noise and partial scan. In addition, we demonstrate that our approach improves state‐of‐the‐art results on the BHCP benchmark.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.003 |
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".