Real-time drive-by bridge damage detection using deep auto-encoder
Bibliographic record
Abstract
Structural health condition monitoring of bridge structures has been a concern in the last decades due to their aging and deterioration, in which the core task is damage detection. Recently, the drive-by method has gained much attention as it only needs several sensors installed on the passing vehicle. In this paper, we proposed an automatic damage detection method, which can be exploited in real time when the vehicle is passing the bridge. There are three steps in the proposed method: (1) The vehicle’s framed short-time vibrations instead of full-length data are utilized for training a deep auto-encoder model; at this stage, not commonly used time-domain accelerations of the passing vehicle, but its selected frequency-domain responses are employed to circumvent the influence of noises, (2) For the bridge with unknown health conditions, damage indicators can be extracted from its passing vehicle’s short-time vibration data using the trained model, and (3) The bridge’s health states are determined by real-time extracted damage indicators. To verify the proposed idea, a U-shaped continuous beam and a model truck are used to simulate the vehicle bridge interaction system in engineering. Results showed that the proposed method could identify the bridge’s damage with an accuracy of 86.2% when different severity was considered. In addition, it was observed that higher damage severity could not be revealed by greater values of damage indicators in the laboratory test. Instead, a novel index called identified damage ratios was employed as a reference for assessing the severity of the bridge’s damage. It was shown that with the increase in damage severity, the index would increase and gradually approach 100%.
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.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".