Vibration-based Multi-class Damage Detection and Localization Using Long Short-Term Memory (LSTM) Networks
Bibliographic record
Abstract
In this paper, a novel method is proposed for detecting and localizing structural damage by classifying acceleration responses of a structure using a long short-term memory (LSTM) network. Windows of samples are extracted from acceleration responses in a novel data pre-processing pipeline, and an LSTM network is developed to classify the signals into multiple classes. A predicted classification of a signal by the LSTM network into one of the damage levels indicates a damage detection. Furthermore, multiple signals obtained from the vibration sensors placed on a structure are provided as input to the LSTM model, and the resulting predicted class probabilities are used to identify the locations with high probability of damage. The proposed method is validated on the experimental setup of the Qatar University Grandstand Simulator (QUGS) for binary classification, as well as, full-scale study of the Z24 bridge benchmark data for multi-class damage classification. Experiments show that the proposed LSTM-based method performs on par with 1D convolutional neural networks (1D CNN) on the QUGS dataset, and outperforms the 1D CNN on the Z24 dataset. The novelty of this study lies in the use of recurrent neural network based LSTM for vibration data for multi-class damage identification and localization.
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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".