Melt pool instability in surface polishing by laser remelting: preliminary analysis and online monitoring with K-means clustering
Bibliographic record
Abstract
Surface polishing by laser remelting (SP-LRM) is a novel, versatile, high-speed, and low-cost advanced manufacturing technology for producing high-quality surface finishes. The process utilizes a high-power laser that delivers a large amount of instantaneous energy melting a superficial thin layer of material to a molten state. This allows the melt pool to flow driven by thermocapillary and surface tension forces. The target of the process is to melt, reallocate, and resolidify surface peaks into valleys in order to yield a low surface roughness (Sa). SP-LRM, complexity arises from instabilities occurring during laser-material interactions, resulting from non-linear thermodynamics, initial surface topography, overheating, abrupt changes in laser path trajectories involving acceleration and deceleration, and various other factors. These process instabilities significantly affect the attainment of a desired smooth final surface. Presently, the identification of anomalies resulting from a specific set of laser parameters in laser remelting (LRM) is performed offline by assessing the surface topography of LRM using optical profilometer and correlating it with surface non-uniformities that are indicative of process instabilities. This study streamlines the anomaly detection process and identifies the presence of irregularities using an unsupervised clustering machine learning (ML) technique, specifically K-means clustering. During the laser remelting (LRM) process, a high-speed near-infrared (NIR) camera captures relative thermal emission images, which are then classified into a minimum of three clusters using the K-means algorithm. These clusters correspond to positive and negative axial laser beam positions, indicating shifts in the laser spot on the image, and the stability states of laser-material interactions. Preliminary findings show promising results in the employment of artificial intelligence (AI) to enhance LRM as a conventional industrial technology for polishing and structuring tooling surfaces.
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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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".