A Robust Initial Matching Scheme for Free-Form Object Geometry
Bibliographic record
Abstract
The problem of matching two point cloud data sets, or identifying the correct rigid-body transformation between them, arises in various areas such as manufacturing inspection and object recognition. Existing methods establish the correspondence between the two data sets via the measure of shortest Euclidean distance and rely on an iterative procedure to converge to the solution. The effectiveness of such methods is highly dependent on the initial condition for the numerical iteration. This paper proposes a robust scheme to automatically generate the needed initial matching condition. The initial matching scheme undertakes the alignment in a global manner and yields a rough match of the data sets. Instead of directly minimizing the distance measure between the data sets, the focus of the initial matching is on the alignment of shape features. This is achieved by evaluating Delaunay pole spheres for the point cloud data sets and analyzing their distributions to map out the intrinsic features of the underlying surface shape. The initial matching result is then fine-tuned by the final matching step via existing methods such as the iterative closest point method. Extensive case studies have shown that the proposed initial matching scheme is able to significantly improve the matching accuracy.
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.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".