Hybrid Elman Neural Network and an Invasive Weed Optimization Method for Bridge Defect Recognition
Bibliographic record
Abstract
Existing bridges are aging and deteriorating, raising concerns for public safety and the preservation of these valuable assets. Furthermore, the transportation networks that manage many bridges face budgetary constraints. This state of affairs necessitates the development of a computer vision-based method to alleviate shortcomings in visual inspection-based methods. In this context, the present study proposes a three-tier method for the automated detection and recognition of bridge defects. In the first tier, singular value decomposition ([Formula: see text]) is adopted to formulate the feature vector set through mapping the most dominant spatial domain features in images. The second tier encompasses a hybridization of the Elman neural network ([Formula: see text]) and the invasive weed optimization (I[Formula: see text]) algorithm to enhance the prediction performance of the ENN. This is accomplished by designing a variable optimization mechanism that aims at searching for the optimum exploration–exploitation trade-off in the neural network. The third tier involves validation through comparisons against a set of conventional machine-learning and deep-learning models capitalizing on performance prediction and statistical significance tests. A computerized platform was programmed in C#.net to facilitate implementation by the users. It was found that the method developed outperformed other prediction models achieving overall accuracy, F-measure, Kappa coefficient, balanced accuracy, Matthews’s correlation coefficient, and area under curve of 0.955, 0.955, 0.914, 0.965, 0.937, and 0.904, respectively as per cross validation. It is expected that the method developed can improve the decision-making process in bridge management systems.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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 teacher head, 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".