A Novel Approach for the Inspection of Flexible Parts Without the Use of Special Fixtures
Bibliographic record
Abstract
In a free state, flexible parts may have different shapes compared to their computer-aided design (CAD) model. Such parts may likewise undergo large deformations depending on their space orientation. These conditions severely restrict the feasibility of inspecting flexible parts without restricting the deformations of the part and therefore require dedicated and expensive tools such as a conformation jig or a fixture to maintain the integrity of the part. To address these challenges, this paper proposes a new inspection method, the iterative displacement inspection (IDI) algorithm, that evaluates profile variations without the need for specialized fixtures. This study examines 32 models of simulated manufactured parts to show that the IDI algorithm can iteratively deform the meshed CAD model until it resembles the scanned manufactured part, which enables their comparison. The method deforms the mesh in such a manner so as to ensure its smoothness. This way, neither surface defects nor the measurement noise of the scanned parts are concealed during the matching process. As a result, the case studies illustrate that the method’s error essentially only represents the scanned part’s measurement noise. The inspection results, therefore, solely reflect the effect of variations from the manufacturing process itself and not the deformation of the part.
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.000 | 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.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".