A Novel Computer-Vision Approach Assisted by 2D-Wavelet Transform and Locality Sensitive Discriminant Analysis for Concrete Crack Detection
Bibliographic record
Abstract
This study proposes FastCrackNet, a computationally efficient crack-detection approach. Instead of a computationally costly convolutional neural network (CNN), this technique uses an effective, fully connected network, which is coupled with a 2D-wavelet image transform for analyzing and a locality sensitive discriminant analysis (LSDA) for reducing the number of features. The algorithm described here is used to detect tiny concrete cracks in two noisy adverse conditions and image shadows. By combining wavelet-based feature extraction, feature reduction, and a rapid classifier based on deep learning, this technique surpasses other image classifiers in terms of speed, performance, and resilience. In order to evaluate the accuracy and speed of FastCrackNet, two prominent pre-trained CNN architectures, namely GoogleNet and Xception, are employed. Findings reveal that FastCrackNet has better speed and accuracy than the other models. This study establishes performance and computational thresholds for classifying photos in difficult conditions. In terms of classification efficiency, FastCrackNet outperformed GoogleNet and the Xception model by more than 60 and 80 times, respectively. Furthermore, FastCrackNet's dependability was proved by its robustness and stability in the presence of uncertainties produced by network characteristics and input images, such as input image size, batch size, and input image dimensions.
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.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".