Integrating Image Processing and Machine Learning for the Non-Destructive Assessment of RC Beams Damage
Bibliographic record
Abstract
Non-destructive testing (NDT) is a crucial method for detecting damages in concrete structures. Structural damage can lead to functional changes, necessitating a range of damage detection techniques. Non-destructive methods enable the pinpointing of the location of the damage without causing harm to the structure, thus saving both time and money. Damaged structures exhibit alterations in their static and dynamic properties, primarily stemming from a reduction in stiffness. Monitoring these changes allows for the determination of the failure location and severity, facilitating timely repairs and reinforcement before further deterioration occurs. A systematic approach to damage detection and assessment is pivotal for fortifying structures and preventing structural collapse, which can result in both financial and human losses. In this study, we employ image processing to categorize damaged beams based on their crack growth and propagation patterns. We also utilize support vector machine (SVM) and k-nearest neighbor (KNN) methods to detect the type, location, and extent of failures in reinforced concrete beams. To provide context and relevance for the laboratory specimens, we will compare our findings to the results from controlled experiments in a controlled laboratory setting.
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.000 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".