Deep learning-based crack detection in a concrete tunnel structure using multispectral dynamic imaging
Bibliographic record
Abstract
A new computer vision-based method is proposed for concrete crack detection in tunnel structures using multi-spectral dynamic imaging (MSX). The MSX images were collected from a tunnel in the University of Manitoba, Canada. A total of 3600 MSX images (299 × 299 pixels) were used to train the modified deep inception neural network (DINN), and an additional 300 MSX images (299 × 299 pixels) were employed for validation purposes. The MSX images were examined by the trained neural network for concrete crack detection. The main purpose of this research was to examine the potential of the neural network to distinguish between noise and concrete surface cracks in the MSX images. A fully connected layer and a softmax layer were added to the DINN network in the transfer learning section to reduce the network computation cost. The proposed network used green bounding boxes to detect the portions with cracks in the MSX images. A training accuracy of 95.5% and a validation accuracy of 94% were achieved at 1600 iterations. The optimum training steps obtained from the training and validation were used for testing purposes. The robustness of the trained network was evaluated using an additional 96 MSX images (640 × 480 pixels). A maximum testing accuracy of 94% was recorded when the prediction probability was limited to 90%.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| 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 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".